A Model-Theoretic Approach to Ordinal Analysis
From MaRDI portal
Publication:4338039
Recommendations
Cites work
- scientific article; zbMATH DE number 3857078 (Why is no real title available?)
- scientific article; zbMATH DE number 51556 (Why is no real title available?)
- A classification of the ordinal recursive functions
- Formalizing forcing arguments in subsystems of second-order arithmetic
- Inductive full satisfaction classes
- On the relationship between ATR0 and
- On the strength of König's duality theorem for countable bipartite graphs
- Proof theory of reflection
- Rapidly growing Ramsey functions
- Subsystems of true arithmetic and hierarchies of functions
- Transfinite induction within Peano arithmetic
Cited in
(14)- scientific article; zbMATH DE number 1870411 (Why is no real title available?)
- A model theoretic approach to proof theory of arithmetic
- Theories and Ordinals: Ordinal Analysis
- Relativized ordinal analysis: the case of power Kripke-Platek set theory
- Classifying the Provably Total Functions of PA
- Ordinal definability in Jensen's model
- scientific article; zbMATH DE number 1995970 (Why is no real title available?)
- Dynamic ordinal analysis
- The model-theoretic ordinal analysis of theories of predicative strength
- Saturated models of universal theories
- Partitioning 𝛼–large sets: Some lower bounds
- More on lower bounds for partitioning \(\alpha\)-large sets
- A note on predicative ordinal analysis. I. Iterated comprehension and transfinite induction
- A model of the generic Vopěnka principle in which the ordinals are not Mahlo
This page was built for publication: A Model-Theoretic Approach to Ordinal Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4338039)