Reverse mathematics and ordinal exponentiation

Annals of Pure and Applied Logic 66 (1):1-18 (1994)
  Copy   BIBTEX

Abstract

Simpson has claimed that “ATR0 is the weakest set of axioms which permits the development of a decent theory of countable ordinals” [8]. This paper provides empirical support for Simpson's claim. In particular, Cantor's Normal Form Theorem and Sherman's Inequality for countable well-orderings are both equivalent to ATR0. The proofs of these results require a substantial development of ordinal exponentiation and a strengthening of the comparability result in [3]

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,127

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2014-01-16

Downloads
27 (#609,703)

6 months
13 (#219,908)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Open questions in reverse mathematics.Antonio Montalbán - 2011 - Bulletin of Symbolic Logic 17 (3):431-454.
Computable aspects of the Bachmann–Howard principle.Anton Freund - 2019 - Journal of Mathematical Logic 20 (2):2050006.
The veblen functions for computability theorists.Alberto Marcone & Antonio Montalbán - 2011 - Journal of Symbolic Logic 76 (2):575 - 602.
Well ordering principles and -statements: A pilot study.Anton Freund - 2021 - Journal of Symbolic Logic 86 (2):709-745.
Indecomposable linear orderings and hyperarithmetic analysis.Antonio Montalbán - 2006 - Journal of Mathematical Logic 6 (1):89-120.

View all 20 citations / Add more citations