On the induction schema for decidable predicates

DOI10.2178/jsl/1045861504zbMath1041.03042OpenAlexW2079353347MaRDI QIDQ4457724

Lev D. Beklemishev

Publication date: 25 March 2004

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/26979

zbMATH Keywords

induction principlefragment of Peano arithmeticdecidable predicatesleast element principleoracle computable functions

Mathematics Subject Classification ID

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

Related Items

Provability algebras and proof-theoretic ordinals. I, Semi-honest subrecursive degrees and the collection rule in arithmetic, On axiom schemes for \(T\)-provably \(\Delta_1\) formulas, 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10, Honest elementary degrees and degrees of relative provability without the cupping property, Fragments of Arithmetic and true sentences, On the query complexity of finding a local maximum point.

Cites Work

• A proof-theoretic analysis of collection
• Induction rules, reflection principles, and provably recursive functions
• On n-quantifier induction