Σ_{𝑛}-bounding and Δ_{𝑛}-induction

DOI10.1090/S0002-9939-04-07294-6MaRDI QIDQ4813658zbMATH OpenFDO

Authors Theodore A. Slaman

Publication date 13 August 2004

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/S0002-9939-04-07294-6

zbMATH Keywords

collectionfragments of arithmeticinductionleast number principle

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30)

Recommendations

• A Note on BΣ_n and an Intermediate Induction Schema
• scientific article; zbMATH DE number 4035826
• A note on Δ₁induction and Σ₁collection
• Bounded Induction and Satisfaction Classes
• Induction, minimization and collection for \(\Delta_{n+1}(T)\)-formulas

Cited in

(38)

• The computability, definability, and proof theory of Artinian rings
• Not all Kripke models of \(\mathsf{HA}\) are locally \(\mathsf{PA}\)
• Schmerl decompositions in first order arithmetic
• Unifying the model theory of first-order and second-order arithmetic via \(\mathrm{WKL}_0^\ast\)
• On axiom schemes for \(T\)-provably \(\Delta_1\) formulas
• Comparing the strength of diagonally nonrecursive functions in the absence of _2⁰ induction
• 1-Generic Degrees Bounding Minimal Degrees Revisited
• On principles between _1- and _2-induction, and monotone enumerations
• The metamathematics of Stable Ramsey’s Theorem for Pairs
• Inductive inference and reverse mathematics
• Fragments of Kripke-Platek set theory and the metamathematics of -recursion theory
• Pell Equations and Weak Regularity Principles
• On the role of the collection principle for \(\Sigma ^0_2\)-formulas in second-order reverse mathematics
• 2009 North American Annual Meeting of the Association for Symbolic Logic
• scientific article; zbMATH DE number 4035826 (Why is no real title available?)
• A recursion-theoretic characterization of instances of $ΒΣ_n$ provable in $П_{n+1}(N)$
• \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs
• \(\Delta_{2}\) degrees without \(\Sigma_{1}\) induction
• Fragments of Arithmetic and true sentences
• A Note on BΣ_n and an Intermediate Induction Schema
• 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}
• Gödel's second incompleteness theorem: how it is derived and what it delivers
• The inductive strength of Ramsey's theorem for pairs
• Randomness notions and reverse mathematics
• Where pigeonhole principles meet Koenig lemmas
• Any FIP real computes a 1-generic
• Induction, bounding, weak combinatorial principles, and the homogeneous model theorem
• 2006 Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '06
• On a Problem of J. Paris
• A note on Δ₁induction and Σ₁collection
• Primitive recursive reverse mathematics
• The strength of sharply bounded induction requires MSP
• Erdős-Moser and I _2
• Isolated d.c.e. degrees and _1 induction
• Conservation of Ramsey's theorem for pairs and well-foundedness
• On the quantifier complexity of \(\Delta_{n+1}(T)\)-induction
• Induction, minimization and collection for \(\Delta_{n+1}(T)\)-formulas
• The minimal e-degree problem in fragments of Peano arithmetic

This page was built for publication: Σ_{𝑛}-bounding and Δ_{𝑛}-induction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4813658)