Abstract
This chapter is a continuation of the preceding one, and we begin it at the place where the authors of Basic Modal Logic left us about fifteen years ago. Concluding his historical overview, Krister Segerberg wrote: “Where we stand today is difficult to say. Is the picture beginning to break up, or is it just the contemporary observer’s perennial problem of putting his own time into perspective?” So, where did modal logic of the 1970s stand? Where does it stand now? Modal logicians working in philosophy, computer science, artificial intelligence, linguistics or some other fields would probably give different answers to these questions. Our interpretation of the history of modal logic and view on its future is based upon understanding it as part of mathematical logic.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Bibliography
G. Amati and F. Pirri. A uniform tableau method for intuitionistic modal logics I. Studia Logica, 53:29–60, 1994.
J.G. Anderson. Superconstructive propositional calculi with extra axiom schemes containing one variable. Zeitschrift fir Mathematische Logik und Grundlagen der Mathematik, 18:113–130, 1972.
A. Avron. The method of hypersequents in the proof theory of propositional non-classical logics. In W. Hodges, M. Hyland, C. Steinhorn, and J. Truss, editors, Logic: from Foundations to Applications, pages 1–32. Clarendon Press, Oxford, 1996.
F. Baader and A. Laux. Terminological logics with modal operators. In Proceedings of the 14th International Joint Conference on Artificial Intelligence, pages 808–814, Montreal, Canada, 1995. Morgan Kaufman.
F. Baader and H.J. Ohlbach. A multi-dimensional terminological knowledge representation language. Journal of Applied Non-Classical Logic, 5:153–197, 1995.
J. Barwise and L. Moss. Vicious Circles. CSLI Publications, Stanford, 1996.
L.D. Beklemishev. On bimodal logics of provability. Annals of Pure and Applied Logic, 68:115–159, 1994.
L.D. Beklemishev. Bimodal logics for extensions of arithmetical theories. Journal of Symbolic Logic, 61:91–124, 1996.
F. Bellissima. Atoms in modal algebras. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 30:303–312, 1984.
F. Bellissima. An effective representation for finitely generated free interior algebras. Algebra Universalis, 20:302–317, 1985.
F. Bellissima. On the lattice of extensions of the modal logic K. Altn Archive of Mathematical Logic, 27:107–114, 1988.
F. Bellissima. Atoms of tense algebras. Algebra Universalis, 28:52–78, 1991.
N.D. Belnap. Display logic. Journal of Philosophical Logic, 11:375–417, 1982.
E.W. Beth. On Padua’s method in the theory of definitions. Indagationes Mathematicae, 15:330–339, 1953.
G. Bezhanishvili. Varieties of monadic algebras. Part I. Studia Logica, 61:367–402, 1998.
P. Blackburn. Nominal tense logic. Notre Dame Journal of Formal Logic, 34:56–83, 1993.
W.J. Blok and P. Köhler. Algebraic semantics for quasi-classical modal logics. Journal of Symbolic Logic, 48:941–964, 1983.
W. Blok and D. Pigozzi. On the structure of varieties with equationally definable principal congruences I. Algebra Universalis, 15:195–227, 1982.
W.J. Blok. Varieties of interior algebras. PhD thesis, University of Amsterdam, 1976.
W.J. Blok. On the degree of incompleteness in modal logics and the covering relation in the lattice of modal logics. Technical Report 78–07, Department of Mathematics, University of Amsterdam, 1978.
W.J. Blok. The lattice of modal algebras is not strongly atomic. Algebra Universalis, 11:285–294, 1980.
W.J. Blok. The lattice of modal logics: an algebraic investigation. Journal of Symbolic Logic, 45:221–236, 1980.
W.J. Blok. Pretabular varieties of modal algebras. Studio Logica, 39:101–124, 1980.
G. Boolos. The Logic of Provability. Cambridge University Press, 1993.
T. Borghuis. Interpreting modal natural deduction in type theory. In M. de Rijke, editor, Diamonds and Defaults, pages 67–102. Kluwer Academic Publishers, 1993.
M. Bosangue and M. Kwiatkowska. Re-interpreting the modal µ-calculus. In A. Ponse, M. de Rijke, and Y. Venema, editors, Modal Logic and Process Algebra, pages 65–83. CSLI publications, Stanford, 1996.
M. Božić and K. Došen. Models for normal intuitionistic logics. Studia Logica, 43:217–245, 1984.
R.J. Brachman and J.G. Schmolze. An overview of the KL-ONE knowledge representation system. Cognitive Science, 9:171–216, 1985.
J.R. Büchi and D. Siefkes. The monadic second order theory of all countable ordinals. Number 328 in Lecture Notes in Mathematics. Springer, 1973.
J.R. Büchi. On a decision method in restricted second order arithmetic. In Logic, Methodology and Philosophy of Science: Proceedings of the 1960 International Congress, pages 1–11. Stanford University Press, 1962.
R.A. Bull. MIPC as the formalization of an intuitionistic concept of modality. Journal of Symbolic Logic, 31:609–616, 1966.
R.A. Bull. That all normal extensions of S4.3 have the finite model property. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 12:341–344, 1966.
R.A. Bull. An algebraic study of tense logic with linear time. Journal of Symbolic Logic, 33:27–38, 1968.
C. Cerrato. Decidability by filtrations for graded normal logics. Studia Logica, 53:61–73, 1994.
A.V. Chagrov and L.A. Chagrova. Algorithmic problems concerning first order definability of modal formulas on the class of all finite frames. Studia Logica, 55:421–448, 1995.
A.V. Chagrov and M.V. Zakharyaschev. The disjunction property of intermediate propositional logics. Studia Logica, 50:63–75, 1991.
A.V. Chagrov and M.V. Zakharyaschev. Modal companions of intermediate propositional logics. Studia Logica, 51:49–82, 1992.
A.V. Chagrov and M.V. Zakharyaschev. The undecidability of the disjunction property of propositional logics and other related problems. Journal of Symbolic Logic, 58:49–82, 1993.
A.V. Chagrov and M.V. Zakharyaschev. On the independent axiomatizability of modal and intermediate logics. Journal of Logic and Computation, 5:287–302, 1995.
A.V. Chagrov and M.V. Zakharyaschev. Sahlqvist formulas are not so elementary even above S4. In L. Csirmaz, D.M. Gabbay, and M. de Rijke, editors, Logic Colloquium’92, pages 61–73. CSLI Publications, Stanford, 1995.
A.V. Chagrov and M.V. Zakharyaschev. Modal Logic. Oxford Logic Guides 35. Clarendon Press, Oxford, 1997.
A.V. Chagrov. On the polynomial approximability of modal and superintuitionistic logics. In Mathematical Logic, Mathematical Linguistics and Algorithm Theory, pages 75–83. Kalinin State University, Kalinin, 1983. (Russian) .
A.V. Chagrov. On the complexity of propositional logics. In Complexity Problems in Mathematical Logic, pages 80–90. Kalinin State University, Kalinin, 1985. (Russian).
A.V. Chagrov. Varieties of logical matrices. Algebra and Logic, 24:278–325, 1985.
A.V. Chagrov. Nontabularity—pretabularity, antitabularity, coantitabularity. In Algebraic and Logical Constructions, pages 105–111. Kalinin State University, Kalinin, 1989. (Russian).
A.V. Chagrov. Undecidability of the finitary semantical consequence. In Proceedings of the XXth USSR Conference on Mathematica Logic, Alma-Ata, page 162, 1990. (Russian) .
A.V. Chagrov. Undecidable properties of extensions of provability logic. I. Algebra and Logic, 29:231–243, 1990.
A.V. Chagrov. Undecidable properties of extensions of provability logic. II. Algebra and Logic, 29:406–413, 1990.
A.V. Chagrov. Continuality of the set of maximal superintuitionistic logics with the disjunction property. Mathematical Notes, 51:188–193, 1992.
A.V. Chagrov. A decidable modal logic with the undecidable admissibility problem for inference rules. Algebra and Logic, 31:53–55, 1992.
A.V. Chagrov. Undecidable properties of superintuitionistic logics. In S.V. Jablonskij, editor, Mathematical Problems of Cybernetics, volume 5, pages 67–108. Physmatlit, Moscow, 1994. (Russian) .
A.V. Chagrov. One more first-order effect in Kripke semantics. In Proceedings of the 10th International Congress of Logic, Methodology and Philosophy of Science, page 124, Florence, Italy, 1995.
A.V. Chagrov. Tabular modal logics: algorithmic problems. Manuscript, 1996.
L.A. Chagrova. On the first order definability of intuitionistic formulas with restrictions on occurrences of the connectives. In M.I. Kanovich, editor, Logical Methods for Constructing Effective Algorithms, pages 135–136. Kalinin State University, Kalinin, 1986. (Russian).
L.A. Chagrova. On the problem of definability of propositional formulas of intuitionistic logic by formulas of classical first order logic. PhD thesis, Kalinin State University, 1989. (Russian).
L.A. Chagrova. On the preservation of first order properties under the embedding of intermediate logics into modal logics. In Proceedings of the Xth USSR Conference for Mathematical Logic, page 163, 1990. (Russian) .
L.A. Chagrova. An undecidable problem in correspondence theory. Journal of Symbolic Logic, 56:1261–1272, 1991.
B. Chellas and K. Segerberg. Modal logics with the MacIntosh-rule. Journal of Philosophical Logic, 23:67–86, 1994.
B.F. Chellas. Modal Logic: An Introduction. Cambridge University Press, 1980.
W. Craig. On axiomatizability within a system. Journal of Symbolic Logic, 18:30–32, 1953.
W. Craig. Three uses of the Herbrandt-Gentzen theorem in relating model theory and proof theory. Journal of Symbolic Logic, 22:269–285, 1957.
M.J. Cresswell. An incomplete decidable modal logic. Journal of Symbolic Logic, 49:520–527, 1984.
A. Day. Splitting lattices generate all lattices. Algebra Universalis, 7:163–170, 1977.
M. de Rijke. Extending Modal Logic. PhD thesis, Universiteit van Amsterdam, 1993.
M. de Rijke. A Lindström theorem for modal logic. In A. Ponse, M. de Rijke, and Y. Venema, editors, Modal Logic and Process Algebra, pages 217–230. CSLI Publications, Stanford, 1996.
A. Diego. Sur les algèbres de Hilbert. Gauthier-Villars, Paris, 1966.
K. Doets. Completeness and definability. PhD thesis, Universiteit van Amsterdam, 1987.
F. Donini, M. Lenzerini, D. Nardi, and A. Schaerf. Reasoning in description logics. In G. Brewka, editor, Principles of Knowledge Representation, pages 191–236. CSLI Publications, 1996.
K. Došen. Models for stronger normal intuitionistic modal logics. Studia Logica, 44:39–70, 1985.
K. Došen. Sequent-systems for modal logic. Journal of Symbolic Logic, 50:149–159, 1985.
K. Došen. Duality between modal algebras and neighbourhood frames. Studia Logica, 48:219–234, 1988.
J. Drabbé. Une proprieté des matrices caractéristiques des systèmes S1, S2, et S3. Comptes Rendus de l’Académie des Sciences, Paris, 265:A1, 1967.
J. Dugundji. Note on a property of matrices for Lewis and Langford’s calculi of propositions. Journal of Symbolic Logic, 5:150–151, 1940.
M.A.E. Dummett and E.J. Lemmon. Modal logics between S4 and S5. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 5:250–264, 1959.
M.A.E. Dummett. A propositional calculus with denumerable matrix. Journal of Symbolic Logic, 24:97–106, 1959.
Yu.L. Ershov. Decision problems and constructivizable models. Nauka, Moscow, 1980. (Russian).
L.L. Esakia and V.Yu. Meskhi. Five critical systems. Theoria, 40:52–60, 1977.
L.L. Esakia. Topological Kripke models. Soviet Mathematics Doklady, 15:147–151, 1974.
L.L. Esakia. On varieties of Grzegorczyk algebras. In A. I. Mikhailov, editor, Studies in Non-classical Logics and Set Theory, pages 257–287. Moscow, Nauka, 1979. (Russian).
L.L. Esakia. To the theory of modal and superintuitionistic systems. In V.A. Smirnov, editor, Logical Inference. Proceedings of the USSR Symposium on the Theory of Logical Inference, pages 147–172. Nauka, Moscow, 1979. (Russian).
W.B. Ewald. Intuitionistic tense and modal logic. Journal of Symbolic Logic, 51:166–179, 1986.
R. Fagin, J. Halpern, Y. Moses, and M. Vardi. Reasoning about Knowledge. MIT Press, 1995.
M. Ferrari and P. Miglioli. Counting the maximal intermediate constructive logics. Journal of Symbolic Logic, 58:1365–1408, 1993.
M. Ferrari and P. Miglioli. A method to single out maximal propositional logics with the disjunction property. I. Annals of Pure and Applied Logic, 76:1–46, 1995.
M. Ferrari and P. Miglioli. A method to single out maximal propositional logics with the disjunction property. II. Annals of Pure and Applied Logic, 76:117–168, 1995.
K. Fine and G. Schurz. Transfer theorems for stratified modal logics. In J. Copeland, editor, Logic and Reality, Essays in Pure and Applied Logic. In memory of Arthur Prior, pages 169–213. Oxford University Press, 1996.
K. Fine. The logics containing S4.3. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 17:371–376, 1971.
Fine. K. Fine. In so many possible worlds. Notre Dame Journal of Formal Logic, 13:516–520, 1972.
K. Fine. An ascending chain of S4 logics. Theoria, 40:110–116, 1974.
K. Fine. An incomplete logic containing S4. Theoria, 40:23–29, 1974.
K. Fine. Logics containing K4, part I. Journal of Symbolic Logic, 39:229–237, 1974.
K. Fine. Normal forms in modal logic. Notre Dame Journal of Formal Logic, 16:31–42, 1975.
K. Fine. Some connections between elementary and modal logic. In S. Kanger, editor, Proceedings of the Third Scandinavian Logic Symposium, pages 15–31. North-Holland, Amsterdam, 1975.
K. Fine. Logics containing K4, part II. Journal of Symbolic Logic, 50:619–651, 1985.
M. Finger and M. Reynolds. Imperative history: two-dimensional executable temporal logic and Reynolds. In U. Reyle and H.J. Ohlbach, editors, Logic, Language and Reasoning: Essays in Honour of Dov Gabbay, pages 73–98. Kluwer Academic Publishers, 2000.
G. Fischer-Servi. On modal logics with an intuitionistic base. Studia Logica, 36:141–149 1977.
G. Fischer-Servi. Semantics for a class of intuitionistic modal calculi. In M. L. Dalla Chiara, editor, Italian Studies in the Philosophy of Science, pages 59–72. Reidel, Dordrecht, 1980.
G. Fischer-Servi. Axiomatizations for some intuitionistic modal logics. Rend. Sem. Mat. Univers. Polit., 42:179–194, 1984.
M. Fitting. Proof Methods for Modal and Intuitionistic Logics. Reidel, Dordrecht, 1983.
J. Font. Implication and deduction in some intuitionistic modal logics. Reports on Mathematical logic, 17:27–38, 1984.
J. Font. Modality and possibility in some intuitionistic modal logics. Notre Dame Journal of Formal Logic, 27:533–546, 1986.
H. Friedman. One hundred and two problems in mathematical logic. Journal of Symbolic Logic, 40:113–130, 1975.
A. Fuhrmann. Models for relevant modal logics. Studia Logica, 49:502–514, 1989.
D.M. Gabbay and D.H.J. de Jongh. A sequence of decidable finitely axiomatizable intermediate logics with the disjunction property. Journal of Symbolic Logic, 39:67–78, 1974.
D. Gabbay and V. Shehtman. Undecidability of modal and intermediate first-order logics with two individual variables. Journal of Symbolic Logic, 58:800–823, 1993.
D. Gabbay and V. Shehtman. Products of modal logics. Part I. Journal of the IGPL, 6:73–146, 1998.
D. Gabbay, I. Hodkinson, and M. Reynolds. Temporal Logic: Mathematical Foundations and Computational Aspects, Volume 1. Oxford University Press, 1994.
D.M. Gabbay. The decidability of the Kreisel—Putnam system. Journal of Symbolic Logic, 35:431–436, 1970.
D.M. Gabbay. On decidable, finitely axiomatizable modal and tense logics without the finite model property. I, II. Israel Journal of Mathematics, 10:478–495, 496–503, 1971.
D.M. Gabbay. Craig’s interpolation theorem for modal logics. In W. Hodges, editor, Proceedings of logic conference, London 1970, volume 255 of Lecture Notes in Mathematics, pages 111–127. Springer-Verlag, Berlin, 1972.
D.M. Gabbay. Decidability results in non-classical logics. Annals of Mathematical Logic, 8:237–295, 1975.
D.M. Gabbay. Investigations into Modal and Tense Logics, with Applications to Problems in Linguistics and Philosophy. Reidel, Dordrecht, 1976.
D.M. Gabbay. An irreflexivity lemma with application to axiomatizations of conditions on linear frames. In U. Mönnich, editor, Aspects of Philosophical Logic, pages 67–89. Reidel, Dordrecht, 1981.
D.M. Gabbay. Semantical Investigations in Heyting’s Intuitionistic Logic. Reidel, Dordrecht, 1981.
D.M. Gabbay. Fibring Logics. Oxford University Press, 1998.
G.I. Galanter. A continuum of intermediate logics which are maximal among the logics having the intuitionistic disjunctionless fragment. In Proceedings of 10th USSR Conference for Mathematical Logic, page 41, Alma—Ata, 1990. (Russian).
M.R. Garey and D.S. Johnson. Computers and intractability. A guide to the theory of NP-completeness. Freemann, San Franzisco, 1979.
G. Gargov and S. Passy. A note on Boolean modal logic. In P. Petkov, editor, Mathematical Logic, pages 299–309. Plenum Press, 1990.
G. Gargov, S. Passy, and T. Tinchev. Modal environment for Boolean speculations. In D. Skordev, editor, Mathematical Logic and its Applications, pages 253–263. Plenum Press, 1987.
G. Gentzen. Untersuchungen über das logische Schliessen. Mathematische Zeitschrift, 39:176–210, 405–431, 1934–35.
S. Ghilardi and G. Meloni. Constructive canonicity in nonclassical logics. Annals of Pure and Applied Logic, 86:1–32, 1997.
S. Ghilardi and M. Zawadowski. Undefinability of propositional quantifiers in modal system S4. Studia Logica, 55:259–271, 1995.
S. Ghilardi. An algebraic theory of normal forms. Annals of Pure and Applied Logic, 71:189–245, 1995.
S. Ghilardi. Best solving modal equations. Università degli Studi di Milano, Manuscript, 1999.
S. Ghilardi. Unification in intuitionistic logic. Journal of Symbolic Logic, 64:859–880, 1999.
K. Gödel. Zum intuitionistischen Aussagenkalkül. Anzeiger der Akademie der Wissenschaften in Wien, 69:65–66, 1932.
K. Gödel. Eine Interpretation des intuitionistischen Aussagenkalküls. Ergebnisse eines mathematischen Kolloquiums, 4:39–40, 1933.
R.I. Goldblatt and S.K. Thomason. Axiomatic classes in propositional modal logic. In J. Crossley, editor, Algebraic Logic, Lecture Notes in Mathematics vol. 450, pages 163–173. Springer, Berlin, 1974.
R.I. Goldblatt. Metamathematics of modal logic, Part I. Reports on Mathematical Logic, 6:41–78, 1976.
R.I. Goldblatt. Metamathematics of modal logic, Part II. Reports on Mathematical Logic, 7:21–52, 1976.
R.I. Goldblatt. Logics of Time and Computation. Number 7 in CSLI Lecture Notes, Stanford. CSLI, 1987.
R.I. Goldblatt. Varieties of complex algebras. Annals of Pure and Applied Logic, 38:173–241, 1989.
R.I. Goldblatt. Elementary generation and canonicity for varieties of boolean algebras with operators. Algebra Universalis, 34:551–607, 1995.
V. Goranko and G. Gargov. Modal logic with names. Journal of Philosophical Logic, 22:607–636, 1993.
V. Goranko and S. Passy. Using the universal modality: Gains and questions. Journal of Logic and Computation, 2:5–30, 1992. y
V. Goranko. Completeness and incompleteness in the bimodal base L(R, —R). In P. Petkov, editor, Mathematical Logic, pages 311–326. Plenum Press, 1990.
V. Goranko. Modal definability in enriched languages. Notre Dame Journal of Formal Logic, 31:81–105, 1990.
R. Gore. Cut-free sequent and tableau systems for propositional Diodorian modal logics. Studia Logica, 53:433–458, 1994.
C. Grefe. Modale Logiken funktionaler Frames. Master’s thesis Department of Mathematics, Freie Universität Berlin, 1994. p
C. Grefe. Fischer Servi’s intuitionistic modal logic has the finite model property. In M. Kracht, M. de Rijke, H. Wansing, and M. Zakharyaschev, editors, Advances in Modal Logic, pages 85–98. CSLI, Stanford, 1997.
J. Halpern and Yo. Moses. A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence, 54:319–379, 1992.
D. Harel. Recurring dominoes: Making the highly undecidable highly understandable. In Conference on Foundations of Computing Theory, volume 158 of Lecture Notes in Computer Science, pages 177–194. Springer, Berlin, 1983.
R. Harrop. On the existence of finite models and decision procedures for propositional calculi. Proceedings of the Cambridge Philosophical Society, 54:1–13, 1958.
E. Hemaspaandra. The price of universality. Notre Dame Journal of Formal Logic, 37:174–203, 1996.
R. Hirsch, I. Hodkinson, and A. Kurucz. On modal logics between K × K × K and S5 × S5 × S5. Submitted. Available at http://www.doc.ic.ac.uk/~kuag.
T. Hosoi and H. Ono. Intermediate propositional logics (A survey) . Journal of Tsuda College, 5:67–82, 1973.
T. Hosoi. On intermediate logics. Journal of the Faculty of Science, University of Tokyo, 14:293–312, 1967.
G.E. Hughes and M.J. Cresswell. A Companion to Modal Logic. Methuen, London, 1984.
I.L. Humberstone. Inaccessible worlds. Notre Dame Journal of Formal Logic, 24:346–352, 1983.
S. Isard. A finitely axiomatizable undecidable extension of K. Theoria, 43:195–202, 1977.
A. Janiczak. Undecidability of some simple formalized theories. Fundamenta Mathematicae, 40:131–139, 1953.
V.A. Jankov. The relationship between deducibility in the intuitionistic propositional calculus and finite implicational structures. Soviet Mathematics Doklady, 4:1203–1204, 1963.
V.A. Jankov. The calculus of the weak “law of excluded middle”. Mathematics of the USSR, Izvestiya, 2:997–1004, 1968.
V.A. Jankov. The construction of a sequence of strongly independent superintuitionistic propositional calculi. Soviet Mathematics Doklady, 9:806 807, 1968.
V.A. Jankov. Conjunctively indecomposable formulas in propositional Mathematics of the USSR, Izvestiya, 3:17–35, 1969.
S. Jaśkowski. Recherches sur le système de la logique intuitioniste. In Actes Du Congrès Intern. De Phil. Scientifique. VI. Phil. Des Mathématiques, Act. Sc. Et Ind 393, Paris, pages 58–61, 1936.
P. Jipsen and H. Rose. Varieties of Lattices. 1993.
J.S. Johnson. Nonfinitizability of classes of representable polyadic algebras. Journal of Symbolic Logic, 34:344–352, 1969.
B. Jónsson and A. Tarski. Boolean algebras with operators. I. American Journal of Mathematics, 73:891–939, 1951.
B. Jónsson. On the canonicity of Sahlqvist identities. Studia Logica, 53:473–491, 1994.
R. Kashima. Cut-free sequent calculi for some tense logics. Studia Logica, 53:119–136, 1994.
R.E. Kirk. A result on propositional logics having the disjunction property. Notre Dame Journal of Formal Logic, 23:71–74, 1982.
S. Kleene. On the interpretation of intuitionistic number theory. Journal of Symbolic Logic, 10:109–124, 1945.
Yu.G. Kleyman. Some questions in the theory of varieties of groups. Mathematics of the USSR, Izvestiya, 22:33–65, 1984.
S. Koppelberg. General theory of Boolean algebras. In J. Monk, editor, Handbook of Boolean Algebras, volume 1. North-Holland, Amsterdam, 1988.
D. Kozen. Results on the propositional μ-calculus. Theoretical Computer Science, 27:333–354, 1983.
D. Kozen. A finite model theorem for the propositional µ-calculus. Studia Logica, 47:234–241, 1988.
M. Kracht and F. Wolter. Properties of independently axiomatizable bimodal logics. Journal of Symbolic Logic, 56:1469–1485, 1991.
M. Kracht and F. Wolter. Simulation and transfer results in modal logic: A survey. Studia Logica, 59:229–259, 1997.
M. Kracht and F. Wolter. Normal monomodal logics can simulate all others. Journal of Symbolic Logic, 64:99–138, 1999.
M. Kracht. An almost general splitting theorem for modal logic. Studia Logica, 49:455–470, 1990.
M. Kracht. Even more about the lattice of tense logics. Archive of Mathematical Logic, 31:243–357, 1992.
M. Kracht. How completeness and correspondence theory got married. In M. de Rijke, editor, Diamonds and Defaults, pages 175–214. Kluwer Academic Publishers, 1993.
M. Kracht. Tools and Techniques in Modal Logic. Elsevier, North-Holland, 1999.
G. Kreisel and H. Putnam. Eine Unableitbarkeitsbeweismethode für den intuitionistischen Aussagenkalkül. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 3:74–78, 1957.
J. B. Kruskal. Well-quasi-ordering, the tree theorem and Vazsonyi’s conjecture. Transactions of the American Mathematical Society, 95:210–225, 1960.
A. Kurucz. On axiomatising products of Kripke frames. Journal of Symbolic Logic, 65:923–945, 2000.
A.V. Kuznetsov and V.Ya. Gerchiu. Superintuitionistic logics and the finite approximability. Soviet Mathematics Doklady, 11:1614–1619, 1970.
A.V. Kuznetsov. Undecidability of general problems of completeness, decidability and equivalence for propositional calculi. Algebra and Logic, 2:47–66, 1963. (Russian).
A.V. Kuznetsov. Some properties of the structure of varieties of pseudo-Boolean algebras. In Proceedings of the XIth USSR Algebraic Colloquium, pages 255–256, Kishinev, 1971. (Russian).
A.V. Kuznetsov. The decidability of certain superintuitionistic calculi. In Proceedings of the IInd USSR Conference on Mathematical Logic, Moscow, 1972. (Russian).
A.V. Kuznetsov. On superintuitionistic logics. In Proceedings of the International Congress of Mathematicians, pages 243–249, Vancouver, 1975.
A.V. Kuznetsov. Tools for detecting non-derivability or nonexpressibility. In V.A. Smirnov, editor, Logical Inference. Proceedings of the USSR Symposium on the Theory of Logical Inference, pages 5–23. Nauka, Moscow, 1979. (Russian).
A.V. Kuznetsov. Proof-intuitionistic propositional calculus. Doklady-Nauk SSSR, 283:27–30, 1985. (Russian).
R.E. Ladner. The computational complexity of provability in systems of modal logic. SIAM Journal on Computing, 6:467–480, 1977.
E.J. Lemmon and D.S. Scott. An Introduction to Modal Logic. Oxford, Blackwell, 1977.
E.J. Lemmon. Algebraic semantics for modal logic. I. Journal of Symbolic Logic, 31:46–65, 1966.
E.J. Lemmon. Algebraic semantics for modal logic. II. Journal of Symbolic Logic, 31:191–218, 1966.
E.J. Lemmon. A note on Halldén-incompleteness. Notre Dame Journal of Formal Logic, 7:296–300, 1966.
V.A. Levin. Some syntactic theorems on the calculus of finite problems of Yu.T. Medvedev. Soviet Mathematics Doklady, 10:288–290, 1969.
C.I. Lewis. A Survey of Symbolic Logic. University of California Press, Berkeley, 1918.
D. Lewis. Intensional logics without iterative axioms. Journal of Philosophical logic, 3:457–466, 1974.
P.D. Lincoln, J. Mitchell, A. Scedrov, and N. Shankar. Decision problems for propositional linear logic. Annals of Pure and Applied Logic, 56:239–311, 1992.
J. Lukasiewicz. On the intuitionistic theory of deduction. Indagationes Mathematicae, 14:202–212, 1952.
C. Luppi. On the interpolation property of some intuitionistic modal logics. Archive for Mathematical Logic, 35:173–189, 1996.
R. Maddux. The equational theory of CA3 is undecidable. Journal of Symbolic Logic, 45:311–315, 1980.
D.C. Makinson. Some embedding theorems for modal logic. Notre Dame Journal of Formal Logic, 12:252–254, 1971.
L.L. Maksimova and V.V. Rybakov. Lattices of modal logics. Algebra and Logic, 13:105–122, 1974.
L.L. Maksimova, V.B. Shehtman, and D.P. Skvortsov. The impossibility of a finite axiomatization of Medvedev’s logic of finitary problems. Soviet Mathematics Doklady, 20:394–398, 1979.
L.L. Maksimova. Pretabular superintuitionistic logics. Algebra and Logic, 11:308–314, 1972.
L.L. Maksimova. Modal logics of finite slices. Algebra and Logic, 14:188–197, 1975.
L.L. Maksimova. Pretabular extensions of Lewis S4. Algebra and Logic, 14:16–33, 1975.
L.L. Maksimova. Interpolation theorems in modal logic and amalgamable varieties of topological Boolean algebras. Algebra and Logic, 18:348–370, 1979.
L.L. Maksimova. Failure of the interpolation property in modal companions of Dummett’s logic. Algebra and Logic, 21:690–694, 1982.
L.L. Maksimova. Lyndon’s interpolation theorem in modal logics. In Mathematical Logic and Algorithm Theory, pages 45–55. Institute of Mathematics, Novosibirsk, 1982. (Russian).
L.L. Maksimova. On the number of maximal intermediate logics having the disjunction property. In Proceedings of the 7th USSR Conference for Mathematical Logic, page 95. Institute of Mathematics, Novosibirsk, 1984. (Russian).
L.L. Maksimova. On maximal intermediate logics with the disjunction property. Studia Logica, 45:69–75, 1986.
L.L. Maksimova. On the interpolation in normal modal logics. Nonclassical Logics, Studies in Mathematics, 98:40–56, 1987. (Russian).
L.L. Maksimova. A continuum of normal extensions of the modal provability logic with the interpolation property. Sibirskij Matematičeskij Žurnal, 30:122–131, 1989. (Russian).
L.L. Maksimova. Definability and interpolation in classical modal logics. Contemporary Mathematics, 131:583–599, 1992.
L.L. Maksimova. On variable separation in modal and superintuitionistic logics. Studia Logica, 55:99–112, 1995.
A.I. Mal’cev. Algorithms and Recursive Functions. Wolters-Noordhoff, Groningen, 1970.
A.I. Mal’cev. Algebraic Systems. Springer-Verlag, Berlin-Heidelberg, 1973.
S.I. Mardaev. The number of prelocally tabular superintuitionistic propositional logics. Algebra and Logic, 23:56–66, 1984.
M. Marx and C. Areces. Failure of interpolation in combined modal logics. Notre Dame Journal of Formal Logic, 39:253–273, 1998.
M. Marx and Y. Venema. Multi-dimensional modal logic. Kluwer Academic Publishers, 1997.
M. Marx. Algebraic relativization and arrow logic. PhD thesis, University of Amsterdam, 1995.
M. Marx. Complexity of products of modal logics. Journal of Logic and Computation, 9:197–214, 1999.
A. Masini. 2-sequent calculus: a proof theory of modality. Annals of Pure and Applied Logic, 58:229–246, 1992.
Y.V. Matiyasevich. Simple examples of undecidable associative calculi. Soviet Mathematics Doklady, 8:555–557, 1967.
C.G. McKay. The decidability of certain intermediate logics. Journal of Symbolic Logic, 33:258–264, 1968.
C.G. McKay. A class of decidable intermediate propositional logics. Journal of Symbolic Logic, 36:127–128, 1971.
R. McKenzie. Equational bases and non-modular lattice varieties. Transactions of the American Mathematical Society, 174:1–43, 1972.
J.C.C. McKinsey and A. Tarski. On closed elements in closure algebras. Annals of Mathematics, 47:122–162, 1946.
J.C.C. McKinsey and A. Tarski. Some theorems about the sentential calculi of Lewis and Heyting. Journal of Symbolic Logic, 13:1–15, 1948.
J.C.C. McKinsey. A solution of the decision problem for the Lewis systems S2 and S4, with an application to topology. Journal of Symbolic Logic, 6:117–134, 1941.
Yu.T. Medvedev. Finite problems. Soviet Mathematics Doklady, 3:227–230, 1962.
Yu.T. Medvedev. Interpretation of logical formulas by means of finite problems. Soviet Mathematics Doklady, 7:857–860, 1966.
J. Meyer and W. van der Hoek. Epistemic Logic for AI and Computer Science. Cambridge University Press, 1995.
S. Mikulas. Taming Logics. PhD thesis, University of Amsterdam, 1995.
P. Minari. Intermediate logics with the same disjunctionless fragment as intuitionistic logic. Studia Logica, 45:207–222, 1986.
F. Montagna. Provability in finite subtheories of PA and relative interpretability: a modal investigation. Journal of Symbolic Logic, 52:494–511, 1987.
O. Morikawa. Some modal logics based on three-valued logic. Notre Dame Journal of Formal Logic, 30:130–137, 1989.
A.Yu. Muravitskij. On finite approximability of the calculus IΔ and non-modelability of some of its extensions. Mathematical Notes, 29:907–916, 1981.
M.C. Nagle and S.K. Thomason. The extensions of the modal logic K5. Journal of Symbolic Logic, 50:102–108, 1985.
I. Nishimura. On formulas of one variable in intuitionistic propositional calculus. Journal of Symbolic Logic, 25:327–331, 1960.
H. Ono and A. Nakamura. On the size of refutation Kripke models for some linear modal and tense logics. Studia Logica, 39:325–333, 1980.
H. Ono and N. Suzuki. Relations between intuitionistic modal logics and intermediate predicate logics. Reports on Mathematical Logic, 22:65–87, 1988.
H. Ono. Some results on the intermediate logics. Publications of the Research Institute for Mathematical Science, Kyoto University, 8:117–130, 1972.
H. Ono. On some intuitionistic modal logics. Publications of the Research Institute for Mathematical Science, Kyoto University, 13:55–67, 1977.
I.E. Orlov. The calculus of compatibility of propositions. Mathematics of the USSR, Sbornik, 35:263–286, 1928. (Russian).
P. Ostermann. Many-valued modal propositional calculi. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik, 34:343–354, 1988.
D. Pigozzi. The join of equational theories. Colloquium Mathematicum, 30:15–25, 1974.
A.M. Pitts. On an interpretation of second order quantification in first order intuitionistic propositional logic. Journal of Symbolic Logic, 57:33–52, 1992.
A. Ponse, M. de Rijke, and Y. Venema. Modal Logic and Process Algebra. CSLI Publications, Stanford, 1996.
A. Prior. Time and Modality. Clarendon Press, Oxford, 1957.
M.O. Rabin. Decidability of second order theories and automata on infinite trees. Transactions of the American Mathematical Society, 141:1–35, 1969.
M.O. Rabin. Decidable theories. In J. Barwise, editor, Handbook of Mathematical Logic, pages 595–630. Elsevier, North-Holland, 1977.
H. Rasiowa and R. Sikorski. The Mathematics of Metamathematics. Polish Scientific Publishers, 1963.
W. Rautenberg. Der Verband der normalen verzweigten Modallogiken. Mathematische Zeitschrift, 156:123–140, 1977.
W. Rautenberg. Klassische und nichtklassische Aussagenlogik. Vieweg, Braunschweig-Wiesbaden, 1979.
W. Rautenberg. Splitting lattices of logics. Archiv für Mathematische Logik, 20:155–159, 1980.
W. Rautenberg. Modal tableau calculi and interpolation. Journal of Philosophical Logic, 12:403–423, 1983.
J. Reif and A. Sistla. A multiprocess network logic with temporal and spatial modalities. Journal of Computer and System Sciences, 30:41–53, 1985.
M. Reynolds and M. Zakharyaschev. On the products of linear modal logics. Journal of Logic and Computation, 2000. (To appear.)
L. Rieger. On the lattice of Brouwerian propositional logics. Acta Universitatis Carolinae. Mathematica et Physica, 189, 1949.
R. Robinson. Undecidability and nonperiodicity for tilings of the plane. Inventiones Math., 12:177–209, 1971.
P.H. Rodenburg. Intuitionistic correspondence theory. PhD thesis, University of Amsterdam, 1986.
G.F. Rose. Propositional calculus and realizability. Transactions of the American Mathematical Society, 75:1–19, 1953.
V.V. Rybakov. Noncompact extensions of the logic S4. Algebra and Logic, 16:321–334, 1977.
V.V. Rybakov. Modal logics with LM-axioms. Algebra and Logic, 17:302–310, 1978.
V.V. Rybakov. Admissible rules for logics containing S4.3. Siberian Mathematical Journal, 25:795–798, 1984.
V.V. Rybakov. A criterion for admissibility of rules in the modal system S4 and intuitionistic logic. Algebra and Logic, 23:369–384, 1984.
V.V. Rybakov. The decidability of admissibility of inference rules in the modal system Grz and intuitionistic logic. Mathematics of the USSR, Izvestiya, 28:589–608, 1987.
V.V. Rybakov. Admissibility of inference rules in the modal system G. Mathematical Logic and Algorithmical Problems, Mathematical Institute, Novosibirsk, 12:120–138, 1989. (Russian).
V.V. Rybakov. Rules of inference with parameters for intuitionistic logic. Journal of Symbolic Logic, 58:1803–1834, 1993.
V.V. Rybakov. Criteria for admissibility of inference rules. Modal and intermediate logics with the branching property. Studia Logica, 53:203–226, 1994.
V.V. Rybakov. Hereditarily structurally complete modal logics. Journal of Symbolic Logic, 60:266–288, 1995.
H. Sahlqvist. Completeness and correspondence in the first and second order semantics for modal logic. In S. Kanger, editor, Proceedings of the Third Scandinavian Logic Symposium, pages 110–143. North-Holland, Amsterdam, 1975.
G. Sambin and V. Vaccaro. A topological proof of Sahlqvist’s theorem. Journal of Symbolic Logic, 54:992–999, 1989.
K. Sasaki. The disjunction property of the logics with axioms of only one variable. Bulletin of the Section of Logic, 21:40–46, 1992.
K. Schild. A correspondence theory for terminological logics: preliminary report. In Proc. of the 12th Int. Joint Conf. on Artificial Intelligence (IJCAI-91), pages 466–471, Sydney, 1991.
S.J. Scroggs. Extensions of the Lewis system S5. Journal of Symbolic Logic, 16:112–120, 1951.
K. Segerberg. Some modal logics based on three valued logic. Theoria, 33:53–71, 1967.
K. Segerberg. Modal logics with linear alternative relations. Theoria, 36:301–322, 1970.
K. Segerberg. An essay in classical modal logic. Philosophical Studies, Uppsala, 13, 1971.
K. Segerberg. Two-dimensional modal logic. Journal of Philosophical Logic, 2:77–96, 1973.
K. Segerberg. That all extensions of S4.3 are normal. In S. Kanger, editor, Proceedings of the Third Scandinavian Logic Symposium, pages 194–196. NorthHolland, Amsterdam, 1975.
K. Segerberg. Modal logics with functional alternative relations. Notre Dame Journal of Formal Logic, 27:504–522, 1986.
K. Segerberg. Von Wright’s tense logic. In P. Schilpp and L. Hahn, editors, The Philosophy of Georg Henrik von Wright, pages 603–635. La Salle, IL: Open Court, 1989.
V.Yu. Shavrukov. On two extensions of the provability logic GL. Mathematics of the USSR, Sbornik, 69:255–270, 1991.
V. Yu. Shavrukov. Subalgebras of diagonalizable algebras of theories containing arithmetic. Dissertationes Mathematicae (Rozprawy Matematyczne, Polska Akademia Nauk, Instytut Matematyczny), Warszawa, 323, 1993.
V.B. Shehtman. On incomplete propositional logics. Soviet Mathematics Doklady, 18:985–989, 1977.
V.B. Shehtman. Rieger—Nishimura lattices. Soviet Mathematics Doklady, 19:1014–1018, 1978.
V.B. Shehtman. Two-dimensional modal logics. Mathematical Notices of the USSR Academy of Sciences, 23:417–424, 1978. (Translated from Russian).
V.B. Shehtman. An undecidable superintuitionistic propositional calculus. Soviet Mathematics Doklady, 19:656–660, 1978.
V.B. Shehtman. Kripke type semantics for propositional modal logics with the intuitionistic base. In V.A. Smirnov, editor, Modal and Tense Logics, pages 108–112. Institute of Philosophy, USSR Academy of Sciences, 1979. (Russian).
V.B. Shehtman. Topological models of propositional logics. Semiotics and Information Science, 15:74–98, 1980. (Russian).
V.B. Shehtman. Undecidable propositional calculi. In Problems of Cybernetics. Nonclassical logics and their application, volume 75, pages 74–116. USSR Academy of Sciences, 1982. (Russian).
T. Shimura. Kripke completeness of some intermediate predicate logics with the axiom of constant domain and a variant of canonical formulas. Studia Logica, 52:23–40, 1993.
T. Shimura. On completeness of intermediate predicate logics with respect to Kripke semantics. Bulletin of the Section of Logic, 24:41–45, 1995.
A.A. Shum. Relative varieties of algebraic systems, and propositional calculi. Soviet Mathematics Doklady, 31:492–495, 1985.
A.K. Simpson. The proof theory and semantics of intuitionistic modal logic. PhD thesis, University of Edinburgh, 1994.
C. Smoryński. Investigations of Intuitionistic Formal Systems by means of Kripke Frames. PhD thesis, University of Illinois, 1973.
C. Smoryński. Beth’s theorem and self-referential sentences. In Logic Colloquium 77, pages 253–261. North-Holland, Amsterdam, 1978.
C. Smoryński. Self-reference and Modal Logic. Springer Verlag, Heidelberg & New York, 1985.
S.K. Sobolev. On finite-dimensional superintuitionistic logics. Mathematics of the USSR, Izvestiya, 11:909–935, 1977.
S.K. Sobolev. On the finite approximability of superintuitionistic logics. Mathematics of the USSR, Sbornik, 31:257–268, 1977.
R. Solovay. Provability interpretations of modal logic. Israel Journal of Mathematics, 25:287–304, 1976.
V.H. Sotirov. Modal theories with intuitionistic logic. In Proceedings of the Conference on Mathematical Logic, Sofia, 1980, pages 139–171. Bulgarian Academy of Sciences, 1984.
E. Spaan. Complexity of Modal Logics. PhD thesis, Department of Mathematics and Computer Science, University of Amsterdam, 1993.
R. Statman. Intuitionistic propositional logic is polynomial-space complete. Theoretical Computer Science, 9:67–72, 1979.
T. Surendonk. Canonicity of intensional logics without iterative axioms. Journal of Philosophical Logic, 1996. To appear.
N. Suzuki. An algebraic approach to intuitionistic modal logics in connection with intermediate predicate logics. Studia Logica, 48:141–155, 1990.
A. Tarski. Contributions to the theory of models I, II. Indagationes Mathematicae, 16:572–588 1954.
S. K. Thomason. Noncompactness in propositional modal logic. Journal of Symbolic Logic, 37:716–720, 1972.
S. K. Thomason. An incompleteness theorem in modal logic. Theoria, 40:30–34, 1974.
S. K. Thomason. Reduction of tense logic to modal logic I. Journal of Symbolic Logic, 39:549–551, 1974.
S. K. Thomason. The logical consequence relation of propositional tense logic. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, 21:29–40, 1975.
S. K. Thomason. Reduction of second-order logic to modal logic. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, 21:107–114, 1975.
S. K. Thomason. Reduction of tense logic to modal logic II. Theoria, 41:154–169, 1975.
S. K. Thomason. Independent propositional modal logics. Studia Logica, 39:143–144, 1980.
S. K. Thomason. Undecidability of the completeness problem of modal logic. In Universal Algebra and Applications, Banach Center Publications, volume 9, pages 341–345, Warsaw, 1982. PNW—Polish Scientific Publishers.
G.S. Tseitin. Associative calculus with unsolvable equivalence problem. Proceedings of the Mathematical Steklov Institute of the USSR Academy of Sciences, 52:172–189, 1958. Translation: American Mathematical Society. Translations. Series 2. 94:73–92.
A.I. Tsytkin. On structurally complete superintuitionistic logics. Soviet Mathematics Doklady, 19:816–819, 1978.
A.I. Tsytkin. Structurally complete superintuitionistic logics and primitive varieties of pseudo-Boolean algebras. Mathematical Studies, 98:134–151, 1987. (Russian).
T. Umezawa. Über die Zwischensysteme der Aussagenlogik. Nagoya Mathematical Journal, 9:181–189, 1955.
T. Umezawa. On intermediate propositional logics. Journal of Symbolic Logic, 24:20–36, 1959.
A. Urquhart. Implicational formulas in intuitionistic logic. Journal of Symbolic Logic, 39:661–664 1974.
A. Urquhart. The undecidability of entailment and relevant implication. Journal of Symobolic Logic, 49:1059–1073, 1984.
D. Vakarelov. Intuitionistic modal logics incompatible with the law of excluded middle. Studia Logica, 40:103–111, 1981.
D. Vakarelov. An application of the Rieger—Nishimura formulas to the intuitionistic modal logics. Studia Logica, 44:79–85, 1985.
J.A.F.K. van Benthem and W.J. Blok. Transitivity follows from Dummett’s axiom. Theoria, 44:117–118, 1978.
J.A.F.K. van Benthem and I.L. Humberstone. Halldén-completeness by gluing Kripke frames. Notre Dame Journal of Formal Logic, 24:426–430, 1983.
J.A.F.K. van Benthem. Modal reduction principles. Journal of Symbolic Logic, 41:301–312, 1976.
J.A.F.K. van Benthem. Syntactic aspects of modal incompleteness theorems. Theoria, 45:63–77, 1979.
J.A.F.K. van Benthem. Some kinds of modal completeness. Studia Logica, 39:125–141, 1980.
J.A.F.K. van Benthem. Modal Logic and Classical Logic. Bibliopolis, Napoli, 1983.
J.A.F.K. van Benthem. The Logic of Time. A Model-Theoretic Investigation into the Varieties of Temporal Ontology and Temporal Discourse. Kluwer Academic Publishers, 1991.
W. van der Hoek. Modalities for Reasoning about Knowledge and Quantities. PhD thesis, University of Amsterdam, 1992.
Y. Venema. Many-Dimensional Modal Logics. PhD thesis, Universiteit van Amsterdam, 1991.
A. Visser. A course in bimodal provability logic. Annals of Pure and Applied Logic, 73:115–142, 1995.
A. Visser. Uniform interpolation and layered bisimulation. In P. Hayek, editor, Gödel 96, pages 139–164. Springer Verlag, 1996.
I. Walukiewicz. A Complete Deduction system for the μ-calculus. PhD thesis, Warsaw, 1993.
I. Walukiewicz. A note on the completeness of Kozen’s axiomatization of the propositional μ-calculus. Bulletin of Symbolic Logic, 2:349–366, 1996.
X. Wang. The McKinsey axiom is not compact. Journal of Symbolic Logic, 57:1230–1238, 1992.
H. Wansing. Sequent calculi for normal modal propositional logics. Journal of Logic and Computation, 4:125–142, 1994.
H. Wansing. Proof Theory of Modal Logic. Kluwer Academic Publishers, 1996.
P. Whitman. Splittings of a lattice. American Journal of Mathematics, 65:179 196, 1943.
D. Wijesekera. Constructive modal logic I. Annals of Pure and Applied Logic, 50:271–301, 1990.
T. Williamson. Non-genuine MacIntosh logics. Journal of Philosophical Logic, 23:87–101, 1994.
F. Wolter and M. Zakharyaschev. On the relation between intuitionistic and classical modal logics. Algebra and Logic, 36:121–155, 1997.
F. Wolter and M. Zakharyaschev. Satisfiability problem in description logics with modal operators. In Proceedings of the sixth Conference on Principles of Knowledge Representation and Reasoning, KR’98, Trento, Italy, pages 512–523, 1998. Morgan Kaufman.
F. Wolter and M. Zakharyaschev. Intuitionistic modal logics as fragments of classical bimodal logics. In E. Orlowska, editor, Logic at Work, pages 168–186. Springer—Verlag, 1999.
F. Wolter and M. Zakharyaschev. Modal description logics: modalizing roles. Fundamenta Informaticae, 30:411–438, 1999.
F. Wolter and M. Zakharyaschev. Multi-dimensional description logics. In Proceedings of the 16th International Joint Conference on Artificial Intelligence, IJCAI’99, Stockholm, pages 104–109, 1999. Morgan Kaufman.
F. Wolter and M. Zakharyaschev. Spatio-temporal representation and reasoning based on RCC-8. In Proceedings of the seventh Conference on Principles of Knowledge Representation and Reasoning, KR2000, Breckenridge, USA, pages 1–12, 2000. Morgan Kaufman.
F. Wolter. Lattices of Modal Logics. PhD thesis, Freie Universität Berlin, 1993.
F. Wolter. Parts of the thesis appeared in Annals of Pure and Applied Logic, 86:47–100, 1997, under the title “The structure of lattices of subframe logics”.
F. Wolter. Solution to a problem of Goranko and Passy. Journal of Logic and Computation, 4:21–22, 1994.
F. Wolter. What is the upper part of the lattice of bimodal logics? Studia Logica, 53:235–242, 1994.
F. Wolter. The finite model property in tense logic. Journal of Symbolic Logic, 60:757–774, 1995.
F. Wolter. A counterexample in tense logic. Notre Dame Journal of Formal Logic, 37:167–173, 1996.
F. Wolter. Properties of tense logics. Mathematical Logic Quarterly, 42:481–500, 1996.
F. Wolter. Tense logics without tense operators. Mathematical Logic Quarterly, 42:145–171, 1996.
F. Wolter. Completeness and decidability of tense logics closely related to logics containing K4. Journal of Symbolic Logic, 62:131–158, 1997.
F. Wolter. Fusions of modal logics revisited. In M. Kracht, M. de Rijke, H. Wansing, and M. Zakharyaschev, editors, Advances in Modal Logic. CSLI, Stanford, 1997.
F. Wolter. A note on atoms in polymodal algebras. Algebra Universalis, 37:334–341, 1997.
F. Wolter. A note on the interpolation property in tense logic. Journal of Philosophical Logic, 26:545–551, 1997.
F. Wolter. Superintuitionistic companions of classical modal logics. Studia Logica, 58:229–259, 1997.
F. Wolter. All finitely axiomatizable subframe logics containing CSM are decidable. Archive for Mathematical Logic, 37:167–182, 1998.
F. Wolter. The product of converse PDL and polymodal K. Journal of Logic and Computation, 10:223–251, 2000.
A. Wroński. Intermediate logics and the disjunction property. Reports on Mathematical Logic, 1:39–51, 1973.
A. Wroński. Remarks on intermediate logics with axioms containing only one variable. Reports on Mathematical Logic, 2:63–75, 1974.
A. Wroński. Sufficient condition of decidability for intermediate propositional logics. In ASL Logic Colloquium, Berlin’89, 1989.
M. Zakharyaschev and A. Alekseev. All finitely axiomatizable normal extensions of K4.3 are decidable. Mathematical Logic Quarterly, 41:15–23, 1995.
M.V. Zakharyaschev and S.V. Popov. On the complexity of Kripke countermodels in intuitionistic propositional calculus. In Proceedings of the 2nd Soviet-Finland Logic Colloquium, pages 32–36, 1979. (Russian).
M.V. Zakharyaschev. On intermediate logics. Soviet Mathematics Doklady, 27:274–277, 1983.
M.V. Zakharyaschev. Normal modal logics containing S4. Soviet Mathematics Doklady, 28:252–255, 1984.
M.V. Zakharyaschev. On the disjunction property of superintuitionistic and modal logics. Mathematical Notes, 42:901–905, 1987.
M.V. Zakharyaschev. Syntax and semantics of modal logics containing S4. Algebra and Logic, 27:408–428, 1988.
M.V. Zakharyaschev. Syntax and semantics of intermediate logics. Algebra and Logic, 28:262–282, 1989.
M.V. Zakharyaschev. Modal companions of superintuitionistic logics: syntax, semantics and preservation theorems. Mathematics of the USSR, Sbornik, 68:277–289, 1991.
M.V. Zakharyaschev. Canonical formulas for K4. Part I: Basic results. Journal of Symbolic Logic, 57:1377–1402, 1992.
M.V. Zakharyaschev. A new solution to a problem of Hosoi and Ono. Notre Dame Journal of Formal Logic, 35:450–457, 1994.
M.V. Zakharyaschev. Canonical formulas for K4. Part II: Cofinal subframe logics. Journal of Symbolic Logic, 61:421–449, 1996.
M.V. Zakharyaschev. Canonical formulas for K4. Part III: The finite model property. Journal of Symbolic Logic, 62:950–975, 1997.
M.V. Zakharyaschev. Canonical formulas for modal and superintuitionistic logics: a short outline. In M. de Rijke, editor, Advances in Intensional Logic, pages 191–243. Kluwer Academic Publishers, 1997.
M.V. Zakharyaschev. The greatest extension of S4 into which intuitionistic logic is embeddable. Studia Logica, 59:345–358, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Zakharyaschev, M., Wolter, F., Chagrov, A. (2001). Advanced Modal Logic. In: Gabbay, D.M., Guenthner, F. (eds) Handbook of Philosophical Logic. Handbook of Philosophical Logic, vol 3. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-0454-0_2
Download citation
DOI: https://doi.org/10.1007/978-94-017-0454-0_2
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5765-5
Online ISBN: 978-94-017-0454-0
eBook Packages: Springer Book Archive