Kripke completeness of some intermediate predicate logics with the axiom of constant domain and a variant of canonical formulas

Studia Logica 52 (1):23 - 40 (1993)

Abstract

For each intermediate propositional logicJ, J * denotes the least predicate extension ofJ. By the method of canonical models, the strongly Kripke completeness ofJ *+D(=x(p(x)q)xp(x)q) is shown in some cases including:1. J is tabular, 2. J is a subframe logic. A variant of Zakharyashchev's canonical formulas for intermediate logics is introduced to prove the second case.

Download options

PhilArchive



    Upload a copy of this work     Papers currently archived: 72,856

External links

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

Through your library

Analytics

Added to PP
2009-01-28

Downloads
42 (#274,373)

6 months
1 (#386,040)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Logics Containing K4. Part II.Kit Fine - 1985 - Journal of Symbolic Logic 50 (3):619-651.
The Decidability of Certain Intermediate Propositional Logics.C. G. Mckay - 1968 - Journal of Symbolic Logic 33 (2):258-264.
An Extension of Ono's Completeness Result.Nobu-Yuki Suzuki - 1990 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 36 (4):365-366.

View all 6 references / Add more references