Modal logic: a semantic perspective

[1]  Stig Kanger,et al.  The Morning Star Paradox , 2008 .

[2]  J.F.A.K. van Benthem,et al.  Two Simple Incomplete Modal Logics , 2008 .

[3]  Per Lindström,et al.  On Extensions of Elementary Logic , 2008 .

[4]  Kit Fine,et al.  Propositional quantifiers in modal logic1 , 2008 .

[5]  David Makinson,et al.  A generalisation of the concept of a relational model for modal logic1 , 2008 .

[6]  Johan van Benthem,et al.  Minimal predicates, fixed-points, and definability , 2005, Journal of Symbolic Logic.

[7]  Dmitry Sustretov,et al.  Hybrid Definability in Topological Spaces , 2005 .

[8]  James Cheney,et al.  A sequent calculus for nominal logic , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[9]  Agostino Dovier,et al.  An efficient algorithm for computing bisimulation equivalence , 2004, Theor. Comput. Sci..

[10]  Holger Sturm,et al.  The true bisimulations for 'since' and 'until' , 2004 .

[11]  Maarten Marx,et al.  Repairing the interpolation theorem in quantified modal logic , 2003, Ann. Pure Appl. Log..

[12]  Johan van Benthem,et al.  Reasoning About Space: The Modal Way , 2003, J. Log. Comput..

[13]  Robert Goldblatt,et al.  Mathematical modal logic: A view of its evolution , 2003, J. Appl. Log..

[14]  Ian M. Hodkinson,et al.  Finite conformal hypergraph covers and Gaifman cliques in finite structures , 2003, Bull. Symb. Log..

[15]  Maarten Marx,et al.  Constructive interpolation in hybrid logic , 2003, Journal of Symbolic Logic.

[16]  M. de Rijke,et al.  Advances in Modal Logic , Volume 3 , 2004 .

[17]  Maarten Marx,et al.  Tableaux for Quantified Hybrid Logic , 2002, TABLEAUX.

[18]  Maarten Marx,et al.  Interpolation and Definability in Guarded Fragments , 2002, Stud Logica.

[19]  Ian M. Hodkinson,et al.  Loosely Guarded Fragment of First-Order Logic has the Finite Model Property , 2002, Stud Logica.

[20]  Maarten Marx,et al.  Hybrid logics: characterization, interpolation and complexity , 2001, Journal of Symbolic Logic.

[21]  M. de Rijke,et al.  Modal Logic , 2001, Cambridge Tracts in Theoretical Computer Science.

[22]  Maarten Marx,et al.  Tolerance Logic , 2001, J. Log. Lang. Inf..

[23]  Lionel Ruby,et al.  Logic: An Introduction , 2000 .

[24]  Erich Grädel,et al.  On the Restraining Power of Guards , 1999, Journal of Symbolic Logic.

[25]  Maarten Marx,et al.  Beth Definability for the Guarded Fragment , 1999, LPAR.

[26]  Igor Walukiewicz,et al.  Guarded fixed point logic , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[27]  Johan van Benthem,et al.  Interpolation, preservation, and pebble games , 1999, Journal of Symbolic Logic.

[28]  Ian M. Hodkinson,et al.  Finite algebras of relations are representable on finite sets , 1999, Journal of Symbolic Logic.

[29]  Richard L. Mendelsohn,et al.  First-Order Modal Logic , 1998 .

[30]  Johan van Benthem,et al.  Modal Languages and Bounded Fragments of Predicate Logic , 1998, J. Philos. Log..

[31]  木村 和夫.  Pragmatics , 1997, Language Teaching.

[32]  M. de Rijke,et al.  Bisimulations for Temporal Logic , 1997, J. Log. Lang. Inf..

[33]  Eric Rosen,et al.  Modal Logic over Finite Structures , 1997, J. Log. Lang. Inf..

[34]  A. Dawar.  FINITE MODEL THEORY (Perspectives in Mathematical Logic) , 1997 .

[35]  Johan van Benthem,et al.  Modal Foundations for Predicate Logic , 1997, Log. J. IGPL.

[36]  Maurizio Lenzerini,et al.  TBox and ABox Reasoning in Expressive Description Logics , 1996, KR.

[37]  Igor Walukiewicz,et al.  On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic , 1996, CONCUR.

[38]  Edith Hemaspaandra,et al.  The Price of Universality , 1996, Notre Dame J. Formal Log..

[39]  Pierre-Yves Schobbens,et al.  Counterfactuals and Updates as Inverse Modalities , 1996, J. Log. Lang. Inf..

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

[41]  Max J. Cresswell,et al.  Incompleteness and the Barcan formula , 1995, J. Philos. Log..

[42]  M. de Rijke,et al.  A Lindström theorem for modal logic , 1994 .

[43]  Joseph Y. Halpern,et al.  On the Complexity of Conditional Logics , 1994, KR.

[44]  Dov M. Gabbay,et al.  Handbook of logic in artificial intelligence and logic programming (vol. 1) , 1993 .

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

[46]  M. de Rijke,et al.  The Modal Logic of Inequality , 1992, J. Symb. Log..

[47]  Valentin Goranko,et al.  Using the Universal Modality: Gains and Questions , 1992, J. Log. Comput..

[48]  Lilia Chagrova,et al.  An undecidable problem in correspondence theory , 1991, Journal of Symbolic Logic.

[49]  Marcus Kracht,et al.  Properties of independently axiomatizable bimodal logics , 1991, Journal of Symbolic Logic.

[50]  Tinko Tinchev,et al.  An Essay in Combinatory Dynamic Logic , 1991, Inf. Comput..

[51]  Silvio Ghilardi,et al.  Incompleteness results in Kripke semantics , 1991, Journal of Symbolic Logic.

[52]  Edmund M. Clarke,et al.  Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..

[53]  Moshe Y. Vardi.  On the complexity of epistemic reasoning , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

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

[55]  Joseph Y. Halpern,et al.  The Complexity of Reasoning about Knowledge and Time. I. Lower Bounds , 1989, J. Comput. Syst. Sci..

[56]  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.

[57]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[58]  Robert C. Moore.  A Formal Theory of Knowledge and Action , 1984 .

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

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

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

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

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

[64]  Brian F. Chellas.  Modal Logic: An Introduction , 1980 .

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

[66]  Vaughan R. Pratt,et al.  Models of program logics , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[67]  Kit Fine,et al.  Failures of the interpolation lemma in quantified modal logic , 1979, Journal of Symbolic Logic.

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

[69]  Johan van Benthem,et al.  Canonical Modal Logics and Ultrafilter Extensions , 1979, J. Symb. Log..

[70]  R. Labrecque.  The Correspondence Theory , 1978 .

[71]  Sheldon B. Akers,et al.  Binary Decision Diagrams , 1978, IEEE Transactions on Computers.

[72]  Ashok K. Chandra,et al.  Optimal implementation of conjunctive queries in relational data bases , 1977, STOC '77.

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

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

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

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

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

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

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

[80]  James R. Bell,et al.  A new method for determining linear precedence functions for precedence grammars , 1969, CACM.

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

[82]  Solomon Feferman,et al.  Persistent and invariant formulas relative to theories of higher order , 1966 .

[83]  C. Y. Lee.  Representation of switching circuits by binary-decision programs , 1959 .

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

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

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

[87]  R. L. Goodstein,et al.  An Essay in Modal Logic , 1953, The Mathematical Gazette.

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

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

[90]  Eduardo L. Fermé,et al.  Belief Revision , 2007, Inteligencia Artif..

[91]  Johan van Benthem,et al.  A New Modal Lindström Theorem , 2007, Logica Universalis.

[92]  B. T. Cate,et al.  Model theory for extended modal languages , 2005 .

[93]  D. Holdstock.  Past, present--and future? , 2005, Medicine, conflict, and survival.

[94]  Gilbert Harman,et al.  Semantics of natural language , 2004, Synthese.

[95]  Johan van Benthem,et al.  Reasoning About Space , 2003 .

[96]  J. Benthem,et al.  Logical Patterns in Space , 2002 .

[97]  David I. Beaver,et al.  Words, Proofs and Diagrams , 2002 .

[98]  Dov M. Gabbay,et al.  Handbook of Philosophical Logic , 2002 .

[99]  D. Marker.  Model theory , 2002 .

[100]  David Gabelaia,et al.  Modal definability in topology , 2001 .

[101]  Greg Restall,et al.  An Introduction to Substructural Logics , 2000 .

[102]  Stephan Merz,et al.  Model Checking , 2000 .

[103]  Alexandru Baltag,et al.  STS: A Structural Theory of Sets , 1999, Log. J. IGPL.

[104]  Valentin B. Shehtman,et al.  "Everywhere" and "Here" , 1999, J. Appl. Non Class. Logics.

[105]  J. Benthem.  DYNAMIC BITS AND PIECES , 1997 .

[106]  Samuel R. Buss,et al.  Bounded Arithmetic and Propositional Proof Complexity , 1997 .

[107]  Maarten Marx,et al.  Two-Dimensional Modal Logics , 1997 .

[108]  Moshe Y. Vardi.  Why is Modal Logic So Robustly Decidable? , 1996, Descriptive Complexity and Finite Models.

[109]  Frank Wolter,et al.  Fusions of Modal Logics Revisited , 1996, Advances in Modal Logic.

[110]  J.F.A.K. van Benthem,et al.  Bisimulation: The Never-Ending Story , 1996 .

[111]  Moshe Y. Vardi.  On the Complexity of Bounded-Variable Queries. , 1995, PODS 1995.

[112]  J. Flum,et al.  Finite Automata and Logic: A Microcosm of Finite Model Theory , 1995 .

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

[114]  M. de Rijke.  Extending modal logic , 1993 .

[115]  Yuri Gurevich,et al.  Logic in Computer Science , 1993, Current Trends in Theoretical Computer Science.

[116]  Johan van Benthem,et al.  Modal Frame Classes Revisited , 1993, Fundam. Informaticae.

[117]  Johan van Benthem,et al.  Beyond Accessibility: Functional Models for Modal Logic , 1993 .

[118]  M. de Rijke,et al.  Diamonds and Defaults , 1993 .

[119]  Giovanna Corsi,et al.  Knowledge, belief, and strategic interaction: Semantical aspects of quantified modal logic , 1992 .

[120]  Valentin B. Shehtman,et al.  Semantics of Non-Classical First Order Predicate Logics , 1990 .

[121]  Y. Gurevich.  On Finite Model Theory , 1990 .

[122]  F.J.M.M. Veltman,et al.  Logics for conditionals. , 1985 .

[123]  Robert C. Moore,et al.  Formal Theories of the Commonsense World , 1985 .

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

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

[126]  D. Gabbay.  An Irreflexivity Lemma with Applications to Axiomatizations of Conditions on Tense Frames , 1981 .

[127]  John P. Burgess,et al.  Quick completeness proofs for some logics of conditionals , 1981, Notre Dame J. Formal Log..

[128]  Uwe Mönnich,et al.  Aspects of Philosophical Logic , 1981 .

[129]  Saul A. Kripke,et al.  Naming and Necessity , 1980 .

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

[131]  Richard Atkins,et al.  Vicious circles , 1977, IMRE.

[132]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

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

[134]  D. Nute,et al.  Counterfactuals , 1992 .

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

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

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

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

[139]  Krister Segerberg,et al.  Two-dimensional modal logic , 1973, J. Philos. Log..

[140]  Herbert B. Enderton,et al.  A mathematical introduction to logic , 1972 .

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

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

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

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

[145]  Solomon Feferman,et al.  Persistent and invariant formulas for outer extensions , 1968 .

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

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

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

[149]  Robert L. Berger.  The undecidability of the domino problem , 1966 .

[150]  W. Quine.  The ways of paradox, and other essays , 1966 .

[151]  A. Levy,et al.  A hierarchy of formulas in set theory , 1965 .

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

[153]  J. Hintikka.  Knowledge and belief , 1962 .

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

[155]  W. V. Quine,et al.  Three Grades of Modal Involvment , 1953 .

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

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

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