On the induction schema for decidable predicates
type: Item
instance of: scholarly article
title: On the induction schema for decidable predicates
zbMATH Open document ID: 1041.03042
published in: Journal of Symbolic Logic
publication date: 2004-03-25T00:00:00Z
full work available at URL: https://dspace.library.uu.nl/handle/1874/26979
Mathematics Subject Classification ID: 03F30
Mathematics Subject Classification ID: 03D20
zbMATH DE Number: 2061944
zbMATH Keywords: fragment of Peano arithmetic
zbMATH Keywords: induction principle
zbMATH Keywords: decidable predicates
zbMATH Keywords: oracle computable functions
zbMATH Keywords: least element principle
author: Lev D. Beklemishev
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2079353347
cites work: Induction rules, reflection principles, and provably recursive functions
cites work: On n-quantifier induction
cites work: A proof-theoretic analysis of collection
DOI: 10.2178/JSL/1045861504
Recommended article: On axiom schemes for \(T\)-provably \(\Delta_1\) formulas
Recommended article: On the quantifier complexity of \(\Delta_{n+1}(T)\)-induction
Recommended article: Local induction and provably total computable functions
Recommended article: Induction, minimization and collection for \(\Delta_{n+1}(T)\)-formulas
Recommended article: Q3140638
description: scientific article; zbMATH DE number 2061944