MATHEMATICAL MODAL LOGIC: A VIEW OF ITS EVOLUTION

Mathematical Modal Logic: A View of its Evolution 97[Segerberg, 1977] Krister Segerberg. A completeness theorem in the modal logic of programs.Notices of the American Mathematical Society, 24:A–552, 1977.[Segerberg, 1982] Krister Segerberg. A completeness theorem in the modal logic of programs. InT. Traczyck, editor, Universal Algebra and Applications. Papers presented at the seminar heldat the Stefan Banach International Mathematical Center, 1978, pages 31–46. PWN–PolishScientific Publishers, Warsaw, 1982. Banach Center Publications, vol. 9.[Šehtman, 1977] V. B. Šehtman. On incomplete propositional logics. Soviet Mathematics Doklady,18:985–989, 1977.[Shehtman, 1983] V. B. Shehtman. Modal logics of domains on the real plane. Studia Logica,42:63–80, 1983.[Shoenfield, 1967] Joseph R. Shoenfield. Mathematical Logic. Addison-Wesley, 1967.[Simpson, 1994] Alex K. Simpson. The Proof Theory and Semantics of Intuitionistic ModalLogics. PhD thesis, University of Edinburgh, 1994. Available at www.dcs.ed.ac.uk/home/als/Research/.[Smoryński, 1985] C. Smoryński. Self-Reference and Modal Logic. Springer-Verlag, 1985.[Smoryński, 1991] C. Smoryński. The development of self-reference: Löb’s theorem. InThomas Drucker, editor, Perspectives on the History of Mathematical Logic, pages 110–133.Birkhäuser, 1991.[Sobociński, 1964] Boleslaw Sobociński. Remarks about axiomatizations of certain modal systems.Notre Dame Journal of Formal Logic, 5:71–80, 1964.[Solovay, 1976] R. Solovay. Provability interpretations of modal logic. Israel Journal of Mathematics,25:287–304, 1976.[Spaan, 1993] Edith Spaan. Complexity of Modal Logics. PhD thesis, University of Amsterdam,1993.[Stirling, 1987] Colin Stirling. Modal logics for communicating systems. Theoretical ComputerScience, 49:311–347, 1987.[Stirling, 1992] Colin Stirling. Modal and temporal logics. In S. Abramsky, Dov M. Gabbay,and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, Volume 2, pages477–563. Oxford University Press, 1992.[Stone, 1936] M. H. Stone. The theory of representations for Boolean algebras. Transactions ofthe American Mathematical Society, 40:37–111, 1936.[Stone, 1937–1938] M. H. Stone. Topological representations of distributive lattices and Brouwerianlogics. Casopis pro Pestovani Matematiky a Fysiky, 67:1–25, 1937–1938.[Streett and Emerson, 1984] Robert S. Streett and E. Allen Emerson. The propositional mucalculusis elementary. In J. Paradaens, editor, Automata, Languages and Programming.Proceedings 1984, volume 172 of Lecture Notes in Computer Science, pages 465–472. Springer-Verlag, 1984.[Streett and Emerson, 1989] Robert S. Streett and E. Allen Emerson. An automata theoreticdecision procedure for the propositional mu-calculus. Information and Computation, 81:249–264, 1989.[Streett, 1982] Robert S. Streett. Propositional dynamic logic of looping and converse is elementarilydecidable. Information and Control, 54:121–141, 1982.[Tang, 1938] Tsao-Chen Tang. Algebraic postulates and a geometric interpretation for the Lewiscalculus of strict implication. Bulletin of the American Mathematical Society, 44:737–744,1938.[Tarski, 1938] Alfred Tarski. Der aussagenkalkül und die topologie. Fundamenta Mathematicae,31:103–134, 1938. English translation by J. H. Woodger as Sentential Calculus and Topologyin Tarski 1956, 421–454.[Tarski, 1941] Alfred Tarski. On the calculus of relations. Journal of Symbolic Logic, 6:73–89,1941.[Tarski, 1946] Alfred Tarski. A remark on functionally free algebras. Annals of Mathematics,47:163–165, 1946.[Tarski, 1955a] Alfred Tarski. Contributions to the theory of models III. Koninklijkle NederlandseAkademie van Wetenschappen, Proceedings, Series A, 58:56–64, 1955. IndagationesMathematicae, vol. 17.[Tarski, 1955b] Alfred Tarski. A lattice-theoretical fixpoint theorem and its applications. PacificJournal of Mathematics, 5:285–309, 1955.