Fragments of Arithmetic and true sentences
From MaRDI portal
Publication:4680381
Recommendations
Cites work
- scientific article; zbMATH DE number 4039892 (Why is no real title available?)
- scientific article; zbMATH DE number 3702663 (Why is no real title available?)
- scientific article; zbMATH DE number 51556 (Why is no real title available?)
- Induction rules, reflection principles, and provably recursive functions
- Induction, minimization and collection for \(\Delta_{n+1}(T)\)-formulas
- On parameter free induction schemas
- On the induction schema for decidable predicates
- On the scheme of induction for bounded arithmetic formulas
- Parameter free induction and provably total computable functions
- Some result on \({\mathbf L}\Delta_{n+1}^-\)
- The optimality of induction as an axiomatization of arithmetic
- Σ_{𝑛}-bounding and Δ_{𝑛}-induction
Cited in
(13)- Semi-honest subrecursive degrees and the collection rule in arithmetic
- Fragments of arithmetic
- Theories of initial segments of standard models of arithmetics and their complete extensions
- scientific article; zbMATH DE number 4083623 (Why is no real title available?)
- Hierarchical incompleteness results for arithmetically definable extensions of fragments of arithmetic
- Order types of models of fragments of Peano arithmetic
- scientific article; zbMATH DE number 4039892 (Why is no real title available?)
- PREDICATIVITY THROUGH TRANSFINITE REFLECTION
- A note on Σ1-maximal models
- On axiom schemes for \(T\)-provably \(\Delta_1\) formulas
- On collection schemes and Gaifman's splitting theorem
- A note on parameter free \(\Pi _{1}\)-induction and restricted exponentiation
- scientific article; zbMATH DE number 4202241 (Why is no real title available?)
This page was built for publication: Fragments of Arithmetic and true sentences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4680381)