An Algebraic Toolkit

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

[2]  A. P. Sistla,et al.  The complexity of propositional linear temporal logics , 1985, JACM.

[3]  Pierpaolo Battigalli,et al.  Recent results on belief, knowledge and the epistemic foundations of game theory , 1999 .

[4]  W. Rautenberg.  Der Verband der normalen verzweigten Modallogiken , 1977 .

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

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

[7]  Patrick Blackburn,et al.  Internalizing labelled deduction , 2000, J. Log. Comput..

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

[9]  William Craig,et al.  On axiomatizability within a system , 1953, Journal of Symbolic Logic.

[10]  B. Jónsson.  Varieties of relation algebras , 1982 .

[11]  K. Fine.  Logics containing K4. Part II , 1985, Journal of Symbolic Logic.

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

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

[14]  Joseph Y. Halpern,et al.  Asymptotic conditional probabilities: The non-unary case , 1996, Journal of Symbolic Logic.

[15]  Ming Xu.  On some U,S-tense logics , 1988, J. Philos. Log..

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

[17]  Michael Zakharyaschev,et al.  Canonical formulas for K4. Part I: Basic results , 1992, Journal of Symbolic Logic.

[18]  Phokion G. Kolaitis,et al.  On the Decision Problem for Two-Variable First-Order Logic , 1997, Bulletin of Symbolic Logic.

[19]  Joseph Y. Halpern,et al.  Asymptotic Conditional Probabilities: The Unary Case , 1996, SIAM J. Comput..

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

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

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

[23]  Mark Reynolds,et al.  A Decidable Temporal Logic of Parallelism , 1997, Notre Dame J. Formal Log..

[24]  Johan van Benthem,et al.  A ModalWalk Through Space , 2002, J. Appl. Non Class. Logics.

[25]  Frank Wolter,et al.  Tense Logic Without Tense Operators , 1996, Math. Log. Q..

[26]  Bernhard Herwig.  Extending partial isomorphisms on finite structures , 1995, Comb..

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

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

[29]  Rohit Parikh,et al.  An Elementary Proof of the Completness of PDL , 1981, Theor. Comput. Sci..

[30]  Ildikó Sain,et al.  Is “some-other-time” sometimes better than “sometime” for proving partial correctness of programs? , 1988, Stud Logica.

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

[32]  M. V. Zakhar'yashchev.  Syntax and semantics of modal logics containing S4 , 1988 .

[33]  Patrick Blackburn,et al.  Nominal Tense Logic , 1992, Notre Dame J. Formal Log..

[34]  M. de Rijke,et al.  Expressiveness of Concept Expressions in First-Order Description Logics , 1999, Artif. Intell..

[35]  R. Robinson.  Undecidability and nonperiodicity for tilings of the plane , 1971 .

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

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

[38]  Functional Translation and Second-Order Frame Properties of Modal Logics , 1997, J. Log. Comput..

[39]  Shahid Rahman.  Hugh maccoll: eine bibliographische erschließung seiner hauptwerke und notizen zu ihrer rezeptionsgeschichte , 1997 .

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

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

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

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

[44]  Ian M. Hodkinson,et al.  Atom Structures of Cylindric Algebras and Relation Algebras , 1997, Ann. Pure Appl. Log..

[45]  Patrick Blackburn,et al.  Tense, Temporal Reference, and Tense Logic , 1994, J. Semant..

[46]  Luis Fariñas del Cerro,et al.  Modal Logics for Incidence Geometries , 1997, J. Log. Comput..

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

[48]  Yde Venema.  Cylindric modal logic , 1993 .

[49]  Frank Wolter.  The product of converse PDL and polymodal K , 2000, J. Log. Comput..

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

[51]  He Jifeng.  Process simulation and refinement , 1989 .

[52]  David Harel,et al.  Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness , 1986, JACM.

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

[54]  David Kaplan,et al.  On the logic of demonstratives , 1979, J. Philos. Log..

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

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

[57]  Tinko Tinchev,et al.  PDL with Data Constants , 1985, Inf. Process. Lett..

[58]  Beata Konikowska,et al.  A Logic for Reasoning about Relative Similarity , 1997, Stud Logica.

[59]  Edith Hemaspaandra,et al.  A modal perspective on the computational complexity of attribute value grammar , 1993, J. Log. Lang. Inf..

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

[61]  Y. Venema.  Atom structures and Sahlqvist equations , 1997 .

[62]  A. Nakamura,et al.  On the size of refutation Kripke models for some linear modal and tense logics , 1980 .

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

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

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

[66]  Maarten de Rijke.  The logic of Peirce algebras , 1995, J. Log. Lang. Inf..

[67]  Frank Wolter,et al.  The Structure of Lattices of Subframe Logics , 1997, Ann. Pure Appl. Log..

[68]  Ian M. Hodkinson,et al.  Step by step – Building representations in algebraic logic , 1997, Journal of Symbolic Logic.

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

[70]  Bogdan S. Chlebus.  Domino-Tiling Games , 1986, J. Comput. Syst. Sci..

[71]  M. Gehrke,et al.  Bounded Lattice Expansions , 2001 .

[72]  Mamoru Kaneko,et al.  Game logic and its applications I , 1996, Stud Logica.

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

[74]  John Doner,et al.  Tree Acceptors and Some of Their Applications , 1970, J. Comput. Syst. Sci..

[75]  Lawrence S. Moss,et al.  Modal Correspondence for Models , 1998, J. Philos. Log..

[76]  Hajnal Andréka,et al.  Complexity of Equations Valid in Algebras of Relations: Part I: Strong Non-Finitizability , 1997, Ann. Pure Appl. Log..

[77]  Peter Gärdenfors,et al.  On the logic of theory change: Partial meet contraction and revision functions , 1985, Journal of Symbolic Logic.

[78]  L. Maksimova.  Pretabular extensions of LewisS4 , 1975 .

[79]  A. Ehrenfeucht.  An application of games to the completeness problem for formalized theories , 1961 .

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

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

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

[83]  Yde Venema,et al.  Derivation rules as anti-axioms in modal logic , 1993, Journal of Symbolic Logic.

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

[85]  M. de Rijke,et al.  A System of Dynamic Modal Logic , 1998, J. Philos. Log..

[86]  István Németi,et al.  Algebraization of quantifier logics, an introductory overview , 1991, Stud Logica.

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

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

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

[90]  Marcus Kracht,et al.  Simulation and Transfer Results in Modal Logic – A Survey , 1997, Stud Logica.

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

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

[93]  Valentin Goranko,et al.  Modal Definability in Enriched Languages , 1989, Notre Dame J. Formal Log..

[94]  Silvio Ghilardi,et al.  Constructive Canonicity in Non-Classical Logics , 1997, Ann. Pure Appl. Log..

[95]  Pierre Wolper,et al.  Automata theoretic techniques for modal logics of programs: (Extended abstract) , 1984, STOC '84.

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

[97]  Joseph Y. Halpern.  The Effect of Bounding the Number of Primitive Propositions and the Depth of Nesting on the Complexity of Modal Logic , 1995, Artif. Intell..

[98]  Werner Nutt,et al.  The Complexity of Concept Languages , 1997, KR.

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

[100]  D. Gabbay.  On decidable, finitely axiomatizable, modal and tense logics without the finite model property Part I , 1971 .

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

[102]  D. Monk.  On representable relation algebras. , 1964 .

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

[104]  Marcelo Finger.  Handling database updates in two-dimensional temporal logic , 1992, J. Appl. Non Class. Logics.

[105]  B. Mayoh.  Review: A. A. Markov, B. van Rootselaar, J. F. Staal, An Approach to Constructive Mathematical Logic , 1975 .

[106]  Jelle Gerbrandy,et al.  Reasoning about Information Change , 1997, J. Log. Lang. Inf..

[107]  Joseph Y. Halpern,et al.  Modeling Belief in Dynamic Systems, Part I: Foundations , 1997, Artif. Intell..

[108]  Krister Segerberg,et al.  Proposal for a Theory of Belief Revision Along the Lines of Lindström and Rabinowicz , 1997, Fundam. Informaticae.

[109]  John P. Burgess,et al.  The decision problem for linear temporal logic , 1985, Notre Dame J. Formal Log..

[110]  Dov M. Gabbay,et al.  An Axiomitization of the Temporal Logic with Until and Since over the Real Numbers , 1990, J. Log. Comput..

[111]  Robert Goldblatt,et al.  Semantic analysis of orthologic , 1974, J. Philos. Log..

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

[113]  Nicholas R. Jennings,et al.  Intelligent agents: theory and practice , 1995, The Knowledge Engineering Review.

[114]  Marcus Kracht,et al.  Splittings and the finite model property , 1991, Journal of Symbolic Logic.

[115]  J. Burgess.  Decidability for branching time , 1980 .

[116]  Valentin Goranko,et al.  Modal logic with names , 1993, J. Philos. Log..

[117]  L. Maksimova.  Interpolation theorems in modal logics and amalgamable varieties of topological Boolean algebras , 1979 .

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

[119]  Giovanni Sambin,et al.  Topology and duality in modal logic , 1988, Ann. Pure Appl. Log..

[120]  Bruce M. Kapron,et al.  Zero-One Laws for Modal Logic , 1994, Ann. Pure Appl. Log..

[121]  John P. Burgess,et al.  Axioms for tense logic. II. Time periods , 1982, Notre Dame J. Formal Log..

[122]  Frederic Brenton Fitch.  A correlation between modal reduction principles and properties of relations , 1973, J. Philos. Log..

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

[124]  Yde Venema,et al.  Points, Lines and Diamonds: A two-sorted Modal Logic for Projective Planes , 1999, J. Log. Comput..

[125]  Frank Wolter,et al.  Completeness and decidability of tense logics closely related to logics above K4 , 1997, Journal of Symbolic Logic.

[126]  Marcus Kracht,et al.  Even more about the lattice of tense logics , 1992, Arch. Math. Log..

[127]  Valentin Goranko,et al.  Hierarchies of modal and temporal logics with reference pointers , 1996, J. Log. Lang. Inf..

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