On the induction schema for decidable predicates

DOI10.2178/JSL/1045861504MaRDI QIDQ4457724zbMATH OpenOpenAlexFDO

Authors 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

decidable predicatesfragment of Peano arithmeticinduction principleleast element principleoracle computable functions

Mathematics Subject Classification ID

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

Recommendations

• On axiom schemes for \(T\)-provably \(\Delta_1\) formulas
• On the quantifier complexity of \(\Delta_{n+1}(T)\)-induction
• Local induction and provably total computable functions
• Induction, minimization and collection for \(\Delta_{n+1}(T)\)-formulas
• scientific article; zbMATH DE number 440481

Cites work

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

Cited in

(10)

• On the query complexity of finding a local maximum point.
• Provability algebras and proof-theoretic ordinals. I
• On axiom schemes for \(T\)-provably \(\Delta_1\) formulas
• 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10
• Deciding the Inductive Validity of ∀ ∃ * Queries
• scientific article; zbMATH DE number 3931004 (Why is no real title available?)
• On parameter free induction schemas
• Fragments of Arithmetic and true sentences
• Honest elementary degrees and degrees of relative provability without the cupping property
• Semi-honest subrecursive degrees and the collection rule in arithmetic

This page was built for publication: On the induction schema for decidable predicates

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