On axiom schemes for \(T\)-provably \(\Delta_1\) formulas

DOI10.1007/S00153-014-0368-9zbMath1303.03088OpenAlexW1992999128WikidataQ114018318 ScholiaQ114018318MaRDI QIDQ2449854

F. F. Lara-Martín, A. Fernández-Margarit, Andrés Cordón-Franco

Publication date: 12 May 2014

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-014-0368-9

zbMATH Keywords

fragments of Peano arithmeticprovably total computable functions\(\Delta_1\) formulas

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (2)

Semi-honest subrecursive degrees and the collection rule in arithmetic ⋮ END-EXTENSIONS OF MODELS OF WEAK ARITHMETIC FROM COMPLEXITY-THEORETIC CONTAINMENTS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the quantifier complexity of \(\Delta_{n+1}(T)\)-induction
• Induction, minimization and collection for \(\Delta_{n+1}(T)\)-formulas
• A proof-theoretic analysis of collection
• Induction rules, reflection principles, and provably recursive functions
• Saturated models of universal theories
• Truth definitions without exponentiation and the Σ₁ collection scheme
• A note on parameter free Π₁ -induction and restricted exponentiation
• On parameter free induction schemas
• Grzegorcyk's hierarchy and IepΣ₁
• On the induction schema for decidable predicates
• Fragments of Arithmetic and true sentences
• Σ_{𝑛}-bounding and Δ_{𝑛}-induction
• Computer Science Logic
• On a Problem of J. Paris
• Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
• On n-quantifier induction
• A note on Δ₁induction and Σ₁collection

This page was built for publication: On axiom schemes for \(T\)-provably \(\Delta_1\) formulas