On the quantifier complexity of \(\Delta_{n+1}(T)\)-induction

DOI10.1007/S00153-003-0198-7zbMath1061.03065OpenAlexW1523846338MaRDI QIDQ701734

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

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-0198-7

zbMATH Keywords

inductionquantifier complexity\(\Delta_{n+1}\)-formulas

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30)

Related Items (2)

On axiom schemes for \(T\)-provably \(\Delta_1\) formulas ⋮ A note on parameter free Π₁ -induction and restricted exponentiation

This page was built for publication: On the quantifier complexity of \(\Delta_{n+1}(T)\)-induction