Re: Axiomatization of Ordinal Arithmetic



It is very easy to formalize arithmetic of finite numbers, i.e.
First-order Peano Arithmetic. What I'm wondering is, whether there
might exist such a simple axiomatization of ordinal numbers in general.
It seems to me that such a formalization ought to contain axioms
defining 0, the various ordinal operations such as successor, addition,
multiplication, exponentiation etc., some way of producing limit
ordinals, and some implementation of transfinite induction. Similar to
PA, this axiomatization should ideally only use ordinal notions, and
not use such thing as set theory, the von Neumann definition of
ordinals, etc.

If I remember right, Tarski's book "Ordinal Algebras" does something
like that.

============== j-c ====== @ ====== purr . demon . co . uk ==============
Jack Campin: 11 Third St, Newtongrange EH22 4PU, Scotland | tel 0131 660 4760
<http://www.purr.demon.co.uk/jack/> for CD-ROMs and free | fax 0870 0554 975
stuff: Scottish music, food intolerance, & Mac logic fonts | mob 07800 739 557
.



Relevant Pages

  • Re: Axiomatization of Ordinal Arithmetic
    ... It's much easier to see that Peano's Axioms ... I do not care which axiomatization is most efficient. ... The sum of a and the succesor of b is equal to the succesor of the ... ordinals, and some implementation of transfinite induction. ...
    (sci.logic)
  • Re: is there a set of all ordinals
    ... axiomatization of what they call 'Bernays theory'. ... equivalent to the standard definition of Von Neumann's ordinals. ... since in CLASS theory we get a conflict by using the defintion you ... such that there exist a class that contain it as a member. ...
    (sci.logic)
  • Re: Axiomatization of Ordinal Arithmetic
    ... It's much easier to see that Peano's Axioms ... I do not care which axiomatization is most efficient. ... ordinals, and some implementation of transfinite induction. ... to me that the only way of producing limit ordinals is to use the ...
    (sci.logic)
  • Re: is there a set of all ordinals
    ... axiomatization of what they call 'Bernays theory'. ... equivalent to the standard definition of Von Neumann's ordinals. ... since in CLASS theory we get a conflict by using the defintion you ... such that there exist a class that contain it as a member. ...
    (sci.logic)
  • Re: Axiomatization of Ordinal Arithmetic
    ... It's much easier to see that Peano's Axioms ... I do not care which axiomatization is most efficient. ... ordinals, and some implementation of transfinite induction. ... to me that the only way of producing limit ordinals is to use the ...
    (sci.logic)

Quantcast