Transfinite induction within Peano arithmetic
From MaRDI portal
Publication:1919522
DOI10.1016/0168-0072(95)00029-GzbMath0858.03056MaRDI QIDQ1919522
Publication date: 19 March 1997
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
03F30: First-order arithmetic and fragments
Related Items
A Model-Theoretic Approach to Ordinal Analysis, Some results on cut-elimination, provable well-orderings, induction and reflection, Transfinite induction within Peano arithmetic, Parameter free induction and provably total computable functions, More on lower bounds for partitioning \(\alpha\)-large sets, Partitioning 𝛼–large sets: Some lower bounds, Variations on a theme by Weiermann
Cites Work
- Rapidly growing Ramsey functions
- Ordinal complexity of recursive definitions
- Transfinite induction within Peano arithmetic
- Exact estimates of the provability of transfinite induction in the initial segments of arithmetic
- Theory of Formal Systems. (AM-47)
- A classification of the ordinal recursive functions
- Transfinite recursive progressions of axiomatic theories
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item