Re: Axiomatization of Ordinal Arithmetic
- From: Jack Campin - bogus address <bogus@xxxxxxxxxxxxxxxx>
- Date: Sun, 22 Oct 2006 18:27:11 +0100
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
.
- References:
- Axiomatization of Ordinal Arithmetic
- From: lugita15
- Axiomatization of Ordinal Arithmetic
- Prev by Date: Re: Halting Problem for Humans
- Next by Date: Re: Halting Problem for Humans
- Previous by thread: Re: Axiomatization of Ordinal Arithmetic
- Next by thread: Re: Axiomatization of Ordinal Arithmetic
- Index(es):
Relevant Pages
|