On the induction schema for decidable predicates

DOI10.2178/JSL/1045861504zbMATH Open1041.03042OpenAlexW2079353347MaRDI QIDQ4457724FDOQ4457724

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)

Cites Work

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

Cited In (10)

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

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)