Notre Dame Journal of Formal Logic 39 (2):212-220 (1998)

Abstract
In "Intuitionistic validity in -normal Kripke structures," Buss asked whether every intuitionistic theory is, for some classical theory , that of all -normal Kripke structures for which he gave an r.e. axiomatization. In the language of arithmetic and denote PA plus Open Induction or Open LNP, and are their intuitionistic deductive closures. We show is recursively axiomatizable and , while . If proves PEM but not totality of a classically provably total Diophantine function of , then and so . A result due to Wehmeier then implies . We prove is not -conservative over . If , then is not closed under MR or Friedman's translation, so range (). Both and are closed under the negative translation
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1305/ndjfl/1039293063
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 72,577
Through your library

References found in this work BETA

Fragments of $HA$ Based on $\sigma_1$ -Induction.Kai F. Wehmeier - 1997 - Archive for Mathematical Logic 37 (1):37-49.
Intuitionistic Validity in T-Normal Kripke Structures.Samuel R. Buss - 1993 - Annals of Pure and Applied Logic 59 (3):159-173.
Finite Kripke Models of HA Are Locally PA.E. C. W. Krabbe - 1986 - Notre Dame Journal of Formal Logic 27:528-532.
On the Structure of Kripke Models of Heyting Arithmetic.Zoran Marković - 1993 - Mathematical Logic Quarterly 39 (1):531-538.

Add more references

Citations of this work BETA

Weak Arithmetics and Kripke Models.Morteza Moniri - 2002 - Mathematical Logic Quarterly 48 (1):157-160.

Add more citations

Similar books and articles

On the Induction Schema for Decidable Predicates.Lev D. Beklemishev - 2003 - Journal of Symbolic Logic 68 (1):17-34.
Is the Intuitionistic Bar-Induction a Constructive Principle?Klaus Mainzer - 1977 - Notre Dame Journal of Formal Logic 18 (4):583-588.
Counter-Induction.John L. Pollock - 1962 - Inquiry: An Interdisciplinary Journal of Philosophy 5 (1-4):284 – 294.
A Note on Finiteness in the Predicative Foundations of Arithmetic.Fernando Ferreira - 1999 - Journal of Philosophical Logic 28 (2):165-174.

Analytics

Added to PP index
2010-08-24

Total views
19 ( #587,487 of 2,533,597 )

Recent downloads (6 months)
1 ( #389,998 of 2,533,597 )

How can I increase my downloads?

Downloads

My notes