Translator Disclaimer
March 2003 On the induction schema for decidable predicates
Lev D. Beklemishev
J. Symbolic Logic 68(1): 17-34 (March 2003). DOI: 10.2178/jsl/1045861504

Abstract

We study the fragment of Peano arithmetic formalizing the induction principle for the class of decidable predicates, $I\Delta1$. We show that $I\Delta1$ is independent from the set of all true arithmetical $\Pi2$-sentences. Moreover, we establish the connections between this theory and some classes of oracle computable functions with restrictions on the allowed number of queries. We also obtain some conservation and independence results for parameter free and inference rule forms of $\Delta1$-induction.

An open problem formulated by J. Paris (see \cite{CloKra,HP}) is whether $I\Delta1$ proves the corresponding least element principle for decidable predicates, $L\Delta1$ (or, equivalently, the $\Sigma1$-collection principle $B\Sigma1$). We reduce this question to a purely computation-theoretic one.

Citation

Download Citation

Lev D. Beklemishev. "On the induction schema for decidable predicates." J. Symbolic Logic 68 (1) 17 - 34, March 2003. https://doi.org/10.2178/jsl/1045861504

Information

Published: March 2003
First available in Project Euclid: 21 February 2003

zbMATH: 1041.03042
MathSciNet: MR1959310
Digital Object Identifier: 10.2178/jsl/1045861504

Rights: Copyright © 2003 Association for Symbolic Logic

JOURNAL ARTICLE
18 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.68 • No. 1 • March 2003
Back to Top