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

DOI10.1007/S00153-003-0197-8zbMATH Open1061.03066OpenAlexW2041820615MaRDI QIDQ701746FDOQ701746

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

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cited In (8)

• Local induction and provably total computable functions
• Title not available (Why is that?)
• A note on parameter free Π₁ -induction and restricted exponentiation
• Fragments of Arithmetic and true sentences
• Σ_{𝑛}-bounding and Δ_{𝑛}-induction
• On the induction schema for decidable predicates
• A note on Δ₁induction and Σ₁collection
• On axiom schemes for \(T\)-provably \(\Delta_1\) formulas

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)