Switch to: Citations

Add references

You must login to add references.
  1. (1 other version)Modal logic.Yde Venema - 2000 - Philosophical Review 109 (2):286-289.
    Modern modal logic originated as a branch of philosophical logic in which the concepts of necessity and possibility were investigated by means of a pair of dual operators that are added to a propositional or first-order language. The field owes much of its flavor and success to the introduction in the 1950s of the “possible-worlds” semantics in which the modal operators are interpreted via some “accessibility relation” connecting possible worlds. In subsequent years, modal logic has received attention as an attractive (...)
    Download  
     
    Export citation  
     
    Bookmark   147 citations  
  • Cylindric Algebras. Part II.Leon Henkin, J. Donald Monk & Alfred Tarski - 1988 - Journal of Symbolic Logic 53 (2):651-653.
    Download  
     
    Export citation  
     
    Bookmark   43 citations  
  • Many-dimensional modal logics: theory and applications.Dov M. Gabbay (ed.) - 2003 - Boston: Elsevier North Holland.
    Modal logics, originally conceived in philosophy, have recently found many applications in computer science, artificial intelligence, the foundations of mathematics, linguistics and other disciplines. Celebrated for their good computational behaviour, modal logics are used as effective formalisms for talking about time, space, knowledge, beliefs, actions, obligations, provability, etc. However, the nice computational properties can drastically change if we combine some of these formalisms into a many-dimensional system, say, to reason about knowledge bases developing in time or moving objects. To study (...)
    Download  
     
    Export citation  
     
    Bookmark   41 citations  
  • Nonfinitizability of classes of representable polyadic algebras.James S. Johnson - 1969 - Journal of Symbolic Logic 34 (3):344-352.
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  • (1 other version)Finite Frames for K4.3 x S5 Are Decidable.Agi Kurucz & Sérgio Marcelino - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 411-436.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Fibring Logics.Dov M. Gabbay - 2000 - Studia Logica 66 (3):440-443.
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  • Two-dimensional modal logic.Krister Segerberg - 1973 - Journal of Philosophical Logic 2 (1):77 - 96.
    Download  
     
    Export citation  
     
    Bookmark   120 citations  
  • On axiomatising products of Kripke frames.Agnes Kurucz - 2000 - Journal of Symbolic Logic 65 (2):923-945.
    It is shown that the many-dimensional modal logic K n , determined by products of n-many Kripke frames, is not finitely axiomatisable in the n-modal language, for any $n > 2$ . On the other hand, K n is determined by a class of frames satisfying a single first-order sentence.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Fibring logics.Dov M. Gabbay - 1999 - New York: Clarendon Press.
    Modern applications of logic in mathematics, computer science, and linguistics use combined systems of different types of logic working together. This book develops a method for combining--or fibring--systems by breaking them into simple components which can be manipulated easily and recombined.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • (1 other version)REVIEWS-Many-dimensional modal logics: Theory and applications.D. M. Gabbay, A. Kurucz, F. Wolter, M. Zakharyaschev & Mark Reynolds - 2005 - Bulletin of Symbolic Logic 11 (1):77-78.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • (1 other version)Many-Dimensional Modal Logics: Theory and Applications.D. M. Gabbay, A. Kurucz, F. Wolter & M. Zakharyaschev - 2005 - Studia Logica 81 (1):147-150.
    Download  
     
    Export citation  
     
    Bookmark   61 citations  
  • The equational theory of CA 3 is undecidable.Roger Maddux - 1980 - Journal of Symbolic Logic 45 (2):311 - 316.
    Download  
     
    Export citation  
     
    Bookmark   6 citations