A Model-Theoretic Approach to Ordinal Analysis

DOI10.2307/421195zbMath0874.03068OpenAlexW2152101391MaRDI QIDQ4338039

Jeremy Avigad, Richard Sommer

Publication date: 5 November 1997

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

Full work available at URL: http://www.math.ucla.edu/~asl/bsl/0301-toc.htm

zbMATH Keywords

models of arithmeticordinal analysistrue arithmeticnon-standard modelproof-theoretic ordinals\(\alpha\)-largeness

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Nonstandard models of arithmetic (03H15) Models of arithmetic and set theory (03C62) Second- and higher-order arithmetic and fragments (03F35) Recursive ordinals and ordinal notations (03F15)

Related Items

More on lower bounds for partitioning \(\alpha\)-large sets, A NOTE ON PREDICATIVE ORDINAL ANALYSIS I: ITERATED COMPREHENSION AND TRANSFINITE INDUCTION, Partitioning 𝛼–large sets: Some lower bounds, Classifying the Provably Total Functions of PA, Saturated models of universal theories

Cites Work

• Unnamed Item
• Unnamed Item
• Subsystems of true arithmetic and hierarchies of functions
• Inductive full satisfaction classes
• Rapidly growing Ramsey functions
• Proof theory of reflection
• Transfinite induction within Peano arithmetic
• Formalizing forcing arguments in subsystems of second-order arithmetic
• On the strength of König's duality theorem for countable bipartite graphs
• A classification of the ordinal recursive functions
• On the relationship between ATR₀ and