Fragments of Arithmetic and true sentences

DOI10.1002/MALQ.200410034MaRDI QIDQ4680381zbMATH OpenOpenAlexFDO

Authors Andrés Cordón-Franco, Alejandro Fernández Margarit, F. Félix Lara Martin

Publication date 1 June 2005

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://idus.us.es/handle//11441/87545

zbMATH Keywords

\(\Delta_{n+1}\)-formulasfragments of arithmeticparameter-free schemesquantifier complexitytrue sentences

Mathematics Subject Classification ID

Models of arithmetic and set theory (03C62) First-order arithmetic and fragments (03F30) Nonstandard models of arithmetic (03H15)

Recommendations

• On the quantifier complexity of \(\Delta_{n+1}(T)\)-induction
• On parameter free induction schemas
• scientific article; zbMATH DE number 4039892
• A note on parameter free \(\Pi _{1}\)-induction and restricted exponentiation
• On axiom schemes for \(T\)-provably \(\Delta_1\) formulas

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)

• On axiom schemes for \(T\)-provably \(\Delta_1\) formulas
• A note on parameter free \(\Pi _{1}\)-induction and restricted exponentiation
• scientific article; zbMATH DE number 4202241 (Why is no real title available?)
• scientific article; zbMATH DE number 4039892 (Why is no real title available?)
• 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
• PREDICATIVITY THROUGH TRANSFINITE REFLECTION
• A note on Σ₁-maximal models
• Theories of initial segments of standard models of arithmetics and their complete extensions
• Semi-honest subrecursive degrees and the collection rule in arithmetic
• On collection schemes and Gaifman's splitting theorem
• Fragments of arithmetic

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)