MATHEMATICAL MODAL LOGIC: A VIEW OF ITS EVOLUTION

88 Robert Goldblatt[Clarke and Emerson, 1981] Edmund M. Clarke and E. Allen Emerson. Design and synthesis ofsynchronisation skeletons using branching time temporal logic. In D. Kozen, editor, Logics ofPrograms, volume 131 of Lecture Notes in Computer Science, pages 52–71. Springer-Verlag,1981.[Cook, 1971] S. A. Cook. The complexity of theorem proving procedures. In Proceedings of theThird Annual ACM Symposium on the Theory of Computing, pages 151–158, 1971.[Copeland, 1996a] B. J. Copeland, editor. Logic and Reality: Essays on the Legacy of ArthurPrior. Oxford University Press, 1996.[Copeland, 1996b] B. J. Copeland. Prior’s life and legacy. In B. J. Copeland, editor, Logic andReality: Essays on the Legacy of Arthur Prior, pages 1–40. Oxford University Press, 1996.[Copeland, 2002] B. J. Copeland. The genesis of possible worlds semantics. Journal of PhilosophicalLogic, 31(2):99–137, 2002.[Cresswell, 1967] M. J. Cresswell. A Henkin completeness theorem for T. Notre Dame Journalof Formal Logic, 8:186–190, 1967.[Cresswell, 1972] M. J. Cresswell. The completeness of S1 and some related systems. NotreDame Journal of Formal Logic, 13:485–496, 1972.[Cresswell, 1973] M. J. Cresswell. Logics and Languages. Methuen, 1973.[Cresswell, 1984] M. J. Cresswell. An incomplete decidable modal logic. The Journal of SymbolicLogic, 49:520–527, 1984.[Cresswell, 1995] M. J. Cresswell. S1 is not so simple. In Walter Sinnott-Armstrong, DianaRaffman, and Nicholas Asher, editors, Modality, Morality and Belief. Essays in Honor ofRuth Barcan Marcus, pages 29–40. Cambridge University Press, 1995.[Curry, 1950] Haskell B. Curry. A Theory of Formal Deducibility. Notre Dame MathematicalLectures, no. 6. University of Notre Dame, 1950.[Curry, 1952] Haskell B. Curry. The elimination theorem when modality is present. The Journalof Symbolic Logic, 17:249–265, 1952.[Dam, 1994] Mads Dam. CTL* and ECTL* as fragments of the modal µ-calculus. TheoreticalComputer Science, 126:77–96, 1994.[Davis, 1954] Chandler Davis. Modal operators, equivalence relations, and projective algebras.American Journal of Mathematics, 76:747–762, 1954.[de Jongh and Troelstra, 1966] D. H. J. de Jongh and A. S. Troelstra. On the connection of partiallyordered sets with some pseudo-Boolean algebras. Indagationes Mathematicae, 28:317–329, 1966.[de Jongh and van Ulsen, 1998–1999] Dick de Jongh and Paul van Ulsen. Beth’s nonclassicalvaluations. Philosophia Scientiae, 3(4):279–302, 1998–1999.[de Rijke and Venema, 1995] Maarten de Rijke and Yde Venema. Sahlqvist’s theorem forBoolean algebras with operators with an application to cylindric algebras. Studia Logica,54:61–78, 1995.[Došen, 1989] Kosta Došen. Duality between modal algebras and neighbourhood frames. StudiaLogica, 48:219–234, 1989.[Dugundji, 1940] James Dugundji. Note on a property of matrices for Lewis and Langford’scalculi of propositions. The Journal of Symbolic Logic, 5:150–151, 1940.[Dummett and Lemmon, 1959] M. A. E. Dummett and E. J. Lemmon. Modal logics betweenS4 and S5. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 5:250–264,1959.[Emerson and Clarke, 1980] E. Allen Emerson and Edmund M. Clarke. Characterizing correctnessproperties of parallel programs using fixpoints. In J. W. de Bakker and J. van Leeuwen,editors, Automata, Languages and Programming. Proceedings 1980, volume 85 of LectureNotes in Computer Science, pages 169–181. Springer-Verlag, 1980.[Emerson and Halpern, 1982] E. Allen Emerson and Joseph Y. Halpern. Decision proceduresand expressiveness in the temporal logic of branching time. In Annual ACM Symposium onTheory of Computing (STOC), pages 169–180, 1982.[Emerson and Halpern, 1983] E. Allen Emerson and Joseph Y. Halpern. “Sometimes” and “notnever” revisited: On branching versus linear time. In Proceedings of the Annual ACM Symposiumon Principles of Programming Languages, pages 127–140, 1983.[Emerson and Halpern, 1985] E. Allen Emerson and Joseph Y. Halpern. Decision proceduresand expressiveness in the temporal logic of branching time. Journal of Computer and SystemsSciences, 30:1–24, 1985.