MATHEMATICAL MODAL LOGIC: A VIEW OF ITS EVOLUTION

Mathematical Modal Logic: A View of its Evolution 91[Goldblatt, 2003b] Robert Goldblatt. Equational logic of polynomial coalgebras. In PhilippeBalbiani, Nobu-Yuki Suzuki, Frank Wolter, and Michael Zakharyaschev, editors, Advances inModal Logic, Volume 4, pages 149–184. King’s College Publications, King’s College London,2003. www.aiml.net.[Goldblatt, 2003c] Robert Goldblatt. Mathematical modal logic: A view of its evolution. Journalof Applied Logic, 1(5–6):309–392, 2003.[Goldblatt, 2003d] Robert Goldblatt. Observational ultraproducts of polynomial coalgebras.Annals of Pure and Applied Logic, 123:235–290, 2003.[Goldblatt, 2004] Robert Goldblatt. Final coalgebras and the Hennessy-Milner property. Annalsof Pure and Applied Logic, 2004. To appear.[Grzegorczyk, 1967] Andrzej Grzegorczyk. Some relational systems and the associated topologicalspaces. Fundamenta Mathematicae, 60:223–231, 1967.[Gumm, 1999] H. Peter Gumm. Elements of the general theory of coalgebras. LUATCS’99, RandAfricaans University, Johannesburg, South Africa, 60 pp. www.Mathematik.uni-marburg.de/~gumm/Papers/publ.html, 1999.[Halmos, 1962] P. R. Halmos. Algebraic Logic. Chelsea, New York, 1962.[Halpern and Moses, 1985] Joseph Y. Halpern and Yoram Moses. A guide to the modal logicsof knowledge and belief: Preliminary draft. In Proceedings of the Ninth International JointConference on Artificial Intelligence, pages 480–490, 1985.[Halpern and Moses, 1992] Joseph Y. Halpern and Yoram Moses. A guide to completeness andcomplexity for modal logics of knowledge and belief. Artificial Intelligence, 54:319–379, 1992.[Harel et al., 1982] David Harel, Dexter Kozen, and Rohit Parikh. Process logic: Expressiveness,decidability, completeness. Journal of Computer and Systems Sciences, 25:144–170, 1982.[Harel et al., 1983] D. Harel, A. Pnueli, and J. Stavi. Propositional dynamic logic of nonregularprograms. Journal of Computer and Systems Sciences, 26:222–243, 1983.[Harel, 1979] David Harel. First-Order Dynamic Logic, volume 68 of Lecture Notes in ComputerScience. Springer-Verlag, 1979.[Harel, 1984] David Harel. Dynamic logic. In D. Gabbay and F. Guenthner, editors, Handbookof Philosophical Logic, Volume II: Extensions of Classical Logic, pages 497–604. D. Reidel,1984.[Harrop, 1958] R. Harrop. On the existence of finite models and decision procedures for propositionalcalculi. Proceedings of the Cambridge Philosophical Society, 54:1–13, 1958.[Hasle and Øhrstrøm, 2004] Peter Hasle and Peter Øhrstrøm. The flow of time into logic – andcomputer science. Bulletin of the European Association for Theoretical Computer Science,82:191–226, February 2004.[Henkin et al., 1971] Leon Henkin, J. Donald Monk, and Alfred Tarski. Cylindric Algebras I.North-Holland, Amsterdam, 1971.[Henkin, 1949] Leon Henkin. The completeness of the first-order functional calculus. The Journalof Symbolic Logic, 14:159–166, 1949.[Henkin, 1950] Leon Henkin. Completeness in the theory of types. The Journal of SymbolicLogic, 15:81–91, 1950.[Hennessy and Liu, 1995] M. Hennessy and X. Liu. A modal logic for message passing processes.Acta Informatica, 32:375–393, 1995.[Hennessy and Milner, 1980] Matthew Hennessy and Robin Milner. On observing nondeterminismand concurrency. In J. W. de Bakker and J. van Leeuwen, editors, Automata, Languagesand Programming. Proceedings 1980, volume 85 of Lecture Notes in Computer Science, pages299–309. Springer-Verlag, 1980.[Hennessy and Milner, 1985] Matthew Hennessy and Robin Milner. Algebraic laws for nondeterminismand concurrency. Journal of the Association for Computing Machinery, 32:137–161,1985.[Hilbert and Bernays, 1939] David Hilbert and Paul Bernays. Grundlagen der Mathematik.Springer, 1939.[Hintikka, 1957] K. J. J. Hintikka. Quantifiers in deontic logic. Societas Scientiarum Fennica,Commentationes Humanarum Litterarum, 23(4), 1957.[Hintikka, 1961] K. J. J. Hintikka. Modality and quantification. Theoria, 27:119–128, 1961.[Hintikka, 1969] K. J. J. Hintikka. Review of “The morning star paradox” by Stig Kanger. TheJournal of Symbolic Logic, 34:305–306, 1969.