Mathematical modal logic: A view of its evolution

Journal of Applied Logic

Volumn 1, Issue 5-6, 2003, Pages 309-392

  Goldblatt, Robert ^a  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

Author keywords

Boolean algebra; History of logic; Kripke semantics; Modal logic

Indexed keywords

BOOLEAN ALGEBRA; COMPUTER SCIENCE; COMPUTER SIMULATION; FUNCTIONS; MATHEMATICAL OPERATORS; SEMANTICS;

HISTORY OF LOGIC; KRIPKE MODELS; KRIPKE SEMANTICS; MODEL LOGIC;

MATHEMATICAL MODELS;

EID: 2942697713     PISSN: 15708683     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1570-8683(03)00008-9     Document Type: Article

References (279)

1. P. Aczel, Non-Well-Founded Sets, in: CSLI Lecture Notes, Vol. 14, CSLI Publications, Stanford University, 1988.
2. P. Aczel, The Russell-Prawitz modality, Math. Struct. Comput. Sci. 11 (4) (2001) 541-554.
3. M. Astroh, J.W. Klüwer, Bibliography: Hugh MacColl, Nordic J. Philos. Logic 3 (1) (1998). Electronically available at: http://www.hf.uio.no/filosofi/njpl/vo13no1/index.html.
4. J. Barwise, The Situation in Logic, in: CSLI Lecture Notes, Vol. 17, CSLI Publications, Stanford University, 1989.
5. A. Bayart, Correction de la logique modale du premier et du second ordre S5, Logique et Anal. 1(1) (1958) 28-45.
6. A. Bayart, Quasi-adéquation de la logique modal du second ordre S5 et adéquation de la logique modal du premier ordre S5, Logique et Anal. 2 (6-7) (1959) 99-121.
7. 0. Becker, Zur logik der modalitäten, Jahrb. Philos. Phänomenol. Forschung 11 (1930) 497-548.
8. J.L. Bell, Toposes and Local Set Theories, Oxford University Press, Oxford, 1988.
9. M. Ben-Ari, A. Pnueli, Z. Manna, The temporal logic of branching time, Acta Inform. 20 (1983) 207-226.
10. P.N. Benton, G.M. Bierman, V.C.V. de Paiva, Computational types from a logical perspective, J. Funct. Programming 8 (1998) 177-193.
11. J.A. Bergstra, A. Ponse, S.A. Smolka, Handbook of Process Algebra, Elsevier, Amsterdam, 2001.
12. E.W. Beth, Semantic entailment and formal derivability, Mededelingen van de Koninklijke Nederlandse Akademie van Wetenschappen, Afdeling Letterkunde, N.R. 18 (1955) 309-342. Reprinted in: J. Hintikka (Ed.), The Philosophy of Mathematics, Oxford University Press, Oxford, 1969.
13. G. Birkhoff, On the combination of subalgebras, Proc. Cambridge Philos. Soc. 29 (1933) 441-464.
14. G. Birkhoff, On the structure of abstract algebras, Proc. Cambridge Philos. Soc. 31 (1935) 433-454.
15. G. Birkhoff, Subdirect unions in universal algebra, Bull. Amer. Math. Soc. 50 (1944) 764-768.
16. G. Birkhoff, Lattice Theory, 2nd Edition, American Mathematical Society, Providence, RI, 1948.
17. W.J. Blok, On the degree of incompleteness of modal logics, Bull. Sect. Logic Polish Acad. Sci. 7 (4) (1978) 167-175.
18. W.J. Blok, On the degree of incompleteness of modal logics and the covering relation in the lattice of modal logics, Report 78-07, Department of Mathematics, University of Amsterdam, 1978.
19. W.J. Blok, The lattice of modal logics: an algebraic investigation, J. Symbolic Logic 45 (1980) 221-236.
20. I.M. Bochenski, A History of Formal Logic, University of Notre Dame Press, 1961.
21. G. Boole, An Investigation of the Laws of Thought, Walton and Maberley, 1854. Reprinted by Dover Publications, 1958.
22. G. Boolos, The Unprovability of Consistency, University Press, Cambridge, 1979.
23. G. Boolos, The Logic of Provability, Cambridge University Press, Cambridge, 1993.
24. G. Boolos, G. Sambin, An incomplete system of modal logic, J. Philos. Logic 14 (1985) 351-358.
25. G. Boolos, G. Sambin, Provability: the emergence of a mathematical modality, Studia Logica 50 (1991) 1-23.
26. J. Bradfield, C. Stirling, Modal logics and mu-calculi: An introduction, in: J.A. Bergstra, A. Ponse, S.A. Smolka (Eds.), Handbook of Process Algebra, Elsevier, Amsterdam, 2001, pp. 293-330.
27. R.A. Bull, A note on the modal calculi S4.2 and S4.3, Z. Math. Logik Grundlag. Math. 10 (1964) 53-55.
28. R.A. Bull, An algebraic study of Diodorean modal systems, J. Symbolic Logic 30 (1965) 58-64.
29. R.A. Bull, That all normal extensions of S4.3 have the finite model property, Z. Math. Logik Grundlag. Math. 12 (1966) 341-344.
30. R.A. Bull, An algebraic study of tense logics with linear time, J. Symbolic Logic 33 (1968) 27-38.
31. R.A. Bull, Note on a paper in tense logic, J. Symbolic Logic 34 (1969) 215-218.
32. R. Carnap, Modalities and quantification, J. Symbolic Logic 11 (1946) 33-64.
33. R. Carnap, Meaning and Necessity, University of Chicago Press, Chicago, 1947. Enlarged Edition 1956.
34. A. Chagrov, M. Zakharyaschev, Modal Logic, Oxford University Press, Oxford, 1997.
35. C.C. Chang, H.J. Keisler, Model Theory, North-Holland, Amsterdam, 1973.
36. E.M. Clarke, E.A. Emerson, Design and synthesis of synchronisation skeletons using branching time temporal logic, in: D. Kozen (Ed.), Logics of Programs, in: Lecture Notes in Computer Science, Vol. 131, Springer, Berlin, 1981, pp. 52-71.
37. S.A. Cook, The complexity of theorem proving procedures, in: Proceedings of the Third Annual ACM Symposium on the Theory of Computing, 1971, pp. 151-158.
38. B.J. Copeland (Ed.), Logic and Reality: Essays on the Legacy of Arthur Prior, Oxford University Press, Oxford, 1996.
39. B.J. Copeland, Priors life and legacy, in: B.J. Copeland (Ed.), Logic and Reality: Essays on the Legacy of Arthur Prior, Oxford University Press, Oxford, 1996, pp. 1-40.
40. M.J. Cresswell, A Henkin completeness theorem for T, Notre Dame J. Formal Logic 8 (1967) 186-190.
41. M.J. Cresswell, The completeness of S 1 and some related systems, Notre Dame J. Formal Logic 13 (1972) 485-496.
42. M.J. Cresswell, Logics and Languages, Methuen, 1973.
43. M.J. Cresswell, An incomplete decidable modal logic, J. Symbolic Logic 49 (1984) 520-527.
44. M.J. Cresswell, S1 is not so simple, in: W. Sinnott-Armstrong, D. Raffman, N. Asher (Eds.), Modality, Morality and Belief. Essays in Honor of Ruth Barcan Marcus, Cambridge University Press, Cambridge, 1995, pp. 29-40.
45. H.B. Curry, A Theory of Formal Deducibility, in: Notre Dame Mathematical Lectures, Vol. 6, University of Notre Dame, 1950.
46. H.B. Curry, The elimination theorem when modality is present, J. Symbolic Logic 17 (1952) 249-265.
47. M. Dam, CTL* and ECTL* as fragments of the modal μ-calculus, Theoret. Comput. Sci. 126 (1994) 77-96.
48. C. Davis, Modal operators, equivalence relations, and projective algebras, Amer. J. Math. 76 (1954) 747-762.
49. D. de Jongh, P. van Ulsen, Beths nonclassical valuations, Philos. Sci. 3 (4) (1998-1999) 279-302.
50. D.H.J. de Jongh, A.S. Troelstra, On the connection of partially ordered sets with some pseudo-Boolean algebras, Indag. Math. 28 (1966) 317-329.
51. M. de Rijke, Y. Venema, Sahlqvists theorem for Boolean algebras with operators with an application to cylindric algebras, Studia Logica 54 (1995) 61-78.
52. K. Došen, Duality between modal algebras and neighbourhood frames, Studia Logica 48 (1989) 219-234.
53. J. Dugundji, Note on a property of matrices for Lewis and Langfords calculi of propositions, J. Symbolic Logic 5 (1940) 150-151.
54. M.A.E. Dummett, E.J. Lemmon, Modal logics between S4 and S5, Z. Math. Logik Grandlag. Math. 5 (1959) 250-264.
55. E.A. Emerson, Temporal and modal logic, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, Elsevier, Amsterdam, 1990, pp. 995-1072.
56. E.A. Emerson, E.M. Clarke, Characterizing correctness properties of parallel programs using fixpoints, in: J.W. de Bakker, J. van Leeuwen (Eds.), Automata, Languages and Programming. Proceedings, 1980, in: Lecture Notes in Comput. Sei., Vol. 85, Springer, Berlin, 1980, pp. 169-181.
57. E.A. Emerson, J.Y. Halpern, Sometimes" and "not never" revisited: On branching versus linear time, in: Proceedings of the Annual ACM Symposium on Principles of Programming Languages, 1983, pp. 127-140.
58. E.A. Emerson, J.Y. Halpern, Decision procedures and expressiveness in the temporal logic of branching time, J. Comput. Systems Sci. 30 (1985) 1-24.
59. E.A. Emerson, J.Y. Halpern, Sometimes" and "not never" revisited: On branching versus linear time temporal logic, J. ACM 33 (1986) 151-178.
60. E.A. Emerson, C.S. Jutla, The complexity of tree automata and logics of programs, in: Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, 1988, pp. 328-337.
61. E.A. Emerson, C.S. Jutla, The complexity of tree automata and logics of programs, SIAM J. Comput. 29 (1999) 132-158.
62. L.L. Ésakia, Topological Kripke models, Soviet Math. Dokl. 15 (1974) 147-151.
63. C.J. Everett, S. Ulam, Projective algebras I, Amer. J. Math. 68 (1946) 77-88.
64. R. Fagin, J.Y. Halpern, Y. Moses, M.Y. Vardi, Reasoning About Knowledge, MIT Press, Cambridge, MA, 1995.
65. M. Fairtlough, M. Mendler, An intuitionistic modal logic with applications to the formal verification of hardware, in: L. Pacholoski, J. Tiuryn (Eds.), Computer Science Logic. Proceedings 1994, in: Lecture Notes in Comput. Sci., Vol. 933, Springer, Berlin, 1995, pp. 354-368.
66. M. Fairtlough, M. Mendler, Prepositional lax logic, Inform, and Comput. 137 (1997) 1-33.
67. K. Fine, The logics containing S4.3, Z. Math. Logik Grundlag. Math. 17 (1971) 371-376.
68. K. Fine, An incomplete logic containing S4, Theoria 40 (1974) 23-29.
69. K. Fine, Normal forms in modal logic, Notre Dame J. Formal Logic 16 (1975) 229-234.
70. K. Fine, Some connections between elementary and modal logic, in: S. Kanger (Ed.), Proceedings of the Third Scandinavian Logic Symposium, North-Holland, Amsterdam, 1975, pp. 15-31.
71. M.J. Fischer, R.E. Ladner, Prepositional modal logic of programs, in: Proceedings of the Ninth Annual ACM Symposium on The Theory of Computing, 1977, pp. 286-294.
72. M.J. Fischer, R.E. Ladner, Prepositional dynamic logic of regular programs, J. Comput. Systems Sci. 18 (1979) 194-211.
73. F.B. Fitch, Intuitionistic modal logic with quantifiers, Portugaliae Mathematicae 7 (1948) 113-118.
74. D. Føllesdal, Stig Kanger in memoriam, in: D. Prawitz, B. Skyrms, D. Westerståhl (Eds.), Logic, Methodology and Philosophy of Science IX, North-Holland, Amsterdam, 1994, pp. 885-888.
75. D.M. Gabbay, On decidable, finitely axiomatizable, modal and tense logics without the finite model property, part I, Israel J. Math. 11 (1972) 478-495.
76. D.M. Gabbay, Investigations in Modal and Tense Logics with Applications to Problems in Philosophy and Linguistics, Reidel, Dordrecht, 1976.
77. D.M. Gabbay, I. Hodkinson, M. Reynolds, Temporal Logic. Mathematical Foundations and Computational Aspects, Vol. 1, Oxford University Press, Oxford, 1994.
78. D.M. Gabbay, A. Pneuli, S. Shelah, J. Stavi, On the temporal analysis of fairness, in: Proceedings of the 7th Annual ACM Symposium on Principles of Programming Languages, 1980, pp. 163-173.
79. M. Gerson, An extension of S4 complete for the neighborhood semantics but incomplete for the relational semantics, Studia Logica 34 (1975) 333-342.
80. M. Gerson, The inadequacy of the neighborhood semantics for modal logic, J. Symbolic Logic 40 (1975) 141-148.
81. M. Gerson, A neighborhood frame for T with no equivalent relational frame, Z. Math. Logik Grundlag. Math. 22 (1976) 29-34.
82. S. Givant, Y. Venema, The preservation of Sahlqvist equations in completions of Boolean algebras with operators, Algebra Universalis 41 (1999) 47-84.
83. K. Gödel, Review of Decker, Monatsh. Math. Phys. (Literaturberichte) 38 (1931) 5.
84. English translation in: S. Feferman, et al. (Eds.), Collected Works, Vol. 1, Oxford University Press, Oxford, 1986, p. 217.
85. K. Gödel, Eine interpretation des intuitionistischen aussagenkalküls, Ergebnisse eines Mathematischen Kolloquiums 4 (1933) 39-40.
86. English translation, with an introductory note by A.S. Troelstra, in: K. Gödel, in: S. Feferman, et al. (Eds.), Collected Works, Vol. 1, Oxford University Press, Oxford, 1986, pp. 296-303.
87. R. Goldblatt, Metamathematics of modal logic, Ph.D. Thesis, Victoria University, Wellington, 1974, Included in [95].
88. R. Goldblatt, First-order definability in modal logic, J. Symbolic Logic 40 (1) (1975) 35-40.
89. R. Goldblatt, Solution to a completeness problem of Lemmon and Scott, Notre Dame J. Formal Logic 16 (1975) 405-408.
90. R. Goldblatt, Arithmetical necessity, provability, and intuitionistic logic, Theoria 44 (1978) 8-46. Reprinted in [95].
91. R. Goldblatt, Diodorean modality in Minkowski spacetime, Studia Logica 39 (1980) 19-236. Reprinted in [95].
92. R. Goldblatt, Grothendieck topology as geometric modality, Z. Math. Logik Grundlag. Math. 27 (1981) 495-529. Reprinted in [95].
93. R. Goldblatt, Review of initial papers on dynamic logic by Pratt, Fischer and Ladner, Segerberg, Parikh and Kozen, J. Symbolic Logic 51 (1986) 225-227.
94. R. Goldblatt, Varieties of complex algebras, Ann. Pure Appl. Logic 44 (1989) 173-242.
95. R. Goldblatt, The McKinsey axiom is not canonical, J. Symbolic Logic 56 (1991) 554-562.
96. R. Goldblatt, On closure under canonical embedding algebras, in: H. Andréka, J. Monk, I. Németi (Eds.), Algebraic Logic, in: Colloquia Mathematica Societatis János Bolyai, Vol. 54, North-Holland, Amsterdam, 1991, pp. 217-229.
97. R. Goldblatt, Mathematics of Modality, in: CSLI Lecture Notes, Vol. 43, CSLI Publications, Stanford, CA, 1993. Distributed by Cambridge University Press.
98. R. Goldblatt, Elementary generation and canonicity for varieties of Boolean algebras with operators, Algebra Universalis 34 (1995) 551-607.
99. R. Goldblatt, Reflections on a proof of elementarily, in: J. Gerbrandy, M. Marx, M. de Rijke, Y. Venema (Eds.), JFAK. Essays Dedicated to Johan van Benthem on the Occasion of his 50th Birthday, Vossiuspers, Amsterdam University Press, 1999.
100. R. Goldblatt, Algebraic polymodal logic: A survey, Logic J. IGPL 8 (4) (2000) 393-450, Special Issue on Algebraic Logic edited by István Németi and Ildikó Sain, Electronically available at: http://www3.oup.co.uk/igpl.
101. R. Goldblatt, Quasi-modal equivalence of canonical structures, J. Symbolic Logic 66 (2001) 497-508.
102. R.I. Goldblatt, S.K. Thomason, Axiomatic classes in prepositional modal logic, in: J.N. Crossley (Ed.), Algebra and Logic, in: Lecture Notes in Math., Vol. 450, Springer, Berlin, 1975, pp. 163-173.
103. A. Grzegorczyk, Some relational systems and the associated topological spaces, Fund. Math. 60 (1967) 223-231.
104. P.R. Halmos, Algebraic Logic, Chelsea, New York, 1962.
105. J.Y. Halpern, Y. Moses, A guide to the modal logics of knowledge and belief: Preliminary draft, in: Proceedings of the Ninth International Joint Conference on Artificial Intelligence, 1985, pp. 480-490.
106. J.Y. Halpern, Y. Moses, A guide to completeness and complexity for modal logics of knowledge and belief, Artificial Intelligence 54 (1992) 319-379.
107. D. Harel, First-Order Dynamic Logic, in: Lecture Notes in Comput. Sci., Vol. 68, Springer, Berlin, 1979.
108. D. Harel, Dynamic logic, in: D. Gabbay, F. Guenthner (Eds.), Handbook of Philosophical Logic, Vol. II: Extensions of Classical Logic, D. Reidel, Dordrecht, 1984, pp. 497-604.
109. D. Harel, D. Kozen, R. Parikh, Process logic: Expressiveness decidability completeness, J. Comput. Systems Sci. 25 (1982) 144-170.
110. D. Harel, A. Pnueli, J. Stavi, Propositional dynamic logic of nonregular programs, J. Comput. Systems Sci. 26 (1983) 222-243.
111. R. Harrop, On the existence of finite models and decision procedures for prepositional calculi, Proc. Cambridge Philos. Soc. 54 (1958) 1-13.
112. L. Henkin, The completeness of the first-order functional calculus, J. Symbolic Logic 14 (1949) 159-166.
113. L. Henkin, Completeness in the theory of types, J. Symbolic Logic 15 (1950) 81-91.
114. L. Henkin, J.D. Monk, A. Tarski, Cylindric Algebras I, North-Holland, Amsterdam, 1971.
115. M. Hennessy, X. Liu, A modal logic for message passing processes, Acta Inform. 32 (1995) 375-393.
116. M. Hennessy, R. Milner, On observing nondeterminism and concurrency, in: J.W. de Bakker, J. van Leeuwen (Eds.), Automata Languages and Programming. Proceedings 1980, in: Lecture Notes in Comput. Sci., Vol. 85, Springer, Berlin, 1980, pp. 299-309.
117. M. Hennessy, R. Milner, Algebraic laws for nondeterminism and concurrency, J. ACM 32 (1985) 137-161.
118. D. Hubert, P. Bernays, Grundlagen der Mathematik, Springer, Berlin, 1939.
119. K.J.J. Hintikka, Quantifiers in deontic logic, Societas Scientiarum Fennica Commentationes Humanarum Litterarum 23 (4) (1957).
120. K.J.J. Hintikka, Modality and quantification, Theoria 27 (1961) 119-128.
121. K.J.J. Hintikka, Review of "The morning star paradox" by Stig Kanger, J. Symbolic Logic 34 (1969) 305-306.
122. C.A.R. Hoare, An axiomatic basis for computer programming, Comm. ACM 12 (1969) 576-580, 583.
123. G.E. Hughes, M.J. Cresswell, An Introduction to Modal Logic, Methuen, 1968.
124. E.V. Huntington, Postulates for assertion conjunction negation and equality, Proc. Amer. Acad. Arts Sci. 72 (1937) 1-44.
125. G. Japaridze, D. de Jongh, The logic of provability, in: S.R. Buss (Ed.), Handbook of Proof Theory, in: Studies in Logic, Vol. 137, Elsevier, Amsterdam, 1998, pp. 475-546.
126. B. Jónsson, Algebras whose congruence lattices are distributive, Math. Scand. 21 (1967) 110-121.
127. B. Jónsson, A survey of Boolean algebras with operators, in: Algebras and Orders, in: NATO ASI Series, Vol. 389, Kluwer Academic, Dordrecht, 1993, pp. 239-286.
128. B. Jónsson, On the canonicity of Sahlqvist identities, Studia Logica 53 (1994) 473-491.
129. B. Jónsson, A. Tarski, Boolean algebras with operators, Bull. Amer. Math. Soc. 54 (1948) 79-80.
130. B. Jónsson, A. Tarski, Boolean algebras with operators, part I, Amer. J. Math. 73 (1951) 891-939.
131. B. Jónsson, A. Tarski, Boolean algebras with operators, part II, Amer. J. Math. 74 (1952) 127-162.
132. J.A.W. Kamp, Tense logic and the theory of linear order, Ph.D. Thesis University of California at Los Angeles, 1968.
133. S.Kanger, The morning star paradox, Theoria 23 (1957) 1-11.
134. S. Kanger, Provability in Logic, Almqvist & Wiksell, University of Stockholm, 1957.
135. D. Kaplan, Review of "Semantical analysis of modal logic I. Normal modal prepositional calculi" by Saul A. Kripke, J. Symbolic Logic 31 (1966) 120-122.
136. W. Kneale, M. Kneale, The Development of Logic, Oxford University Press, Oxford, 1962.
137. A.N. Kolmogorov, On the principle of excluded middle (in Russian), Mat. Sb. 32 (1925) 646-667. English translation by Jean van Heijenoort in: van Heijenhoort 1967, 414-437.
138. D. Kozen, Results on the prepositional μ-calculus, in: M.E. Nielsen, M. Schmidt (Eds.), Automata Languages and Programming. Ninth Colloquium 1982, in: Lecture Notes in Comput. Sei., Vol. 140, Springer, Berlin, 1982, pp. 348-359.
139. D. Kozen, Results on the prepositional μ-calculus, Theoret. Comput. Sci. 27 (1983) 333-354.
140. D. Kozen, A finite model theorem for the propositional μ-calculus, Studia Logica 47 (1988) 233-241.
141. D. Kozen, R. Parikh, A decision procedure for the propositional μ-calculus, in: E. Clarke, D. Kozen (Eds.), Logics of Programs. Proceedings 1983, in: Lecture Notes in Comput. Sci., Vol. 164, Springer, Berlin, 1984, pp. 313-325.
142. D. Kozen, J. Tiuryn, Logics of programs, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science Volume B: Formal Models and Semantics, Elsevier, Amsterdam, 1990, pp. 789-840.
143. M. Kracht, Tools and Techniques in Modal Logic, in: Stud. Logic, Vol. 142, Elsevier, Amsterdam, 1999.
144. S.A. Kripke, A completeness theorem in modal logic, J. Symbolic Logic 24 (1959) 1-14.
145. S.A. Kripke, Semantic analysis of modal logic (abstract), J. Symbolic Logic 24 (1959) 323-324.
146. S.A. Kripke, The undecidability of monadic modal quantification theory, Z. Math. Logik Grundlag. Math. 8 (1962) 113-116.
147. S.A. Kripke, Semantical analysis of modal logic I. Normal modal prepositional calculi, Z. Math. Logik Grundlag. Math. 9 (1963) 67-96.
148. S.A. Kripke, Semantical considerations on modal logic, Acta Philos. Fennica 16 (1963) 83-94.
149. S.A. Kripke, Semantical analysis of intuitionistic logic I, in: J.N. Crossley, M.A.E. Dummett (Eds.), Formal Systems and Recursive Functions, North-Holland, Amsterdam, 1965, pp. 92-130.
150. S.A. Kripke, Semantical analysis of modal logic II. Non-normal modal prepositional calculi, in: J.W. Addison, L. Henkin, A. Tarski (Eds.), The Theory of Models, North-Holland, Amsterdam, 1965, pp. 206-220.
151. S.A. Kripke, Review of Lemmon 1966a,b, Math. Rev. 34 (1967) 1021-1022.
152. R.E. Ladner, The computational complexity of provability in systems of modal prepositional logic, SIAM J.Comput. 6 (1977) 467-480.
153. K.G. Larsen, Proof systems for satisfiability in Hennessy-Milner logic with recursion, Theoret. Comput. Sci. 72 (1990) 265-288.
154. F.W. Lawvere, Quantifiers and sheaves, Actes Congrès Internat. Math, l (1970) 329-334.
155. E.J. Lemmon, New foundations for Lewis modal systems, J. Symbolic Logic 22 (1957) 176-186.
156. E.J. Lemmon, Algebraic semantics for modal logics I, J. Symbolic Logic 31 (1966) 46-65.
157. E.J. Lemmon, Algebraic semantics for modal logics II, J. Symbolic Logic 31 (1966) 191-218.
158. E.J. Lemmon, An Introduction to Modal Logic, in: Amer. Philos. Quarterly Monograph Ser., Vol. 11, Basil Blackwell, Oxford, 1977. Written in collaboration with Dana Scott. Edited by Krister Segerberg.
159. C.I. Lewis, Implication and the algebra of logic, Mind (N.S.) 21 (1912) 522-531.
160. C.I. Lewis, A Survey of Symbolic Logic, University of California Press, Berkeley, 1918. Second Edition, Dover, 1960.
161. C.I. Lewis, C.H. Langford, Symbolic Logic, The Century, 1932. Second Edition, Dover, 1959.
162. M.H. Lob, Solution of a problem of Leon Henkin, J. Symbolic Logic 20 (1955) 115-118.
163. M.J. Loux (Ed.), The Possible and the Actual. Readings in the Metaphysics of Modality, Cornell University Press, 1979.
164. J. Łukasiewicz, A. Tarski, Untersuchungen über den aussagenkalkül, C. R. Séances Soc. Sci. Lett. Varsovie 23 (1930) 30-50
165. English translation by J.H. Woodger as "Investigations into the Sentential Calculus" in [250, pp. 38-59]
166. H. MacColl, Symbolic Logic and its Applications, Longmans, Green, London, 1906.
167. D.S. Macnab, An algebraic study of modal operators on heyting algebras, with applications to topology and sheafification, Ph.D. Thesis, University of Aberdeen, 1976.
168. D.S. Macnab, Modal operators on Heyting algebras, Algebra Universalis 12 (1981) 5-29.
169. D.C. Makinson, On some completeness theorems in modal logic, Z. Math. Logik Grundlag. Math. 12 (1966) 379-384.
170. D.C. Makinson, A normal modal calculus between T and S4 without the finite model property, J. Symbolic Logic 34 (1969) 35-38.
171. D.C. Makinson, A generalisation of the concept of relational model for modal logic, Theoria 36 (1970) 331-335.
172. D.C. Makinson, Some embedding theorems for modal logic, Notre Dame J. Formal Logic 12 (1971) 252-254.
173. L.L. Maksimova, Modal logics and varieties of modal algebras: The Beth properties interpolation and amalgamation, Algebra and Logic 31 (1992) 90-105.
174. M. Marx, Y. Venema, Multi-Dimensional Modal Logic, Kluwer Academic, Dordrecht, 1997.
175. B. Mates, The Philosophy of Leibniz, Oxford University Press, Oxford, 1986.
176. R. McKenzie, Equational bases and nonmodular lattice varieties, Trans. Amer. Math. Soc. 174 (1972) 1-43.
177. J.C.C. McKinsey, A solution of the decision problem for the Lewis systems S2 and S4 with an application to topology, J. Symbolic Logic 6 (1941) 117-134.
178. J.C.C. McKinsey, On the syntactical construction of systems of modal logic, J. Symbolic Logic 10 (1945) 83-94.
179. J.C.C. McKinsey, A. Tarski, The algebra of topology, Ann. Math. 45 (1944) 141-191.
180. J.C.C. McKinsey, A. Tarski, On closed elements in closure algebras, Ann. Math. 47 (1946) 122-162.
181. J.C.C. McKinsey, A. Tarski, Some theorems about the sentential calculi of Lewis and Heyting, J. Symbolic Logic 13 (1948) 1-15.
182. C.A. Meredith, Interpretations of different modal logics in the 'property calculus', Mimeograph Department of Philosophy University of Canterbury, Christchurch, New Zealand, 1956, Recorded and expanded by A.N. Prior.
183. A.R. Meyer, Weak monadic second order theory of successor is not elementary-recursive, in: R. Parikh (Ed.), Logic Colloquium. Symposium on Logic Held at Boston 1972-73, in: Lecture Notes in Math., Vol. 453, Springer, Berlin, 1975, pp. 132-154.
184. R. Milner, An algebraic notion of simulation between programs, in: Proceedings of the Second International Joint Conference on Artificial Intelligence, 1971, pp. 481-496.
185. R. Milner, A Calculus of Communicating Systems, in: Lecture Notes in Comput. Sci., Vol. 92, Springer, Berlin, 1980.
186. R. Milner, Calculi for synchrony and asynchrony, Theoret. Comput. Sci. 25 (1983) 267-310.
187. R. Milner, Communication and Concurrency, Prentice-Hall, Englewood Cliffs, NJ, 1989.
188. R. Milner, J. Parrow, D. Walker, Modal logics for mobile processes, Theoret. Comput. Sci. 114 (1993) 149-171.
189. E. Moggi, Notions of computation and monads, Inform. and Comput. 93 (1991) 55-92.
190. R. Montague, Logical necessity physical necessity ethics and quantifiers, Inquiry 3 (1960) 259-269. Reprinted in [190].
191. R. Montague, Pragmatics, in: R. Klibansky (Ed.), Contemporary Philosophy: A Survey, La Nuova Italia Editrice, 1968, pp. 102-122. Reprinted in [190].
192. R. Montague, Pragmatics and intensional logic, Synthèse 22 (1970) 68-94. Reprinted in [190].
193. R. Montague, in: R. Thomason (Ed.), Formal Philosophy (Selected Papers), Yale University Press, 1974.
194. H. Nishimura, Descriptively complete process logic, Acta Inform. 14 (1980) 359-369.
195. H. Ono, Incompleteness of semantics for intermediate predicate logics I. Kripkes semantics, Proc. Japan Acad. 49 (9) (1973) 711-713.
196. R. Parikh, The completeness of propositional dynamic logic, in: Mathematical Foundations of Computer Science 1978, in: Lecture Notes in Comput. Sci., Vol. 64, Springer, Berlin, 1978, pp. 403-115.
197. R. Parikh, A decidability result for second order process logic, in: Proceedings of the 19th Annual IEEE Symposium on Foundations of Computer Science, 1978, pp. 177-183.
198. D. Park, Fixpoint induction and proofs of program properties, in: B. Meltzer, D. Michie (Eds.), Machine Intelligence, Vol. 5, Edinburgh University Press, 1969, pp. 59-78.
199. D. Park, Concurrency and automata on infinite sequences, in: P. Deussen (Ed.), Theoretical Computer Science, in: Lecture Notes in Comput. Sci., Vol. 104, Springer, Berlin, 1981, pp. 167-183.
200. A. Pnueli, The temporal semantics of concurrent programs, Theoret. Comput. Sci. 13 (1981) 45-60.
201. A. Ponse, M. de Rijke, Y. Venema (Eds.), Modal Logic and Process Algebra: A Bisimulation Perspective, CSLI Lecture Notes, Vol. 53, CSLI Publications, Stanford, CA, 1995.
202. V.R. Pratt, Semantical considerations on Floyd-Hoare logic, in: Proceedings of the 17th Annual IEEE Symposium on Foundations of Computer Science, 1976, pp. 109-121.
203. V.R. Pratt, Process logic: preliminary report, in: Proceedings of the 6th Annual ACM Symposium on Principles of Programming Languages, 1979, pp. 93-100.
204. V.R. Pratt, Application of modal logic to programming, Studia Logica 39 (1980) 257-274.
205. V.R. Pratt, A near-optimal method for reasoning about action, J. Comput. System Sci. 20 (1980) 231-254.
206. V.R. Pratt, A decidable mu-calculus: Preliminary report, in: Proceedings of the 22nd Annual IEEE Symposium on Foundations of Computer Science, 1981, pp. 421-427.
207. A.N. Prior, Modality and quantification in S5, J. Symbolic Logic 21 (1) (1956) 60-62.
208. A.N. Prior, Time and Modality, Clarendon Press, Oxford, 1957.
209. A.N. Prior, The syntax of time-distinctions, Franciscan Studies 18 (1958) 105-120.
210. A.N. Prior, Possible worlds, Philos. Quarterly 12 (1962) 36-43.
211. A.N. Prior, Tense-logic and the continuity of time, Studia Logica 13 (1962) 133-148.
212. A.N. Prior, Past Present and Future, Oxford University Press, Oxford, 1967.
213. A.N. Prior, K. Fine, Worlds Times and Selves, Duckworth, 1977.
214. W.V. Quine, The problem of interpreting modal logic, J. Symbolic Logic 12 (1947) 43-48.
215. M.O. Rabin, Decidability of second-order theories and automata on infinite trees, Trans. Amer. Math. Soc. 141 (1969) 1-35.
216. S. Read, Hugh MacColl and the algebra of strict implication, Nordic J. Philos. Logic 3 (1) (1998) 59-83, Electronically available at: http://www.hf.uio.no/filosofi/njpl/vo13no1/index.html.
217. M. Reynolds, An axiomatization of full computation tree logic, J. Symbolic Logic 66 (3) (2001) 1011-1057.
218. H. Sahlqvist, Completeness and correspondence in the first and second order semantics for modal logic, in: S. Kanger (Ed.), Proceedings of the Third Scandinavian Logic Symposium, North-Holland, Amsterdam, 1975, pp. 110-143.
219. O. Sambin, V. Vaccaro, A new proof of Sahlqvists theorem on modal definability and completeness, J. Symbolic Logic 54 (1989) 992-999.
220. W.J. Savitch, Relationships between nondeterministic and deterministic tape complexities, J. Comput. Systems Sci. 4 (1970) 177-192.
221. D. Scott, Advice on modal logic, in: K. Lambert (Ed.), Philosophical Problems in Logic, Reidel, 1970, pp. 143-173.
222. S.J. Scroggs, Extensions of the Lewis system S5, J. Symbolic Logic 16 (1951) 112-120.
223. K. Segerberg, Decidability of S4.1, Theoria 34 (1968) 7-20.
224. K. Segerberg, Prepositional logics related to Heytings and Johanssons, Theoria 34 (1968) 26-61.
225. K. Segerberg, Modal logics with linear alternative relations, Theoria 36 (1970) 301-322.
226. K. Segerberg, An Essay in Classical Modal Logic, in: Filosofiska Studier, Vol. 13, Uppsala Universitet, 1971.
227. K. Segerberg, Franzén's proof of Bulls theorem, Ajatus 35 (1973) 216-221.
228. K. Segerberg, That every extension of S4.3 is normal, in: S. Kanger (Ed.), Proceedings of the Third Scandinavian Logic Symposium, North-Holland, Amsterdam, 1975, pp. 194-196.
229. K. Segerberg, A completeness theorem in the modal logic of programs, Notices Amer. Math. Soc. 24 (1977) A-552.
230. K. Segerberg, A completeness theorem in the modal logic of programs, in: T. Traczyck (Ed.), Universal Algebra and Applications. Papers presented at the Seminar held at the Stefan Banach International Mathematical Center 1978, in: Banach Center Publications, Vol. 9, PWN, Warsaw, 1982, pp. 31-46.
231. V.B. Šehtman, On incomplete propositional logics, Soviet Math. Dokl. 18 (1977) 985-989.
232. V.B. Shehtman, Modal logics of domains on the real plane, Studia Logica 42 (1983) 63-80.
233. J.R. Shoenfield, Mathematical Logic, Addison-Wesley, Reading, MA, 1967.
234. A.K. Simpson, The proof theory and semantics of intuitionistic modal logics, Ph.D. Thesis, University of Edinburgh, 1994. Available at: http://www.dcs.ed.ac.uk/home/als/Research/.
235. C. Smoryński, Self-Reference and Modal Logic, Springer, Berlin, 1985.
236. C. Smoryński, The development of self-reference: Löbs theorem, in: T. Drucker (Ed.), Perspectives on the History of Mathematical Logic, Birkhäuser, Bazel, 1991, pp. 110-133.
237. C. Smoryński, Remarks about axiomatizations of certain modal systems, Notre Dame J. Formal Logic 5 (1964) 71-80.
238. R. Solovay, Provability interpretations of modal logic, Israel J. Math. 25 (1976) 287-304.
239. E. Spaan, Complexity of modal logics, Ph.D. Thesis, University of Amsterdam, 1993.
240. C. Stirling, Modal logics for communicating systems, Theoret. Comput. Sci. 49 (1987) 311-347.
241. C. Stirling, Modal and temporal logics, in: S. Abramsky, D.M. Gabbay, T.S.E. Maibaum (Eds.), Handbook of Logic in Computer Science, Vol. 2, Oxford University Press, Oxford, 1992, pp. 477-563.
242. M.H. Stone, The theory of representations for Boolean algebras, Trans. Amer. Math. Soc. 40 (1936) 37-111.
243. M.H. Stone, Topological representations of distributive lattices and Brouwerian logics, Casopis pro Pestovani Matematiky a Fysiky 67 (1937-8) 1-25.
244. R.S. Streett, Propositional dynamic logic of looping and converse is elementarily decidable, Inform, and Control 54 (1982) 121-141.
245. R.S. Streett, E.A. Emerson, The propositional mu-calculus is elementary, in: J. Paradaens (Ed.), Automata Languages and Programming. Proceedings 1984, in: Lecture Notes in Comput. Sci., Vol. 172, Springer, Berlin, 1984, pp. 465-472.
246. R.S. Streett, E.A. Emerson, An automata theoretic decision procedure for the propositional mu-calculus, Inform. Comput. 81 (1989) 249-264.
247. T.-C. Tang, Algebraic postulates and a geometric interpretation for the Lewis calculus of strict implication, Bull. Amer. Math. Soc. 44 (1938) 737-744.
248. A. Tarski, Der aussagenkalkül und die topologie, Fund. Math. 31 (1938) 103-134.
249. English translation by J.H. Woodger as "Sentential Calculus and Topology" in [250], pp. 421-454.
250. A. Tarski, On the calculus of relations, J. Symbolic Logic 6 (1941) 73-89.
251. A. Tarski, A remark on functionally free algebras, Ann. Math. 47 (1946) 163-165.
252. A. Tarski, Contributions to the theory of models III, Koninklijkle Nederlandse Akademie van Wetenschappen Proceedings Series A 58 (1955) 56-64 (Indag. Math. 17).
253. A. Tarski, A lattice-theoretical fixpoint theorem and its applications, Pacific J. Math. 5 (1955) 285-309.
254. A. Tarski, Logic Semantics Metamathematics: Papers from 1923 to 1938, Oxford University Press, Oxford, 1956. Translated into English and edited by J.H. Woodger.
255. W. Thomas, Computation tree logic and regular ω-languages, in: J.W. de Bakker W.P.D.R., G. Rozenberg (Eds.), Linear Time Branching Time and Partial Order in Logics and Models for Concurrency, in: Lecture Notes in Comput. Sci., Vol. 354, Springer, Berlin, 1989, pp. 690-713.
256. S.K. Thomason, Noncompactness in propositional modal logic, J. Symbolic Logic 37 (1972) 716-720.
257. S.K. Thomason, Semantic analysis of tense logic, J. Symbolic Logic 37 (1972) 150-158.
258. S.K. Thomason, An incompleteness theorem in modal logic, Theoria 40 (1974) 30-34.
259. S.K. Thomason, Reduction of tense logic to modal logic I, J. Symbolic Logic 39 (1974) 549-551.
260. S.K. Thomason, Categories of frames for modal logic, J. Symbolic Logic 40 (1975) 439-442.
261. S.K. Thomason, The logical consequence relation of propositional tense logic, Z. Math. Logik Grundlag. Math. 21 (1975) 29-40.
262. S.K. Thomason, Reduction of second-order logic to modal logic, Z. Math. Logik Grundlag. Math. 21 (1975) 107-114.
263. S.K. Thomason, Reduction of tense logic to modal logic II, Theoria 41 (1975) 154-169.
264. M. Tierney, Sheaf theory and the continuum hypothesis, in: F.W. Lawvere (Ed.), Toposes Algebraic Geometry and Logic, in: Lecture Notes in Math., Vol. 274, Springer, Berlin, 1972, pp. 13-42.
265. A. Urquhart, Decidability and the finite model property, J. Philosophical Logic 10 (3) (1981) 367-370.
266. J.F.A.K. van Benthem, A note on modal formulas and relational properties, J. Symbolic Logic 40 (1) (1975) 55-58.
267. J.F.A.K. van Benthem, Modal correspondence theory, Ph.D. Thesis, University of Amsterdam, 1976.
268. J.F.A.K. van Benthem, Modal formulas are either elementary or not ΣΔA-elementary, J. Symbolic Logic 41 (1976) 436-438.
269. J.F.A.K. van Benthem, Two simple incomplete modal logics, Theoria 44 (1978) 25-37.
270. J.F.A.K. van Benthem, Syntactic aspects of modal incompleteness theorems, Theoria 45 (1979) 67-81.
271. J.F.A.K. van Benthem, Some kinds of modal completeness, Studia Logica 39 (1980) 125-141.
272. J.F.A.K. van Benthem, Modal Logic and Classical Logic, Bibliopolis Naples, 1983.
273. J.F.A.K. van Benthem, Correspondence theory, in: D. Gabbay, F. Guenthner (Eds.), Handbook of Philosophical Logic Volume II: Extensions of Classical Logic, Reidel, Dordrecht, 1984, pp. 167-247.
274. M.Y. Vardi, L. Stockmeyer, Improved upper and lower bounds for modal logics of programs, in: Proceedings of the 17th Annual ACM Symposium on the Theory of Computing, 1985, pp. 240-251.
275. G.H. von Wright, An Essay in Modal Logic, North-Holland, Amsterdam, 1951.
276. I. Walukiewicz, Completeness of Kozens axiomatisation of the propositional μ-calculus, in: D. Kozen (Ed.), Proceedings of the Tenth Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, 1995, pp. 14-24.
277. I. Walukiewicz, Completeness of Kozens axiomatisation of the propositional μ-calculus, Inform, and Comput. 157 (2000) 142-182.
278. G. Winskel, On powerdomains and modality, Theoret. Comput. Sci. 36 (1985) 127-137.
279. P. Wolper, Temporal logic can be more expressive, Inform, and Control 56 (1983) 72-99.