MATHEMATICAL MODAL LOGIC: A VIEW OF ITS EVOLUTION

92 Robert Goldblatt[Hoare, 1969] C. A. R. Hoare. An axiomatic basis for computer programming. Communicationsof the Association for Computing Machinery, 12:576–580, 583, 1969.[Hughes and Cresswell, 1968] G. E. Hughes and M. J. Cresswell. An Introduction to ModalLogic. Methuen, 1968.[Hughes, 1990] G. E. Hughes. Every world can see a reflexive world. Studia Logica, 49:175–181,1990.[Huntington, 1937] Edward V. Huntington. Postulates for assertion, conjunction, negation, andequality. Proceedings of the American Academy of Arts and Sciences, 72:1–44, 1937.[Jacobs and Rutten, 1997] Bart Jacobs and Jan Rutten. A tutorial on (co)algebras and(co)induction. Bulletin of the European Association for Theoretical Computer Science,62:222–259, 1997.[Jacobs, 1996] Bart Jacobs. Objects and classes, coalgebraically. In B. Freitag, C. B. Jones,C. Lengauer, and H.-J. Schek, editors, Object-Orientation with Parallelism and Persistence,pages 83–103. Kluwer Academic Publishers, 1996.[Jacobs, 2000] Bart Jacobs. Towards a duality result in coalgebraic modal logic. ElectronicNotes in Theoretical Computer Science, 33, 2000.[Jacobs, 2002] Bart Jacobs. Exercises in coalgebraic specification. In R. Backhouse, R. Crole,and J. Gibbons, editors, Algebraic and Coalgebraic Methods in the Mathematics of ProgramConstruction, volume 2297 of Lecture Notes in Computer Science, pages 237–280. Springer,2002.[Japaridze and de Jongh, 1998] Giorgi Japaridze and Dick de Jongh. The logic of provability.In Samuel R. Buss, editor, Handbook of Proof Theory, volume 137 of Studies in Logic, pages475–546. Elsevier, 1998.[Jónsson and Tarski, 1948] Bjarni Jónsson and Alfred Tarski. Boolean algebras with operators.Bulletin of the American Mathematical Society, 54:79–80, January 1948.[Jónsson and Tarski, 1951] Bjarni Jónsson and Alfred Tarski. Boolean algebras with operators,part I. American Journal of Mathematics, 73:891–939, 1951.[Jónsson and Tarski, 1952] Bjarni Jónsson and Alfred Tarski. Boolean algebras with operators,part II. American Journal of Mathematics, 74:127–162, 1952.[Jónsson, 1967] Bjarni Jónsson. Algebras whose congruence lattices are distributive. Math.Scand., 21:110–121, 1967.[Jónsson, 1993] Bjarni Jónsson. A survey of Boolean algebras with operators. In Algebras andOrders, volume 389 of NATO ASI Series, pages 239–286. Kluwer Academic Publishers, 1993.[Jónsson, 1994] Bjarni Jónsson. On the canonicity of Sahlqvist identities. Studia Logica, 53:473–491, 1994.[Kamp, 1968] J. A. W. Kamp. Tense Logic and the Theory of Linear Order. PhD thesis,University of California at Los Angeles, 1968.[Kanger, 1957a] Stig Kanger. The morning star paradox. Theoria, 23:1–11, 1957.[Kanger, 1957b] Stig Kanger. Provability in Logic. University of Stockholm–Almqvist & Wiksell,1957.[Kaplan, 1966] David Kaplan. Review of “Semantical analysis of modal logic I. Normal modalpropositional calculi”, by Saul A. Kripke. The Journal of Symbolic Logic, 31:120–122, 1966.[Kawahara and Mori, 2000] Yasuo Kawahara and Masao Mori. A small final coalgebra theorem.Theoretical Computer Science, 233:129–145, 2000.[Kneale and Kneale, 1962] William Kneale and Martha Kneale. The Development of Logic.Oxford University Press, 1962.[Kolmogorov, 1925] A. N. Kolmogorov. On the principle of excluded middle (Russian). MatematicheskiiSbornik, 32:646–667, 1925. English translation by Jean van Heijenoort in vanHeijenhoort 1967, pages 414–437.[Kozen and Parikh, 1984] Dexter Kozen and Rohit Parikh. A decision procedure for the propositionalµ-calculus. In E. Clarke and D. Kozen, editors, Logics of Programs. Proceedings 1983,volume 164 of Lecture Notes in Computer Science, pages 313–325. Springer-Verlag, 1984.[Kozen and Tiuryn, 1990] Dexter Kozen and Jerzy Tiuryn. Logics of programs. In Jan vanLeeuwen, editor, Handbook of Theoretical Computer Science, Volume B: Formal Models andSemantics, pages 789–840. Elsevier, 1990.[Kozen, 1982] Dexter Kozen. Results on the propositional µ-calculus. In M. Nielsen and E. M.Schmidt, editors, Automata, Languages and Programming. Ninth Colloquium 1982, volume140 of Lecture Notes in Computer Science, pages 348–359. Springer-Verlag, 1982.