Reverse Mathematics and Completeness Theorems for Intuitionistic Logic

Notre Dame Journal of Formal Logic 42 (3):143-148 (2001)
  Copy   BIBTEX

Abstract

In this paper, we investigate the logical strength of completeness theorems for intuitionistic logic along the program of reverse mathematics. Among others we show that is equivalent over to the strong completeness theorem for intuitionistic logic: any countable theory of intuitionistic predicate logic can be characterized by a single Kripke model

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1063372197

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,829

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Reverse mathematics: the playground of logic.Richard A. Shore - 2010 - Bulletin of Symbolic Logic 16 (3):378-402.
Intuitionistic mathematics does not needex falso quodlibet.Neil Tennant - 1994 - Topoi 13 (2):127-133.
Undecidability and intuitionistic incompleteness.D. C. McCarty - 1996 - Journal of Philosophical Logic 25 (5):559 - 565.
Intuitionistic completeness for first order classical logic.Stefano Berardi - 1999 - Journal of Symbolic Logic 64 (1):304-312.
On Skolem and Herbrand theorems for intuitionistic logic.Herman Ruge Jervell - 1972 - Oslo,: Universitetet i Oslo, Matematisk institutt.
Validity and quantification in intuitionism.H. C. M. Swart & C. J. Posy - 1981 - Journal of Philosophical Logic 10 (1):117 - 126.
Negationless intuitionism.Enrico Martino - 1998 - Journal of Philosophical Logic 27 (2):165-177.
Comments on some completeness theorems of Urquhart and méndez & Salto.Kenneth Harris & Branden Fitelson - 2001 - Journal of Philosophical Logic 30 (1):51-55.
A new semantics for intuitionistic predicate logic.Yuichi Komori - 1986 - Studia Logica 45 (1):9 - 17.
A modal calculus analogous to k4w, based on intuitionistic propositional logic, iℴ.Aldo Ursini - 1979 - Studia Logica 38 (3):297 - 311.
Glivenko type theorems for intuitionistic modal logics.Guram Bezhanishvili - 2001 - Studia Logica 67 (1):89-109.
Open questions in reverse mathematics.Antonio Montalbán - 2011 - Bulletin of Symbolic Logic 17 (3):431-454.
A free IPC is a natural logic: Strong completeness for some intuitionistic free logics.Carl J. Posy - 1982 - Topoi 1 (1-2):30-43.

Analytics

Added to PP
2010-08-24

Downloads
54 (#295,373)

6 months
11 (#237,138)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Decidable Kripke models of intuitionistic theories.Hajime Ishihara, Bakhadyr Khoussainov & Anil Nerode - 1998 - Annals of Pure and Applied Logic 93 (1-3):115-123.

Add more references