Timeline for Peano (Dedekind) categoricity
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 23, 2013 at 15:02 | comment | added | Emil Jeřábek | FO+TC is certainly enough: you can express that every element is accessible from 0 by the transitive closure of the successor relation. | |
| Dec 23, 2013 at 8:44 | comment | added | Asaf Karagila♦ | It is enough to add the quantifier $\forall^\infty x$ meaning for all but finitely many. | |
| Dec 23, 2013 at 8:42 | comment | added | alexod | The paper "Reverse mathematics and Peano categoricity" by Simpson and Yokoama may be related to you question. A preprint is available at personal.psu.edu/t20/papers/rmpc.pdf . | |
| Dec 23, 2013 at 8:31 | review | First posts | |||
| Dec 23, 2013 at 8:32 | |||||
| Dec 23, 2013 at 8:13 | history | asked | Thinniyam Srinivasan Ramanatha | CC BY-SA 3.0 |