Switch to: References

Citations of:

Sahlqvist Formulas Unleashed in Polyadic Modal Languages

In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 221-240 (2002)

Add citations

You must login to add citations.
  1. A Computational Learning Semantics for Inductive Empirical Knowledge.Kevin T. Kelly - 2014 - In Alexandru Baltag & Sonja Smets (eds.), Johan van Benthem on Logic and Information Dynamics. Springer International Publishing. pp. 289-337.
    This chapter presents a new semantics for inductive empirical knowledge. The epistemic agent is represented concretely as a learner who processes new inputs through time and who forms new beliefs from those inputs by means of a concrete, computable learning program. The agent’s belief state is represented hyper-intensionally as a set of time-indexed sentences. Knowledge is interpreted as avoidance of error in the limit and as having converged to true belief from the present time onward. Familiar topics are re-examined within (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Towards Incorporating Background Theories Into Quantifier Elimination.Andrzej Szalas - 2008 - Journal of Applied Non-Classical Logics 18 (2-3):325-340.
    In the paper we present a technique for eliminating quantifiers of arbitrary order, in particular of first-order. Such a uniform treatment of the elimination problem has been problematic up to now, since techniques for eliminating first-order quantifiers do not scale up to higher-order contexts and those for eliminating higher-order quantifiers are usually based on a form of monotonicity w.r.t implication and are not applicable to the first-order case. We make a shift to arbitrary relations “ordering” the underlying universe. This allows (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • An Extension of Kracht's Theorem to Generalized Sahlqvist Formulas.Stanislav Kikot - 2009 - Journal of Applied Non-Classical Logics 19 (2):227-251.
    Sahlqvist formulas are a syntactically specified class of modal formulas proposed by Hendrik Sahlqvist in 1975. They are important because of their first-order definability and canonicity, and hence axiomatize complete modal logics. The first-order properties definable by Sahlqvist formulas were syntactically characterized by Marcus Kracht in 1993. The present paper extends Kracht's theorem to the class of ‘generalized Sahlqvist formulas' introduced by Goranko and Vakarelov and describes an appropriate generalization of Kracht formulas.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Semantic Characterization of Krancht Formulas.Stanislav Kikot - 2010 - In Lev Beklemishev, Valentin Goranko & Valentin Shehtman (eds.), Advances in Modal Logic, Volume 8. CSLI Publications. pp. 218-234.
    Download  
     
    Export citation  
     
    Bookmark