Σ_{𝑛}-bounding and Δ_{𝑛}-induction
From MaRDI portal
Publication:4813658
DOI10.1090/S0002-9939-04-07294-6zbMath1053.03034MaRDI QIDQ4813658
Publication date: 13 August 2004
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Related Items (26)
The computability, definability, and proof theory of Artinian rings ⋮ Inductive inference and reverse mathematics ⋮ Fragments of Kripke-Platek set theory and the metamathematics of \(\alpha \)-recursion theory ⋮ The metamathematics of Stable Ramsey’s Theorem for Pairs ⋮ Unifying the model theory of first-order and second-order arithmetic via \(\mathrm{WKL}_0^\ast\) ⋮ Any FIP real computes a 1-generic ⋮ Primitive recursive reverse mathematics ⋮ RANDOMNESS NOTIONS AND REVERSE MATHEMATICS ⋮ Pell Equations and Weak Regularity Principles ⋮ Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem ⋮ \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs ⋮ 1-Generic Degrees Bounding Minimal Degrees Revisited ⋮ \(\Delta_{2}\) degrees without \(\Sigma_{1}\) induction ⋮ On axiom schemes for \(T\)-provably \(\Delta_1\) formulas ⋮ On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics ⋮ The inductive strength of Ramsey's theorem for pairs ⋮ Where pigeonhole principles meet Koenig lemmas ⋮ Weak forms of the Regularity Principle in the presence of \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\bf {\mathsf {I}{\mathrm{E}}_1}$\end{document} ⋮ 2006 Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '06 ⋮ The minimal e-degree problem in fragments of Peano arithmetic ⋮ Fragments of Arithmetic and true sentences ⋮ COMPARING THE STRENGTH OF DIAGONALLY NONRECURSIVE FUNCTIONS IN THE ABSENCE OF INDUCTION ⋮ GÖDEL’S SECOND INCOMPLETENESS THEOREM: HOW IT IS DERIVED AND WHAT IT DELIVERS ⋮ Not all Kripke models of \(\mathsf{HA}\) are locally \(\mathsf{PA}\) ⋮ 2009 North American Annual Meeting of the Association for Symbolic Logic ⋮ Schmerl decompositions in first order arithmetic
Cites Work
This page was built for publication: Σ_{𝑛}-bounding and Δ_{𝑛}-induction
