Switch to: Citations

Add references

You must login to add references.
  1. Reverse mathematics and ordinal exponentiation.Jeffry L. Hirst - 1994 - Annals of Pure and Applied Logic 66 (1):1-18.
    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].
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  • Computable aspects of the Bachmann–Howard principle.Anton Freund - 2019 - Journal of Mathematical Logic 20 (2):2050006.
    We have previously established that [Formula: see text]-comprehension is equivalent to the statement that every dilator has a well-founded Bachmann–Howard fixed point, over [Formula: see text]. In this paper, we show that the base theory can be lowered to [Formula: see text]. We also show that the minimal Bachmann–Howard fixed point of a dilator [Formula: see text] can be represented by a notation system [Formula: see text], which is computable relative to [Formula: see text]. The statement that [Formula: see text] (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations