Abstract
Let S be a deductive system such that S-derivability (⊢s) is arithmetic and sound with respect to structures of class K. From simple conditions on K and ⊢s, it follows constructively that the K-completeness of ⊢s implies MP(S), a form of Markov's Principle. If ⊢s is undecidable then MP(S) is independent of first-order Heyting arithmetic. Also, if ⊢s is undecidable and the S proof relation is decidable, then MP(S) is independent of second-order Heyting arithmetic, HAS. Lastly, when ⊢s is many-one complete, MP(S) implies the usual Markov's Principle MP.
An immediate corollary is that the Tarski, Beth and Kripke weak completeness theorems for the negative fragment of intuitionistic predicate logic are unobtainable in HAS. Second, each of these: weak completeness for classical predicate logic, weak completeness for the negative fragment of intuitionistic predicate logic and strong completeness for sentential logic implics MP. Beth and Kripke completeness for intuitionistic predicate or sentential logic also entail MP.
These results give extensions of the theorem of Gödel and Kreisel (in [4]) that completeness for pure intuitionistic predicate logic requires MP. The assumptions of Gödel and Kreisel's original proof included the Axiom of Dependent Choice and Herbrand's Theorem, no use of which is explicit in the present article.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Beeson, M.J.: Foundations of Constructive Mathematics, Metamathematical Studies, Springer-Verlag, New York, 1985, xxiii + 466.
Cutland, N.: Computability, Cambridge University Press, New York, 1980, x + 251.
Gödel, K.: ‘On intuitionistic arithmetic and number theory,’ pp. 286–295 in Collected Works, Volume I, Publications 1929–1936, edited by S. Feferman et al., Oxford University Press, New York, 1986.
Kreisel, G.: ‘On weak completeness of intuitionistic predicate logic,’ The Journal of Symbolic Logic, vol. 27 (1962), pp. 139–158.
McCarty, D.C.: ‘On theorems of Gödel and Kreisel: completeness and Markov's Principle,’ Notre Dame Journal of Formal Logic, vol. 35 (1994), pp. 99–107.
Rogers, H.: Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967, xiv + 482.
Smorynski, C.: ‘Application of Kripke models,’ pp. 324–391 in Metamathematical Investigation of Intuitionistic Arithmetic and Analysis, edited by A.S. Troelstra, Springer-Verlag, New York, 1973.
Troelstra, A.S.: Metamathematical Investigation of Intuitionistic Arithmetic and Analysis, Springer-Verlag, New York, 1973, xvii + 485.
Troelstra, A.S. and D.van Dalen: Constructivism in Mathematics, An Introduction, Volume I, North-Holland, New York, 1988, xx + 342 + XIV.
Troelstra, A.S. and D.van Dalen: Constructivism in Mathematics, An Introduction, Volume II, North-Holland, New York, 1988, xvii + 345-879 + LII.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
McCarty, D.C. Undecidability and intuitionistic incompleteness. J Philos Logic 25, 559–565 (1996). https://doi.org/10.1007/BF00257386
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00257386