Semantical Completeness of First-Order Predicate Logic and the Weak Fan Theorem

Studia Logica 103 (3):623-638 (2015)
  Copy   BIBTEX

Abstract

Within a weak system \ of intuitionistic analysis one may prove, using the Weak Fan Theorem as an additional axiom, a completeness theorem for intuitionistic first-order predicate logic relative to validity in generalized Beth models as well as a completeness theorem for classical first-order predicate logic relative to validity in intuitionistic structures. Conversely, each of these theorems implies over \ the Weak Fan Theorem

Categories

Keywords

Reprint years

DOI

10.1007/s11225-014-9582-z

Links

PhilArchive



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

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

Undecidability and intuitionistic incompleteness.D. C. McCarty - 1996 - Journal of Philosophical Logic 25 (5):559 - 565.
Completeness and incompleteness for intuitionistic logic.Charles Mccarty - 2008 - Journal of Symbolic Logic 73 (4):1315-1327.
Reverse Mathematics and Completeness Theorems for Intuitionistic Logic.Takeshi Yamazaki - 2001 - Notre Dame Journal of Formal Logic 42 (3):143-148.
Basic Predicate Calculus.Wim Ruitenburg - 1998 - Notre Dame Journal of Formal Logic 39 (1):18-46.
On Gabbay's Proof of the Craig Interpolation Theorem for Intuitionistic Predicate Logic.Michael Makkai - 1995 - Notre Dame Journal of Formal Logic 36 (3):364-381.
A new semantics for intuitionistic predicate logic.Yuichi Komori - 1986 - Studia Logica 45 (1):9 - 17.
Kripke semantics, undecidability and standard completeness for Esteva and Godo's logic MTL∀.Franco Montagna & Hiroakira Ono - 2002 - Studia Logica 71 (2):227-245.
Two applications of Boolean models.Thierry Coquand - 1998 - Archive for Mathematical Logic 37 (3):143-147.
A weak completeness theorem for infinite valued first-order logic.L. P. Belluce & C. C. Chang - 1963 - Journal of Symbolic Logic 28 (1):43-50.
The Jordan curve theorem and the Schönflies theorem in weak second-order arithmetic.Nobuyuki Sakamoto & Keita Yokoyama - 2007 - Archive for Mathematical Logic 46 (5-6):465-480.
Arithmetical interpretations and Kripke frames of predicate modal logic of provability.Taishi Kurahashi - 2013 - Review of Symbolic Logic 6 (1):1-18.
A semantical proof of De Jongh's theorem.Jaap van Oosten - 1991 - Archive for Mathematical Logic 31 (2):105-114.

Analytics

Added to PP
2014-09-21

Downloads
17 (#849,202)

6 months
5 (#638,139)

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

Formal systems for some branches of intuitionistic analysis.G. Kreisel - 1970 - Annals of Mathematical Logic 1 (3):229.
Equivalents of the (weak) fan theorem.Iris Loeb - 2005 - Annals of Pure and Applied Logic 132 (1):51-66.
Another intuitionistic completeness proof.H. De Swart - 1976 - Journal of Symbolic Logic 41 (3):644-662.
Another Intuitionistic Completeness Proof.H. De Swart - 1976 - Journal of Symbolic Logic 41 (3):644 - 662.

View all 6 references / Add more references