Skip to main content Accessibility help
×
Home

Canonical formulas for K4. Part I: Basic results

  • Michael Zakharyaschev (a1)

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.

Copyright

References

Hide All
Bull, R. and Segerberg, K. [1984], Basic modal logic, Handbook of philosophical logic (Gabbay, D. and Guenthner, F., editors), vol. II, Reidel, Dordrecht, pp. 188.
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.
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. 135136. (Russian)
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. 96100. (Russian).
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. 250264.
Fine, K. [1974], An ascending chain of S4 logics, Theoria, vol. 40, pp. 110116.
Fine, K. [1985], Logics containing K4. Part II, this Journal, vol. 50, pp. 619651.
Kracht, M. [1990], Internal definability and completeness in modal logic, Dissertation, Freie Universität Berlin, Berlin.
Kracht, M. [1990a], An almost general splitting theorem for modal logic, Studia Logica, vol. 49, pp. 567583.
Kreisel, G. and Putnam, H. [1957], Eine unableitbarkeitsbeweismethode für den intuitionistischen Aussagenkalkül, Archiv für Mathematische Logik und Grundlagenforschung, vol. 3, pp. 7478.
Mckay, C. G. [1968], The decidability of certain intermediate logics, this Journal, vol. 33, pp. 258264.
Rautenberg, W. [1979], Klassische und nichtklassische Aussagenlogik, F. Vieweg & Sohn, Braunschweig.
Rodenburg, P. H. [1986], Intuitionistic correspondence theory, Dissertation, University of Amsterdam, Amsterdam.
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.
Shavrukov, V. Ju. [1990], On two extensions of the provability logic GL, Matematicheskiĭ Sbornik, vol. 181, pp. 240255; English translation, Mathematics of the USSR Sbornik, vol. 69 (1991), pp. 255–270.
Yankov, V. A. [1963], The relationship between deducibility in the intuitionistic propositional calculus and finite implicational structures, Doklady Akademii Nauk SSSR, vol. 151, pp. 12931294; English translation, Soviet Mathematics Doklady, vol. 4, pp. 1203–1204.
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.
Zakharyaschev, M. V. [1983], On intermediate logics, Doklady Akademii Nauk SSSR, vol. 269, pp. 1822; English translation, Soviet Mathematics Doklady, vol. 27, pp. 274–277.
Zakharyaschev, M. V. [1984], Normal modal logics containing S4, Doklady Akademii Nauk SSSR, vol. 275, pp. 537540; English translation, Soviet Mathematics Doklady, vol. 29, pp. 252–255.
Zakharyaschev, M. V. [1984a], Syntax and semantics of intermediate and modal logics, Dissertation, Keldysh Institute of Applied Mathematics, USSR Academy of Sciences, Moscow. (Russian)
Zakharyaschev, M. V. [1987], On the disjunction property of intermediate and modal logics, Matematicheskie Zametki, vol. 42, pp. 729738; English translation, Mathematical Notes, vol. 42, pp. 901–905.
Zakharyaschev, M. V. [1988], Syntax and semantics of modal logics containing S4, Algebra i Logika, vol. 27, pp. 659689; English translation, Algebra and Logic, vol. 27, pp. 408–428.
Zakharyaschev, M. V. [1989], Syntax and semantics of intermediate logics, Algebra i Logika, vol. 28, pp. 402429; English translation, Algebra and Logic, vol. 28, pp. 262–282.
Zakharyaschev, M. V. [1989a], Modal companions of superintuitionistic logics: syntax, semantics, and preservation theorems, Matematicheskiĭ Sbornik, vol. 180, pp. 14151427; English translation, Mathematics of the USSR Sbornik, vol. 68 (1991), pp. 277–289.
Zakharyaschev, M. V. [1990], The greatest extension of S4 in which intuitionistic logic is embeddable, Manuscript, 1990.

Related content

Powered by UNSILO

Canonical formulas for K4. Part I: Basic results

  • Michael Zakharyaschev (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.