Induction, minimization and collection for _n+1(T)-formulas

DOI10.1007/S00153-003-0197-8MaRDI QIDQ701746zbMATH OpenOpenAlexFDO

Authors Alejandro Fernández Margarit, F. Félix Lara Martin

Publication date 16 December 2004

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

Full work available at URL https://doi.org/10.1007/s00153-003-0197-8

zbMATH Keywords

collectioninduction\(\Delta_{n+1}\)-formulasleast number principle

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Nonstandard models of arithmetic (03H15)

Recommendations

• On the quantifier complexity of \(\Delta_{n+1}(T)\)-induction
• On axiom schemes for \(T\)-provably \(\Delta_1\) formulas
• scientific article; zbMATH DE number 4035826
• Σ_{𝑛}-bounding and Δ_{𝑛}-induction
• On parameter free induction schemas

Cited in

(8)

• A note on Δ₁induction and Σ₁collection
• On the induction schema for decidable predicates
• Fragments of Arithmetic and true sentences
• Local induction and provably total computable functions
• scientific article; zbMATH DE number 4035826 (Why is no real title available?)
• On axiom schemes for \(T\)-provably \(\Delta_1\) formulas
• Σ_{𝑛}-bounding and Δ_{𝑛}-induction
• A note on parameter free \(\Pi _{1}\)-induction and restricted exponentiation

This page was built for publication: Induction, minimization and collection for \(\Delta_{n+1}(T)\)-formulas

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