Mathematical modal logic: A view of its evolution

This is a survey of the origins of mathematical interpretations of modal logics, and their development over the last century or so. It focuses on the interconnections between algebraic semantics using Boolean algebras with operators and relational semantics using structures often called Kripke models. It reviews the ideas of a number of people who independently contributed to the emergence of relational semantics, and compares them with the work of Kripke. It concludes with an account of several applications of modal model theory to mathematics and theoretical computer science.

[1]  K. Segerberg.  That Every Extension Of S4.3 is Normal , 1975 .

[2]  Schiller Joe Scroggs.  Extensions of the Lewis System S5 , 1951, J. Symb. Log..

[3]  Kit Fine,et al.  Normal forms in modal logic , 1975, Notre Dame J. Formal Log..

[4]  Saul A. Kripke.  The Undecidability of Monadic Modal Quantification Theory , 1962 .

[5]  G. P. Henderson,et al.  An Essay in Modal Logic. , 1953 .

[6]  M. de Rijke,et al.  Modal Logic and Process Algebra: A Bisimulation Perspective , 1996 .

[7]  Simon L. Peyton Jones,et al.  Imperative functional programming , 1993, POPL '93.

[8]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[9]  L. L. Maksimova,et al.  Modal logics and varieties of modal algebras: The beth properties, interpolation, and amalgamation , 1992 .

[10]  Michael Mendler,et al.  Propositional Lax Logic , 1997, Inf. Comput..

[11]  D. Gabbay,et al.  Temporal Logic Mathematical Foundations and Computational Aspects , 1994 .

[12]  Michael Zakharyaschev,et al.  Modal Logic , 1997, Oxford logic guides.

[13]  Johan Anthory Willem Kamp,et al.  Tense logic and the theory of linear order , 1968 .

[14]  P. Erdös,et al.  Graph Theory and Probability , 1959 .

[15]  Michael Barr,et al.  Terminal Coalgebras in Well-Founded Set Theory , 1993, Theor. Comput. Sci..

[16]  Larry J. Stockmeyer,et al.  Improved upper and lower bounds for modal logics of programs , 1985, STOC '85.

[17]  Hiroakira Ono.  Incompleteness of Semantics for Intermediate Predicate Logics. I:Kripke's Semantics , 1973 .

[18]  J.F.A.K. van Benthem,et al.  Modal logic and classical logic , 1983 .

[19]  Mads Dam.  CTL* and ECTL* as Fragments of the Modal mu-Calculus , 1994, Theor. Comput. Sci..

[20]  J. Cheney,et al.  A sequent calculus for nominal logic , 2004, LICS 2004.

[21]  Robert Goldblatt,et al.  On canonical modal logics that are not elementarily determined , 2003 .

[22]  Yasuo Kawahara,et al.  A small final coalgebra theorem , 1994, Theor. Comput. Sci..

[23]  Edmund M. Clarke,et al.  Characterizing Correctness Properties of Parallel Programs Using Fixpoints , 1980, ICALP.

[24]  Max J. Cresswell,et al.  An incomplete decidable modal logic , 1984, Journal of Symbolic Logic.

[25]  C. J. Everett,et al.  Projective Algebra I , 1946 .

[26]  Dov M. Gabbay,et al.  Investigations in modal and tense logics with applications to problems in philosophy and linguistics , 1976 .

[27]  Hirokazu Nishimura.  Descriptively complete process logic , 2004, Acta Informatica.

[28]  Christopher Menzel,et al.  Logic and Reality: Essays on the Legacy of Arthur Prior , 2000 .

[29]  G. Birkhoff,et al.  On the Structure of Abstract Algebras , 1935 .

[30]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[31]  Robert Goldblatt,et al.  Erdös graphs resolve Fine's canonicity problem , 2004, Bull. Symb. Log..

[32]  Amir Pnueli,et al.  Propositional Dynamic Logic of Nonregular Programs , 1983, J. Comput. Syst. Sci..

[33]  Richard E. Ladner,et al.  Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..

[34]  Vaughan R. Pratt,et al.  A Near-Optimal Method for Reasoning about Action , 1980, J. Comput. Syst. Sci..

[35]  J. C. C. McKinsey.  On the Syntactical Construction of Systems of Modal Logic , 1945, J. Symb. Log..

[36]  G. Birkhoff,et al.  On the combination of subalgebras , 1933, Mathematical Proceedings of the Cambridge Philosophical Society.

[37]  Saharon Shelah,et al.  On the temporal analysis of fairness , 1980, POPL '80.

[38]  S. Kanger.  Proceedings of the third Scandinavian Logic Symposium , 1975 .

[39]  D. Makinson.  On Some Completeness Theorems in Modal Logic , 1966 .

[40]  Mark Reynolds,et al.  An axiomatization of full Computation Tree Logic , 2001, Journal of Symbolic Logic.

[41]  R. Lyndon.  THE REPRESENTATION OF RELATIONAL ALGEBRAS , 1950 .

[42]  Raymond Klibansky,et al.  Contemporary Philosophy. A Survey , 1968 .

[43]  Willem J. Blok,et al.  The lattice of modal logics: an algebraic investigation , 1980, Journal of Symbolic Logic.

[44]  Dagfinn Føllesdal.  Stig kanger in memoriam , 1995 .

[45]  Robert Goldblatt.  Solution to a completeness problem of Lemmon and Scott , 1975, Notre Dame J. Formal Log..

[46]  Rudolf Carnap.  Modalities and Quantification , 1946, J. Symb. Log..

[47]  Vaughan R. Pratt,et al.  Application of modal logic to programming , 1980 .

[48]  George Edward Hughes,et al.  Every world can see a reflexive world , 1990, Stud Logica.

[49]  Johan van Benthem.  A Note on Modal Formulae and Relational Properties , 1975, J. Symb. Log..

[50]  Steven K. Thomason,et al.  Reduction of second-order logic to modal logic , 1975, Math. Log. Q..

[51]  Valentin B. Shehtman,et al.  Modal logics of domains on the real plane , 1983 .

[52]  Richard E. Ladner,et al.  Propositional modal logic of programs , 1977, STOC '77.

[53]  Hugh MacColl.  Symbolic logic and its applications , 1906 .

[54]  M. Rabin.  Decidability of second-order theories and automata on infinite trees. , 1969 .

[55]  Peter Øhrstrøm,et al.  The Flow of Time into Logic - and Computer Science (Column: Logic in Computer Science) , 2004, Bull. EATCS.

[56]  Alexander Kurz.  Specifying coalgebras with modal logic , 2001, Theor. Comput. Sci..

[57]  A. Tarski.  Contributions to the theory of models. III , 1954 .

[58]  George Boole,et al.  An Investigation of the Laws of Thought: Frontmatter , 2009 .

[59]  Pierre Wolper.  Temporal Logic Can Be More Expressive , 1983, Inf. Control..

[60]  K. Fine.  Some Connections Between Elementary and Modal Logic , 1975 .

[61]  J. Benthem.  Some kinds of modal completeness , 1980 .

[62]  Boleslaw Sobocinski.  Remarks about axiomatizations of certain modal systems , 1964, Notre Dame J. Formal Log..

[63]  Kosta Dosen,et al.  Duality between modal algebras and neighbourhood frames , 1989, Stud Logica.

[64]  Jaakko Hintikka.  Kanger Stig. The Morning Star Paradox. Theoria (Lund), vol. 23 (1957), pp. 1–11. Kanger Stig. A note on quantification and modalities. Theoria (Lund), vol. 23 (1957), pp. 133–134. , 1969 .

[65]  Hans-Jörg Schek,et al.  Object Orientation with Parallelism and Persistence , 1996 .

[66]  Steven K. Thomason.  Reduction of Tense Logic to Modal Logic. I , 1974, J. Symb. Log..

[67]  A. Tarski.  Der Aussagenkalkül und die Topologie , 1938 .

[68]  Amir Pnueli.  The Temporal Semantics of Concurrent Programs , 1981, Theor. Comput. Sci..

[69]  Bjarni Jónsson,et al.  On the canonicity of Sahlqvist identities , 1994, Stud Logica.

[70]  Alasdair Urquhart,et al.  Decidability and the finite model property , 1981, J. Philos. Log..

[71]  Krister Segerberg,et al.  An Introduction to Modal Logic , 1977 .

[72]  Martin Gerson.  The Inadequacy of the Neighbourhood Semantics for Modal Logic , 1975, J. Symb. Log..

[73]  Alfred Tarski,et al.  Some theorems about the sentential calculi of Lewis and Heyting , 1948, The Journal of Symbolic Logic.

[74]  A. Tarski,et al.  Boolean Algebras with Operators. Part I , 1951 .

[75]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[76]  Michael J. Loux.  The Possible and the actual : readings in the metaphysics of modality , 1979 .

[77]  S. K. Thomason,et al.  AXIOMATIC CLASSES IN PROPOSITIONAL MODAL LOGIC , 1975 .

[78]  Günter Asser,et al.  Zeitschrift für mathematische Logik und Grundlagen der Mathematik , 1955 .

[79]  Alonzo Church,et al.  Review: Atwell R. Turquette, Godel and the Synthetic a Priori , 1950 .

[80]  Benson Mates,et al.  The Philosophy of Leibniz , 1986 .

[81]  Kit Fine,et al.  An incomplete logic containing S4 , 1974 .

[82]  M. Kracht.  Tools and Techniques in Modal Logic , 1999 .

[83]  Rohit Parikh,et al.  A Decision Procedure for the Propositional µ-Calculus , 1983, Logic of Programs.

[84]  Horst Reichel,et al.  An approach to object semantics based on terminal co-algebras , 1995, Mathematical Structures in Computer Science.

[85]  Colin Stirling,et al.  Modal and temporal logics , 1993, LICS 1993.

[86]  Peter Aczel,et al.  The Russell–Prawitz modality , 2001, Mathematical Structures in Computer Science.

[87]  Colin Stirling,et al.  Modal Logics for Communicating Systems , 1987, Theor. Comput. Sci..

[88]  Vaughan R. Pratt,et al.  SEMANTICAL CONSIDERATIONS ON FLOYD-HOARE LOGIC , 1976, FOCS 1976.

[89]  E. J. Lemmon,et al.  New foundations for Lewis modal systems , 1957, Journal of Symbolic Logic.

[90]  J JonghdeD.H.,et al.  Beth's Nonclassical Valuations , 1998 .

[91]  R. McKenzie.  Equational bases and nonmodular lattice varieties , 1972 .

[92]  Max J. Cresswell,et al.  Logics and languages , 1973 .

[93]  F. R. A. Hopgood,et al.  Machine Intelligence 5 , 1971, The Mathematical Gazette.

[94]  David Harel,et al.  Process logic: Expressiveness, decidability, completeness , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[95]  Martin Serastian Gerson.  An extension of S4 complete for the neighbourhood semantics but incomplete for the relational semantics , 1975 .

[96]  Giovanni Sambin,et al.  A new proof of Sahlqvist's theorem on modal definability and completeness , 1989, Journal of Symbolic Logic.

[97]  R. Goldblatt.  Elementary generation and canonicity for varieties of Boolean algebras with operators , 1995 .

[98]  Krister Segerberg,et al.  An essay in classical modal logic , 1971 .

[99]  Alfred Tarski,et al.  Relational selves as self-affirmational resources , 2008 .

[100]  Alfred Tarski,et al.  Logic, Semantics, Metamathematics: Papers from 1923 to 1938 , 1958 .

[101]  Leon Henkin,et al.  The completeness of the first-order functional calculus , 1949, Journal of Symbolic Logic.

[102]  Colin Stirling,et al.  Modal Logics and mu-Calculi: An Introduction , 2001, Handbook of Process Algebra.

[103]  Oskar Becker.  Zur Logik der Modalitäten , 1930 .

[104]  Alfred Tarski.  A Remark on Functionally Free Algebras , 1946 .

[105]  Haskell B. Curry,et al.  The elimination theorem when modality is present , 1952, Journal of Symbolic Logic.

[106]  C. A. R. Hoare,et al.  An axiomatic basis for computer programming , 1969, CACM.

[107]  M. Stone.  Topological representations of distributive lattices and Brouwerian logics , 1938 .

[108]  Stephen Read,et al.  Hugh Maccoll and the algebra of strict implication , 1998 .

[109]  Nick Benton,et al.  Computational types from a logical perspective , 1998, Journal of Functional Programming.

[110]  Michael Mendler,et al.  An Intuitionistic Modal Logic with Applications to the Formal Verification of Hardware , 1994, CSL.

[111]  S. Lane.  Categories for the Working Mathematician , 1971 .

[112]  David Kaplan.  Saul A. Kripke. Semantical analysis of modal logic I. Normal modal propositional calculi. Zeitschrift für mathematische Logik und Grundlagen der Mathematik , vol. 9 (1963), pp. 67–96. , 1966 .

[113]  C. Lewis.  IV.—IMPLICATION AND THE ALGEBRA OF LOGIC , 1912 .

[114]  A. Tarski,et al.  The Algebra of Topology , 1944 .

[115]  Robin Milner,et al.  Modal Logics for Mobile Processes , 1991, Theor. Comput. Sci..

[116]  R. A. Bull.  An Algebraic Study of Tense Logics with Linear Time , 1968, J. Symb. Log..

[117]  J. Bergstra,et al.  Handbook of Process Algebra , 2001 .

[118]  A. N. Prior,et al.  Modality and quantification in S5 , 1956, Journal of Symbolic Logic (JSL).

[119]  Dov M. Gabbay.  On decidable, finitely axiomatizable, modal and tense logics without the finite model property Part II , 1971 .

[120]  Saul A. Kripke,et al.  Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi , 1963 .

[121]  G. Birkhoff.  Subdirect unions in universal algebra , 1944 .

[122]  Dexter Kozen,et al.  A finite model theorem for the propositional μ-calculus , 1988, Stud Logica.

[123]  Bart Jacobs,et al.  Towards a Duality Result in Coalgebraic Modal Logic , 2000, CMCS.

[124]  Robert Ian Goldblatt,et al.  Grothendieck Topology as Geometric Modality , 1981, Math. Log. Q..

[125]  A. Prior.  Tense-logic and the continuity of time , 1962 .

[126]  Edward V. Huntington.  Postulates for Assertion, Conjunction, Negation, and Equality , 1937 .

[127]  I. H. Öğüş,et al.  NATO ASI Series , 1997 .

[128]  Robert Goldblatt,et al.  Algebraic Polymodal Logic: A Survey , 2000, Log. J. IGPL.

[129]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[130]  Glynn Winskel,et al.  On Powerdomains and Modality , 1985, Theor. Comput. Sci..

[131]  Leon Henkin,et al.  Completeness in the theory of types , 1950, Journal of Symbolic Logic.

[132]  Evert W. Beth,et al.  Semantic Entailment And Formal Derivability , 1955 .

[133]  R. Goldblatt.  Mathematics of modality , 1993 .

[134]  M. Tierney.  Sheaf theory and the continuum hypothesis , 1972 .

[135]  George Boolos,et al.  An incomplete system of modal logic , 1985, J. Philos. Log..

[136]  Steven K. Thomason,et al.  Semantic analysis of tense logics , 1972, Journal of Symbolic Logic.

[137]  K. Fine,et al.  Worlds, times and selves , 1977 .

[138]  Peter Aczel,et al.  Non-well-founded sets , 1988, CSLI lecture notes series.

[139]  R. A. Bull.  That All Normal Extensions of S4.3 Have the Finite Model Property , 1966 .

[140]  Martin Gerson.  A Neighbourhood Frame for T with No Equivalent Relational Frame , 1976, Math. Log. Q..

[141]  Thomas Drucker,et al.  Perspectives on the history of mathematical logic , 1991 .

[142]  Chen C. Chang,et al.  Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

[143]  Yde Venema,et al.  The preservation of Sahlqvist equations in completions of Boolean algebras with operators , 1999 .

[144]  Dexter Kozen,et al.  Results on the Propositional µ-Calculus , 1982, ICALP.

[145]  R. Solovay.  Provability interpretations of modal logic , 1976 .

[146]  Robin Milner,et al.  Calculi for Synchrony and Asynchrony , 1983, Theor. Comput. Sci..

[147]  Bart Jacobs,et al.  Exercises in Coalgebraic Specification , 2000, Algebraic and Coalgebraic Methods in the Mathematics of Program Construction.

[148]  B. Jonnson.  Algebras Whose Congruence Lattices are Distributive. , 1967 .

[149]  David Makinson,et al.  Some embedding theorems for modal logic , 1971, Notre Dame J. Formal Log..

[150]  Max J. Cresswell.  The completeness of S1 and some related systems , 1972, Notre Dame J. Formal Log..

[151]  K. Jon Barwise,et al.  The situation in logic , 1989, CSLI lecture notes series.

[152]  Robert Goldblatt,et al.  First-order definability in modal logic , 1975, Journal of Symbolic Logic.

[153]  Wolfgang Thomas.  Computation tree logic and regular omega-languages , 1988, REX Workshop.

[154]  R. A. Bull.  A NOTE ON THE MODAL CALCULI S 4.2 AND S 4.3 , 1964 .

[155]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[156]  Dana S. Scott,et al.  Advice on Modal Logic , 1970 .

[157]  Saul Kripke,et al.  A completeness theorem in modal logic , 1959, Journal of Symbolic Logic.

[158]  Max J. Cresswell,et al.  A Henkin completeness for T , 1967, Notre Dame J. Formal Log..

[159]  Jaakko Hintikka,et al.  Time And Modality , 1958 .

[160]  Joseph Y. Halpern,et al.  Decision procedures and expressiveness in the temporal logic of branching time , 1982, STOC '82.

[161]  Andrzej Grzegorczyk.  Some relational systems and the associated topological spaces , 1967 .

[162]  Robert Goldblatt,et al.  Equational Logic of Polynomial Coalgebras , 2002, Advances in Modal Logic.

[163]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic , 1981, Logic of Programs.

[164]  Robert Goldblatt,et al.  Observational ultraproducts of polynomial coalgebras , 2003, Ann. Pure Appl. Log..

[165]  E. Allen Emerson,et al.  The Propositional Mu-Calculus is Elementary , 1984, ICALP.

[166]  C. Lewis,et al.  A Survey Of Symbolic Logic , 1920 .

[167]  J. N. Crossley,et al.  Formal Systems and Recursive Functions , 1963 .

[168]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[169]  J.F.A.K. van Benthem.  Modal formulas are either elementary or not ΣΔ-elementary , 1976 .

[170]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[171]  G. Boolos,et al.  Self-Reference and Modal Logic , 1985 .

[172]  Joseph R. Shoenfield,et al.  Mathematical logic , 1967 .

[173]  Albert R. Meyer,et al.  WEAK MONADIC SECOND ORDER THEORY OF SUCCESSOR IS NOT ELEMENTARY-RECURSIVE , 1973 .

[174]  Jerzy Tiuryn,et al.  Dynamic logic , 2001, SIGA.

[175]  J.F.A.K. van Benthem,et al.  Modal Correspondence Theory , 1977 .

[176]  A. Tarski,et al.  Boolean Algebras with Operators , 1952 .

[177]  P. Bernays,et al.  Grundlagen der Mathematik , 1934 .

[178]  Joseph Y. Halpern,et al.  A Guide to the Modal Logics of Knowledge and Belief: Preliminary Draft , 1985, IJCAI.

[179]  D. Gabbay,et al.  Handbook of Philosophical Logic, Volume II. Extensions of Classical Logic , 1986 .

[180]  Peter Aczel,et al.  A Final Coalgebra Theorem , 1989, Category Theory and Computer Science.

[181]  William Kneale,et al.  The development of logic , 1963 .

[182]  A Bayart.  Correction de la logique modale du permier et du second ordre S5 , 1958 .

[183]  Matthew Hennessy,et al.  A modal logic for message passing processes , 1995 .

[184]  Igor Walukiewicz,et al.  Completeness of Kozen's axiomatisation of the propositional /spl mu/-calculus , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[185]  Chandler Davis.  Modal Operators, Equivalence Relations, and Projective Algebras , 1954 .

[186]  B. Jack Copeland,et al.  The Genesis of Possible Worlds Semantics , 2002, J. Philos. Log..

[187]  Bart Jacobs,et al.  Many-Sorted Coalgebraic Modal Logic: a Model-theoretic Study , 2001, RAIRO Theor. Informatics Appl..

[188]  A. Tarski,et al.  On Closed Elements in Closure Algebras , 1946 .

[189]  R. A. Bull.  Note on a Paper in Tense Logic , 1969, J. Symb. Log..

[190]  Richard Montague.  Logical necessity, physical necessity, ethics, and quantifiers , 1960 .

[191]  Michael Zakharyaschev,et al.  Advances in Modal Logic, Volume 4 , 2002 .

[192]  Henrik Sahlqvist.  Completeness and Correspondence in the First and Second Order Semantics for Modal Logic , 1975 .

[193]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

[194]  R. Harrop.  On the existence of finite models and decision procedures for propositional calculi , 1958, Mathematical Proceedings of the Cambridge Philosophical Society.

[195]  Robert Goldblatt,et al.  Varieties of Complex Algebras , 1989, Ann. Pure Appl. Log..

[196]  E. Allen Emerson,et al.  An Automata Theoretic Decision Procedure for the Propositional Mu-Calculus , 1989, Inf. Comput..

[197]  M. Stone.  The theory of representations for Boolean algebras , 1936 .

[198]  David Kaplan.  Review: Saul A. Kripke, Semantical Analysis of Modal Logic I. Normal Modal Propositional Calculi , 1966 .

[199]  G. Boolos.  The logic of provability , 1993 .

[200]  Alasdair Urquhart,et al.  Temporal Logic , 1971 .

[201]  David Harel,et al.  First-Order Dynamic Logic , 1979, Lecture Notes in Computer Science.

[202]  Joseph Y. Halpern,et al.  “Sometimes” and “not never” revisited: on branching versus linear time temporal logic , 1986, JACM.

[203]  K. Gödel.  Fiktionen in der Mathematik , 1931 .

[204]  Eugenio Moggi,et al.  Notions of Computation and Monads , 1991, Inf. Comput..

[205]  Bjarni Jónsson,et al.  A Survey of Boolean Algebras with Operators , 1993 .

[206]  Martin Rößiger,et al.  Coalgebras and Modal Logic , 2000, CMCS.

[207]  Mordechai Ben-Ari,et al.  The temporal logic of branching time , 1981, POPL '81.

[208]  K. Lambert.  Philosophical Problems in Logic , 1970 .

[209]  S. Korner,et al.  The philosophy of mathematics , 1960 .

[210]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[211]  Tang Tsao-Chen.  Algebraic postulates and a geometric interpretation for the Lewis calculus of strict implication , 1938 .

[212]  Jan van Leeuwen,et al.  Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics , 1994 .

[213]  Vaughan R. Pratt,et al.  A decidable mu-calculus: Preliminary report , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[214]  Robert S. Streett,et al.  Propositional Dynamic Logic of Looping and Converse Is Elementarily Decidable , 1982, Inf. Control..

[215]  Jerzy Tiuryn,et al.  Logics of Programs , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[216]  Michael Dummett,et al.  Modal Logics Between S4 and S5 , 1967 .

[217]  Patrick Suppes,et al.  Logic, Methodology and Philosophy of Science , 1963 .

[218]  Robert Goldblatt,et al.  Quasi-Modal Equivalence of Canonical Structures , 2001, Journal of Symbolic Logic.

[219]  Robert Goldblatt,et al.  What is the coalgebraic analogue of Birkhoff's variety theorem? , 2001, Theor. Comput. Sci..

[220]  R. A. Bull,et al.  An algebraic study of Diodorean modal systems , 1965, Journal of Symbolic Logic.

[221]  A. S. Troelstra,et al.  On the connection of partially ordered sets with some pseudo-Boolean algebras , 1966 .

[222]  Rudolf Carnap,et al.  Meaning and Necessity , 1947 .

[223]  Rohit Parikh,et al.  The Completeness of Propositional Dynamic Logic , 1978, MFCS.

[224]  Max J. Cresswell,et al.  A New Introduction to Modal Logic , 1998 .

[225]  Jan van Leeuwen,et al.  Formal models and semantics , 1990 .

[226]  Bart Jacobs,et al.  Objects and Classes, Co-Algebraically , 1995, Object Orientation with Parallelism and Persistence.

[227]  R. L. Goodstein,et al.  Provability in logic , 1959 .

[228]  W. V. Quine,et al.  The problem of interpreting modal logic , 1947, Journal of Symbolic Logic.

[229]  J. Heijenoort.  From Frege to Gödel: A Source Book in Mathematical Logic, 1879-1931 , 1967 .

[230]  S. K. Thomason,et al.  The logical consequence relation of propositional tense logic , 1975, Math. Log. Q..

[231]  Rohit Parikh.  A decidability result for a second order process logic , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[232]  D.H.J. de Jongh,et al.  The logic of the provability , 1998 .

[233]  Robert Goldblatt,et al.  ENLARGEMENTS OF POLYNOMIAL COALGEBRAS , 2003 .

[234]  Jan J. M. M. Rutten,et al.  On the Foundation of Final Semantics: Non-Standard Sets, Metric Spaces, Partial Orders , 1992, REX Workshop.

[235]  K. Segerberg.  A completeness theorem in the modal logic of programs , 1982 .

[236]  J. Rutten.  A calculus of transition systems (towards universal coalgebra) , 1995 .

[237]  Kim G. Larsen,et al.  Proof Systems for Satisfiability in Hennessy-Milner Logic with Recursion , 1990, Theor. Comput. Sci..

[238]  M. de Rijke,et al.  Sahlqvist's theorem for boolean algebras with operators with an application to cylindric algebras , 1995, Stud Logica.

[239]  J. M. Bocheński,et al.  A history of formal logic , 1961 .

[240]  Jan J. M. M. Rutten,et al.  Universal coalgebra: a theory of systems , 2000, Theor. Comput. Sci..

[241]  J. C. C. McKinsey,et al.  A Solution of the Decision Problem for the Lewis systems S2 and S4, with an Application to Topology , 1941, J. Symb. Log..

[242]  Robert Goldblatt.  The McKinsey Axiom Is Not Canonical , 1991, J. Symb. Log..

[243]  Joseph Y. Halpern,et al.  A Guide to Completeness and Complexity for Modal Logics of Knowledge and Belief , 1992, Artif. Intell..

[244]  Jaakko Hintikka.  Review: Stig Kanger, The Morning Star Paradox; Stig Kanger, A Note on Quantification and Modalities , 1969 .

[245]  Igor Walukiewicz,et al.  Completeness of Kozen's Axiomatisation of the Propositional µ-Calculus , 2000, Inf. Comput..

[246]  Robert Goldblatt.  Diodorean modality in Minkowski spacetime , 1980 .

[247]  Arthur N. Prior,et al.  The Syntax of Time-Distinctions , 2015 .

[248]  Edmund Husserl,et al.  Jahrbuch für Philosophie und Phänomenologische Forschung , 1913 .

[249]  Richard E. Ladner,et al.  The Computational Complexity of Provability in Systems of Modal Propositional Logic , 1977, SIAM J. Comput..

[250]  M. H. Lob,et al.  Solution of a Problem of Leon Henkin , 1955, J. Symb. Log..

[251]  Qiu Yu Hui,et al.  Proceedings of the 7th and 8th Asian Logic Conferences , 2003 .

[252]  George Boolos,et al.  Provability: the emergence of a mathematical modality , 1991, Stud Logica.

[253]  Donald Sidney Macnab.  An algebraic study of modal operators on Heyting algebras with applications to topology and sheafification , 1976 .

[254]  Haskell B. Curry,et al.  A Theory Of Formal Deducibility , 1950 .

[255]  Kit Fine,et al.  The Logics Containing S 4.3 , 1971 .

[256]  Saul A. Kripke,et al.  Semantical Analysis of Intuitionistic Logic I , 1965 .

[257]  S. K. Thomason,et al.  An incompleteness theorem in modal logic , 1974 .

[258]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[259]  Joseph Y. Halpern,et al.  Decision procedures and expressiveness in the temporal logic of branching time , 1982, STOC '82.

[260]  Vaughan R. Pratt,et al.  Process logic: preliminary report , 1979, POPL.

[261]  Alex K. Simpson,et al.  The proof theory and semantics of intuitionistic modal logic , 1994 .

[262]  Dov M. Gabbay,et al.  Temporal logic (vol. 1): mathematical foundations and computational aspects , 1994 .

[263]  Martin Rößiger.  From modal logic to terminal coalgebras , 2001 .

[264]  Joseph Y. Halpern,et al.  "Sometimes" and "not never" revisited: on branching versus linear time (preliminary report) , 1983, POPL '83.

[265]  J. Czelakowski.  Reduced products of logical matrices , 1980 .

[266]  Richard Montague,et al.  Pragmatics and intensional logic , 1970, Synthese.

[267]  David Makinson,et al.  A normal modal calculus between T and S4 without the finite model property , 1969, Journal of Symbolic Logic.

[268]  E. Allen Emerson,et al.  The Complexity of Tree Automata and Logics of Programs , 1999, SIAM J. Comput..

[269]  James Dugundji.  Note on a Property of Matrices for Lewis and Langford's Calculi of Propositions , 1940, J. Symb. Log..

[270]  E. J. Lemmon,et al.  Algebraic semantics for modal logics I , 1966, Journal of Symbolic Logic (JSL).

[271]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[272]  E. Allen Emerson,et al.  The complexity of tree automata and logics of programs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[273]  Steven K. Thomason,et al.  Noncompactness in propositional modal logic , 1972, Journal of Symbolic Logic.

[274]  E. Lemmon,et al.  Modal Logics Between S 4 and S 5 , 1959 .

[275]  Maarten Marx,et al.  Multi-dimensional modal logic , 1997, Applied logic series.

[276]  W. Blok.  On the degree of incompleteness of modal logics and the covering relation in the lattice of modal logics , 1978 .

[277]  R. Goldblatt.  Metamathematics of modal logic , 1974, Bulletin of the Australian Mathematical Society.

[278]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[279]  Steven K. Thomason.  Categories of Frames for Modal Logic , 1975, J. Symb. Log..

[280]  D. Macnab.  Modal operators on Heyting algebras , 1981 .

[281]  Richmond H. Thomason,et al.  Formal Philosophy; Selected Papers , 1979 .