Completeness theorems for some intermediate predicate calculi

Studia Logica 42 (4):431 - 441 (1983)
  Copy   BIBTEX

Abstract

We give completeness results — with respect to Kripke's semantic — for the negation-free intermediate predicate calculi.

Categories

Keywords

Reprint years

DOI

10.1007/bf01371631

Links

PhilArchive



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

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

Not every "tabular" predicate logic is finitely axiomatizable.Dmitrij Skvortsov - 1997 - Studia Logica 59 (3):387-396.
Kripke completeness of some intermediate predicate logics with the axiom of constant domain and a variant of canonical formulas.Tatsuya Shimura - 1993 - Studia Logica 52 (1):23 - 40.
Undecidability and intuitionistic incompleteness.D. C. McCarty - 1996 - Journal of Philosophical Logic 25 (5):559 - 565.
On maximal intermediate predicate constructive logics.Alessandro Avellone, Camillo Fiorentini, Paolo Mantovani & Pierangelo Miglioli - 1996 - Studia Logica 57 (2-3):373 - 408.
Cut-free tableau calculi for some intuitionistic modal logics.Mauro Ferrari - 1997 - Studia Logica 59 (3):303-330.
Some completeness results for modal predicate calculi.Richmond H. Thomason - 1970 - In Karel Lambert (ed.), Philosophical Problems in Logic: Some Recent Developments. D. Reidel. pp. 56--76.
On some Kripke complete and Kripke incomplete intermediate predicate logics.Dmitrij Skvortsov - 1998 - Studia Logica 61 (2):281-292.

Analytics

Added to PP
2009-01-28

Downloads
34 (#470,159)

6 months
6 (#520,798)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Pierluigi Minari
Università degli Studi di Firenze

Citations of this work

Ordered sets R and Q as bases of Kripke models.Mitio Takano - 1987 - Studia Logica 46 (2):137 - 148.

Add more citations

References found in this work

Logic with truth values in a linearly ordered Heyting algebra.Alfred Horn - 1969 - Journal of Symbolic Logic 34 (3):395-408.
A logic stronger than intuitionism.Sabine Görnemann - 1971 - Journal of Symbolic Logic 36 (2):249-261.

Add more references