Skip to main content
Log in

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

  • Published:
Studia Logica Aims and scope Submit manuscript

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. 1.

    J is tabular,

  2. 2.

    J is a subframe logic.

A variant of Zakharyashchev's canonical formulas for intermediate logics is introduced to prove the second case.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. K. Fine,Logics containing K4 part II Journal of Symbolic Logic 50 (1985), pp. 619–651.

    Google Scholar 

  2. D. M. Gabbay andD. H. de Jongh,Sequences of decidable and finitely axiomatizable intermediate logics with the disjunction property,Journal of Symbolic Logic 39 (1974), pp. 67–79.

    Google Scholar 

  3. T. Hosoi,Non-separable intermediate logics,Journal of Tsuda College 8 (1976), pp. 13–18.

    Google Scholar 

  4. V. A. Jankov,Conjunctively indecomposable formulas in propositional calculi,Izvestiya Akademii Nauk SSSR 33 (1969), pp. 13–38. (English translation)Mathematics of USSR, Izvestiya 3 (1969), pp. 17 –35.

    Google Scholar 

  5. C. G. McKay,The decidability of certain intermediate logics,Journal of Symbolic Logic 33 (1968), pp. 258–264.

    Google Scholar 

  6. H. Ono,Model extension theorem and Craig's interpolation theorem for intermediate predicate logics,Reports on Mathematical Logic 15 (1983), pp. 41–58.

    Google Scholar 

  7. H. Ono,some problems on intermediate predicate logics,Reports on Mathematical Logic 21 (1987), pp. 55–67.

    Google Scholar 

  8. V. B. Shehtman,On incomplete propositional logics,Doklady Akademii Nauk SSSR 235 (1977), pp. 542–545. (English translation)Soviet Mathematics, Doklady 18 (1977), 985 – 989.

    Google Scholar 

  9. N.-Y. Suzuki,An extension of Ono's completeness result,Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 36 (1990), pp. 365–366.

    Google Scholar 

  10. M. V. Zakharyashchev,Syntax and semantics of superintuitionistic logics,Algebra i Logika 28 (1989), pp. 402–429. (English translation)Algebra and Logics 28 (1989), pp. 262 – 282.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This research was partially supported by Grant-in-Aid for Scientific Research (No. 01302006), Ministry of Education, Science and Culture.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shimura, T. Kripke completeness of some intermediate predicate logics with the axiom of constant domain and a variant of canonical formulas. Stud Logica 52, 23–40 (1993). https://doi.org/10.1007/BF01053062

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01053062

Keywords

Navigation