On the relationship between ATR0 and

DOI10.2307/2275783zbMath0858.03052OpenAlexW2004519519MaRDI QIDQ5687314

Jeremy Avigad

Publication date: 12 December 1996

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2275783

zbMATH Keywords

proof-theoretic ordinalsleast impredicative ordinal

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Second- and higher-order arithmetic and fragments (03F35) Recursive ordinals and ordinal notations (03F15)

Related Items

An intensional fixed point theory over first order arithmetic ⋮ Bounded inductive dichotomy: separation of open and clopen determinacies with finite alternatives in constructive contexts ⋮ Forcing for hat inductive definitions in arithmetic ⋮ The proof-theoretic analysis of \(\Sigma_{1}^{1}\) transfinite dependent choice ⋮ A Model-Theoretic Approach to Ordinal Analysis ⋮ A few more dissimilarities between second-order arithmetic and set theory ⋮ Intuitionistic fixed point theories over set theories ⋮ The Operational Perspective: Three Routes ⋮ 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10 ⋮ Full and hat inductive definitions are equivalent in NBG ⋮ On the relationship between fixed points and iteration in admissible set theory without foundation ⋮ Elementary inductive dichotomy: separation of open and clopen determinacies with infinite alternatives ⋮ Predicative functionals and an interpretation of \({\widehat{\text{ID}}_{<\omega}}\) ⋮ Having a Look Again at Some Theories ofProof-Theoretic Strengths around $$ \varGamma_{0} $$ ⋮ FINITIST AXIOMATIC TRUTH

Cites Work

• Unnamed Item
• Herbrand analyses
• On the strength of König's duality theorem for countable bipartite graphs