http://lem12.uksw.edu.pl/index.php?title=Algorithmic_theory_of_rational_numbers&feed=atom&action=historyAlgorithmic theory of rational numbers - Historia wersji2024-03-28T17:49:51ZHistoria wersji tej strony wikiMediaWiki 1.23.8http://lem12.uksw.edu.pl/index.php?title=Algorithmic_theory_of_rational_numbers&diff=2570&oldid=prevAndrzejSalwicki o 11:12, 2 paź 20182018-10-02T11:12:13Z<p></p>
<table class='diff diff-contentalign-left'>
<col class='diff-marker' />
<col class='diff-content' />
<col class='diff-marker' />
<col class='diff-content' />
<tr style='vertical-align: top;'>
<td colspan='2' style="background-color: white; color:black; text-align: center;">← poprzednia wersja</td>
<td colspan='2' style="background-color: white; color:black; text-align: center;">Wersja z 11:12, 2 paź 2018</td>
</tr><tr><td colspan="2" class="diff-lineno">Linia 1:</td>
<td colspan="2" class="diff-lineno">Linia 1:</td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>'''Theorem'''. Axioms of ordered field and algorithmic formula saying for all n and m the Euclid's algorithm terminates uniquely determine the structure of rational numbers. <br /></div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>'''Theorem'''. Axioms of ordered field and algorithmic formula saying for all n and m the Euclid's algorithm terminates uniquely determine the structure of rational numbers. <br /></div></td></tr>
<tr><td class='diff-marker'>−</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>For the proof consult <del class="diffchange diffchange-inline">[AK1] </del>[[Media:Kreczmar-Program-Fields.pdf| {{Cytuj pismo |odn=a | imię=Antoni | nazwisko=Kreczmar |tytuł=Programmability in Fields |czasopismo=Fundamenta Informaticae |strony=195-230 |rok=1977}}]]</div></td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>For the proof consult <ins class="diffchange diffchange-inline"> </ins>[[Media:Kreczmar-Program-Fields.pdf| {{Cytuj pismo |odn=a | imię=Antoni | nazwisko=Kreczmar |tytuł=Programmability in Fields |czasopismo=Fundamenta Informaticae |strony=195-230 |rok=1977}}]]</div></td></tr>
</table>AndrzejSalwickihttp://lem12.uksw.edu.pl/index.php?title=Algorithmic_theory_of_rational_numbers&diff=2569&oldid=prevAndrzejSalwicki o 11:10, 2 paź 20182018-10-02T11:10:15Z<p></p>
<table class='diff diff-contentalign-left'>
<col class='diff-marker' />
<col class='diff-content' />
<col class='diff-marker' />
<col class='diff-content' />
<tr style='vertical-align: top;'>
<td colspan='2' style="background-color: white; color:black; text-align: center;">← poprzednia wersja</td>
<td colspan='2' style="background-color: white; color:black; text-align: center;">Wersja z 11:10, 2 paź 2018</td>
</tr><tr><td colspan="2" class="diff-lineno">Linia 1:</td>
<td colspan="2" class="diff-lineno">Linia 1:</td></tr>
<tr><td class='diff-marker'>−</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>Axioms of ordered field and algorithmic formula saying for all n and m the Euclid's algorithm terminates.</div></td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins class="diffchange diffchange-inline">'''Theorem'''. </ins>Axioms of ordered field and algorithmic formula saying for all n and m the Euclid's algorithm terminates <ins class="diffchange diffchange-inline">uniquely determine the structure of rational numbers. <br /></ins></div></td></tr>
<tr><td colspan="2"> </td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins class="diffchange diffchange-inline">For the proof consult [AK1] [[Media:Kreczmar-Program-Fields</ins>.<ins class="diffchange diffchange-inline">pdf| {{Cytuj pismo |odn=a | imię=Antoni | nazwisko=Kreczmar |tytuł=Programmability in Fields |czasopismo=Fundamenta Informaticae |strony=195-230 |rok=1977}}]]</ins></div></td></tr>
</table>AndrzejSalwickihttp://lem12.uksw.edu.pl/index.php?title=Algorithmic_theory_of_rational_numbers&diff=2396&oldid=prevAndrzejSalwicki: Utworzono nową stronę "Axioms of ordered field and algorithmic formula saying for all n and m the Euclid's algorithm terminates."2017-08-08T16:30:46Z<p>Utworzono nową stronę "Axioms of ordered field and algorithmic formula saying for all n and m the Euclid's algorithm terminates."</p>
<p><b>Nowa strona</b></p><div>Axioms of ordered field and algorithmic formula saying for all n and m the Euclid's algorithm terminates.</div>AndrzejSalwicki