MATHEMATICAL MODAL LOGIC: A VIEW OF ITS EVOLUTION

Mathematical Modal Logic: A View of its Evolution 95[Moggi, 1991] Eugenio Moggi. Notions of computation and monads. Information and Computation,93:55–92, 1991.[Montague, 1960] Richard Montague. Logical necessity, physical necessity, ethics, and quantifiers.Inquiry, 3:259–269, 1960. Reprinted in [Montague, 1974].[Montague, 1968] Richard Montague. Pragmatics. In R. Klibansky, editor, Contemporary Philosophy:A Survey, pages 102–122. La Nuova Italia Editrice, 1968. Reprinted in [Montague,1974].[Montague, 1970] Richard Montague. Pragmatics and intensional logic. Synthèse, 22:68–94,1970. Reprinted in [Montague, 1974].[Montague, 1974] Richard Montague. Formal Philosophy (Selected Papers). Yale UniversityPress, 1974. Edited by Richmond Thomason.[Moss, 1999] Lawrence S. Moss. Coalgebraic logic. Annals of Pure and Applied Logic, 96:277–317, 1999.[Nishimura, 1980] Hirokazu Nishimura. Descriptively complete process logic. Acta Informatica,14:359–369, 1980.[Ono, 1973] Hiroakira Ono. Incompleteness of semantics for intermediate predicate logics i.Kripke’s semantics. Proceedings of the Japan Academy, 49(9):711–713, 1973.[Parikh, 1978a] Rohit Parikh. The completeness of propositional dynamic logic. In MathematicalFoundations of Computer Science 1978, volume 64 of Lecture Notes in Computer Science,pages 403–415. Springer Verlag, 1978.[Parikh, 1978b] Rohit Parikh. A decidability result for second order process logic. In Proceedingsof the 19th Annual IEEE Symposium on Foundations of Computer Science, pages 177–183,1978.[Park, 1969] David Park. Fixpoint induction and proofs of program properties. In BernardMeltzer and Donald Michie, editors, Machine Intelligence 5, pages 59–78. Edinburgh UniversityPress, 1969.[Park, 1981] David Park. Concurrency and automata on infinite sequences. In P. Deussen,editor, Theoretical Computer Science, volume 104 of Lecture Notes in Computer Science,pages 167–183. Springer-Verlag, 1981.[Pnueli, 1977] Amir Pnueli. The temporal logic of programs. In Proceedings of the 18th AnnualIEEE Symposium on Foundations of Computer Science, pages 46–57, 1977.[Pnueli, 1981] Amir Pnueli. The temporal semantics of concurrent programs. Theoretical ComputerScience, 13:45–60, 1981.[Ponse et al., 1995] Alban Ponse, Maarten de Rijke, and Yde Venema, editors. Modal Logic andProcess Algebra: a Bisimulation Perspective. CSLI Lecture Notes No. 53. CSLI Publications,Stanford, CA, 1995.[Pratt, 1976] Vaughan R. Pratt. Semantical considerations on Floyd-Hoare logic. In Proceedingsof the 17th Annual IEEE Symposium on Foundations of Computer Science, pages 109–121,1976.[Pratt, 1979] Vaughan R. Pratt. Process logic: Preliminary report. In Proceedings of the 6thAnnual ACM Symposium on Principles of Programming Languages, pages 93–100, 1979.[Pratt, 1980a] Vaughan R. Pratt. Application of modal logic to programming. Studia Logica,39:257–274, 1980.[Pratt, 1980b] Vaughan R. Pratt. A near-optimal method for reasoning about action. Journalof Computer and System Sciences, 20:231–254, 1980.[Pratt, 1981] Vaughan R. Pratt. A decidable mu-calculus: Preliminary report. In Proceedingsof the 22nd Annual IEEE Symposium on Foundations of Computer Science, pages 421–427,1981.[Prior and Fine, 1977] Arthur N. Prior and Kit Fine. Worlds, Times and Selves. Duckworth,1977.[Prior, 1956] Arthur N. Prior. Modality and quantification in S5. The Journal of SymbolicLogic, 21(1):60–62, 1956.[Prior, 1957] Arthur N. Prior. Time and Modality. Clarendon Press, Oxford, 1957.[Prior, 1958] Arthur N. Prior. The syntax of time-distinctions. Franciscan Studies, 18:105–120,1958.[Prior, 1962a] Arthur N. Prior. Possible worlds. Philosophical Quarterly, 12:36–43, 1962.[Prior, 1962b] Arthur N. Prior. Tense-logic and the continuity of time. Studia Logica, 13:133–148, 1962.