Decidable Kripke models of intuitionistic theories

, &
Annals of Pure and Applied Logic 93 (1-3):115-123 (1998)
  Copy   BIBTEX

Abstract

In this paper we introduce effectiveness into model theory of intuitionistic logic. The main result shows that any computable theory T of intuitionistic predicate logic has a Kripke model with decidable forcing such that for any sentence φ, φ is forced in the model if and only if φ is intuitionistically deducible from T

Categories

Keywords

Reprint years

DOI

10.1016/s0168-0072(97)00057-2

Links

PhilArchive



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

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

Submodels of Kripke models.Albert Visser - 2001 - Archive for Mathematical Logic 40 (4):277-295.
Homomorphisms and chains of Kripke models.Morteza Moniri & Mostafa Zaare - 2011 - Archive for Mathematical Logic 50 (3-4):431-443.
Classical and Intuitionistic Models of Arithmetic.Kai F. Wehmeier - 1996 - Notre Dame Journal of Formal Logic 37 (3):452-461.
Partial isomorphisms and intuitionistic logic.Bernd I. Dahn - 1981 - Studia Logica 40 (4):405 - 413.
Syntactic Preservation Theorems for Intuitionistic Predicate Logic.Jonathan Fleischmann - 2010 - Notre Dame Journal of Formal Logic 51 (2):225-245.
Intuitionistic Completeness and Classical Logic.D. C. McCarty - 2002 - Notre Dame Journal of Formal Logic 43 (4):243-248.
Models for stronger normal intuitionistic modal logics.Kosta Došen - 1985 - Studia Logica 44 (1):39 - 70.
Degree Spectra of Prime Models.Barbara F. Csima - 2004 - Journal of Symbolic Logic 69 (2):430 - 442.
Models of intuitionistic TT and N.Daniel Dzierzgowski - 1995 - Journal of Symbolic Logic 60 (2):640-653.
Glueing of analysis models in an intuitionistic setting.D. Dalen - 1986 - Studia Logica 45 (2):181 - 186.
Intuitionistic Epistemic Logic, Kripke Models and Fitch’s Paradox.Carlo Proietti - 2012 - Journal of Philosophical Logic 41 (5):877-900.
Intuitionistic completeness for first order classical logic.Stefano Berardi - 1999 - Journal of Symbolic Logic 64 (1):304-312.
Decidability in Intuitionistic Type Theory is Functionally Decidable.Silvio Valentini - 1996 - Mathematical Logic Quarterly 42 (1):300-304.
Quantifier Elimination for a Class of Intuitionistic Theories.Ben Ellison, Jonathan Fleischmann, Dan McGinn & Wim Ruitenburg - 2008 - Notre Dame Journal of Formal Logic 49 (3):281-293.

Analytics

Added to PP
2014-01-16

Downloads
31 (#513,686)

6 months
8 (#353,767)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Effective completeness theorems for modal logic.Suman Ganguli & Anil Nerode - 2004 - Annals of Pure and Applied Logic 128 (1-3):141-195.
Reverse Mathematics and Completeness Theorems for Intuitionistic Logic.Takeshi Yamazaki - 2001 - Notre Dame Journal of Formal Logic 42 (3):143-148.
First-Order Logic in the Medvedev Lattice.Rutger Kuyper - 2015 - Studia Logica 103 (6):1185-1224.

Add more citations

References found in this work

No references found.

Add more references