Interpolation theorems for intuitionistic predicate logic

Annals of Pure and Applied Logic 113 (1-3):225-242 (2001)
  Copy   BIBTEX

Abstract

Craig interpolation theorem implies that the derivability of X,X′ Y′ implies existence of an interpolant I in the common language of X and X′ Y′ such that both X I and I,X′ Y′ are derivable. For classical logic this extends to X,X′ Y,Y′, but for intuitionistic logic there are counterexamples. We present a version true for intuitionistic propositional logic, and more complicated version for the predicate case

Links

PhilArchive



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

External links

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

Through your library

Similar books and articles

Reverse Mathematics and Completeness Theorems for Intuitionistic Logic.Takeshi Yamazaki - 2001 - Notre Dame Journal of Formal Logic 42 (3):143-148.
On Skolem and Herbrand theorems for intuitionistic logic.Herman Ruge Jervell - 1972 - Oslo,: Universitetet i Oslo, Matematisk institutt.
Basic Predicate Calculus.Wim Ruitenburg - 1998 - Notre Dame Journal of Formal Logic 39 (1):18-46.
A short introduction to intuitionistic logic.G. E. Mint︠s︡ - 2000 - New York: Kluwer Academic / Plenum Publishers.
Syntactic Preservation Theorems for Intuitionistic Predicate Logic.Jonathan Fleischmann - 2010 - Notre Dame Journal of Formal Logic 51 (2):225-245.
Undecidability and intuitionistic incompleteness.D. C. McCarty - 1996 - Journal of Philosophical Logic 25 (5):559 - 565.
Interpolation and the Interpretability Logic of PA.Evan Goris - 2006 - Notre Dame Journal of Formal Logic 47 (2):179-195.

Analytics

Added to PP
2014-01-16

Downloads
29 (#521,313)

6 months
5 (#544,079)

Historical graph of downloads
How can I increase my downloads?