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)
  Copy   BIBTEX

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.

Links

PhilArchive



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

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
53 (#294,453)

6 months
7 (#411,886)

Historical graph of downloads
How can I increase my downloads?