Hostname: page-component-8448b6f56d-42gr6 Total loading time: 0 Render date: 2024-04-16T17:18:46.927Z Has data issue: false hasContentIssue false
  • English
  • Français

Canonical formulas for K4. Part I: Basic results

Published online by Cambridge University Press:  12 March 2014

Michael Zakharyaschev
Michael Zakharyaschev*
Affiliation:
Keldysh Institute of Applied Mathematics, Russian Academy of Sciences, Miusskaya SQ. 4, 125047 Moscow, Russia
Get access Rights & Permissions [Opens in a new window]

Extract

This paper presents a new technique for handling modal logics with transitive frames, i.e. extensions of the modal system K4. In effect, the technique is based on the following fundamental result, to be obtained below in §3.

Given a formula φ, we can effectively construct finite frames 1, …, n which completely characterize the set of all transitive general frames refuting φ. More exactly, an arbitrary general frame refutes φ iff contains a (not necessarily generated) subframe such that (1) i, for some i ϵ {1, …, n}, is a p-morphic image of (after Fine [1985] we say is subreducible to i), (2) is cofinal in , and (3) every point in that is not in does not get into “closed domains” which are uniquely determined in i, by φ.

This purely technical result has, as it turns out, rather unexpected and profound consequences. For instance, it follows at once that if φ determines no closed domains in the frames 1, …, n associated with it, then the normal extension of K4 generated by φ has the finite model property and so is decidable. Moreover, every normal logic axiomatizable by any (even infinite) set of such formulas φ also has the finite model property. This observation would not possibly merit any special attention, were it not for the fact that the class of such logics contains almost all the standard systems within the field of K4 (at least all those mentioned by Segerberg [1971] or Bull and Segerberg [1984]), all logics containing S4.3, all subframe logics of Fine [1985], and a continuum of other logics as well.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 57 , Issue 4 , December 1992 , pp. 1377 - 1402
Copyright
Copyright © Association for Symbolic Logic 1992

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

Bull, R. and Segerberg, K. [1984], Basic modal logic, Handbook of philosophical logic (Gabbay, D. and Guenthner, F., editors), vol. II, Reidel, Dordrecht, pp. 1–88.Google Scholar
Chagrov, A. V. and Zakharyaschev, M. V. [1991], Undecidability of the disjunction property of intermediate propositional logies, ITLI Prepublication Series, X-91-02, University of Amsterdam, Amsterdam, 1991.Google Scholar
Chagrova, L. A. [1986], On the first-order definability of intuitionistic formulas with restrictions on occurrences of the connectives, Logical methods for constructing effective algorithms (Kanovich, M. I., editor), Kalinin State University, Kalinin, pp. 135–136. (Russian)Google Scholar
Chagrova, L. A.[1987], An algorithm for constructing the first-order frame equivalent for disjunctionless intuitionistic formulas, Logical-algebraic constructions (Gorchakov, Yu. M., editor), Kalinin State University, Kalinin, pp. 96–100. (Russian).Google Scholar
Dummett, M. A. E. and Lemmon, E. J. [1959], Modal logics between S4 and S5, Zeitschrift für Mathematische Logik and Grundlagen der Mathematik, vol. 5, pp. 250–264.CrossRefGoogle Scholar
Fine, K. [1974], An ascending chain of S4 logics, Theoria, vol. 40, pp. 110–116.CrossRefGoogle Scholar
Fine, K. [1985], Logics containing K4. Part II, this Journal, vol. 50, pp. 619–651.Google Scholar
Kracht, M. [1990], Internal definability and completeness in modal logic, Dissertation, Freie Universität Berlin, Berlin.Google Scholar
Kracht, M. [1990a], An almost general splitting theorem for modal logic, Studia Logica, vol. 49, pp. 567–583.CrossRefGoogle Scholar
Kreisel, G. and Putnam, H. [1957], Eine unableitbarkeitsbeweismethode für den intuitionistischen Aussagenkalkül, Archiv für Mathematische Logik und Grundlagenforschung, vol. 3, pp. 74–78.CrossRefGoogle Scholar
Mckay, C. G. [1968], The decidability of certain intermediate logics, this Journal, vol. 33, pp. 258–264.Google Scholar
Rautenberg, W. [1979], Klassische und nichtklassische Aussagenlogik, F. Vieweg & Sohn, Braunschweig.CrossRefGoogle Scholar
Rodenburg, P. H. [1986], Intuitionistic correspondence theory, Dissertation, University of Amsterdam, Amsterdam.Google Scholar
Segerberg, K. [1971], An essay in classical modal logic, Vols. 1, 2, 3, Philosophical Studies, vol. 13, Filosofiska Förening och Filosofiska Institutionen vid Uppsala Universitet, Uppsala.Google Scholar
Shavrukov, V. Ju. [1990], On two extensions of the provability logic GL, Matematicheskiĭ Sbornik, vol. 181, pp. 240–255; English translation, Mathematics of the USSR Sbornik, vol. 69 (1991), pp. 255–270.Google Scholar
Yankov, V. A. [1963], The relationship between deducibility in the intuitionistic propositional calculus and finite implicational structures, Doklady Akademii Nauk SSSR, vol. 151, pp. 1293–1294; English translation, Soviet Mathematics Doklady, vol. 4, pp. 1203–1204.Google Scholar
Zakharyaschev, M. V. [1981], Certain classes of intermediate logics, Preprint No. 160, Keldysh Institute of Applied Mathematics, USSR Academy of Sciences, Moscow. (Russian) MR83j:03047.Google Scholar
Zakharyaschev, M. V. [1983], On intermediate logics, Doklady Akademii Nauk SSSR, vol. 269, pp. 18–22; English translation, Soviet Mathematics Doklady, vol. 27, pp. 274–277.Google Scholar
Zakharyaschev, M. V. [1984], Normal modal logics containing S4, Doklady Akademii Nauk SSSR, vol. 275, pp. 537–540; English translation, Soviet Mathematics Doklady, vol. 29, pp. 252–255.Google Scholar
Zakharyaschev, M. V. [1984a], Syntax and semantics of intermediate and modal logics, Dissertation, Keldysh Institute of Applied Mathematics, USSR Academy of Sciences, Moscow. (Russian)Google Scholar
Zakharyaschev, M. V. [1987], On the disjunction property of intermediate and modal logics, Matematicheskie Zametki, vol. 42, pp. 729–738; English translation, Mathematical Notes, vol. 42, pp. 901–905.Google Scholar
Zakharyaschev, M. V. [1988], Syntax and semantics of modal logics containing S4, Algebra i Logika, vol. 27, pp. 659–689; English translation, Algebra and Logic, vol. 27, pp. 408–428.Google Scholar
Zakharyaschev, M. V. [1989], Syntax and semantics of intermediate logics, Algebra i Logika, vol. 28, pp. 402–429; English translation, Algebra and Logic, vol. 28, pp. 262–282.Google Scholar
Zakharyaschev, M. V. [1989a], Modal companions of superintuitionistic logics: syntax, semantics, and preservation theorems, Matematicheskiĭ Sbornik, vol. 180, pp. 1415–1427; English translation, Mathematics of the USSR Sbornik, vol. 68 (1991), pp. 277–289.Google Scholar
Zakharyaschev, M. V. [1990], The greatest extension of S4 in which intuitionistic logic is embeddable, Manuscript, 1990.Google Scholar