Switch to: Citations

Add references

You must login to add references.
  1. Elementary canonical formulae: extending Sahlqvist’s theorem.Valentin Goranko & Dimiter Vakarelov - 2006 - Annals of Pure and Applied Logic 141 (1):180-217.
    We generalize and extend the class of Sahlqvist formulae in arbitrary polyadic modal languages, to the class of so called inductive formulae. To introduce them we use a representation of modal polyadic languages in a combinatorial style and thus, in particular, develop what we believe to be a better syntactic approach to elementary canonical formulae altogether. By generalizing the method of minimal valuations à la Sahlqvist–van Benthem and the topological approach of Sambin and Vaccaro we prove that all inductive formulae (...)
    Download  
     
    Export citation  
     
    Bookmark   26 citations  
  • Modal Logic: Graph. Darst.Patrick Blackburn, Maarten de Rijke & Yde Venema - 2001 - New York: Cambridge University Press. Edited by Maarten de Rijke & Yde Venema.
    This modern, advanced textbook reviews modal logic, a field which caught the attention of computer scientists in the late 1970's.
    Download  
     
    Export citation  
     
    Bookmark   295 citations  
  • Tools and techniques in modal logic.Marcus Kracht - 1999 - New York: Elsevier.
    This book treats modal logic as a theory, with several subtheories, such as completeness theory, correspondence theory, duality theory and transfer theory and is intended as a course in modal logic for students who have had prior contact with modal logic and who wish to study it more deeply. It presupposes training in mathematical or logic. Very little specific knowledge is presupposed, most results which are needed are proved in this book.
    Download  
     
    Export citation  
     
    Bookmark   56 citations  
  • An undecidable problem in correspondence theory.L. A. Chagrova - 1991 - Journal of Symbolic Logic 56 (4):1261-1272.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Second-Order Quantifier Elimination in Higher-Order Contexts with Applications to the Semantical Analysis of Conditionals.Dov M. Gabbay & Andrzej Szałas - 2007 - Studia Logica 87 (1):37-50.
    Second-order quantifier elimination in the context of classical logic emerged as a powerful technique in many applications, including the correspondence theory, relational databases, deductive and knowledge databases, knowledge representation, commonsense reasoning and approximate reasoning. In the current paper we first generalize the result of Nonnengart and Szałas [17] by allowing second-order variables to appear within higher-order contexts. Then we focus on a semantical analysis of conditionals, using the introduced technique and Gabbay’s semantics provided in [10] and substantially using a third-order (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations