Switch to: References

Add citations

You must login to add citations.
  1. Propositional Epistemic Logics with Quantification Over Agents of Knowledge (An Alternative Approach).Gennady Shtakser - 2019 - Studia Logica 107 (4):753-780.
    In the previous paper with a similar title :311–344, 2018), we presented a family of propositional epistemic logics whose languages are extended by two ingredients: by quantification over modal operators or over agents of knowledge and by predicate symbols that take modal operators as arguments. We denoted this family by \}\). The family \}\) is defined on the basis of a decidable higher-order generalization of the loosely guarded fragment of first-order logic. And since HO-LGF is decidable, we obtain the decidability (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Complexity of Monodic Guarded Fragments Over Linear and Real Time.Ian Hodkinson - 2006 - Annals of Pure and Applied Logic 138 (1):94-125.
    We show that the satisfiability problem for the monodic guarded, loosely guarded, and packed fragments of first-order temporal logic with equality is 2Exptime-complete for structures with arbitrary first-order domains, over linear time, dense linear time, rational number time, and some other classes of linear flows of time. We then show that for structures with finite first-order domains, these fragments are also 2Exptime-complete over real number time and hence over most of the commonly used linear flows of time, including the natural (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • The Guarded Fragment with Transitive Guards.Wiesław Szwast & Lidia Tendera - 2004 - Annals of Pure and Applied Logic 128 (1-3):227-276.
    The guarded fragment with transitive guards, [GF+TG], is an extension of the guarded fragment of first-order logic, GF, in which certain predicates are required to be transitive, transitive predicate letters appear only in guards of the quantifiers and the equality symbol may appear everywhere. We prove that the decision problem for [GF+TG] is decidable. Moreover, we show that the problem is in 2E. This result is optimal since the satisfiability problem for GF is 2E-complete 1719–1742). We also show that the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Propositional Epistemic Logics with Quantification Over Agents of Knowledge.Gennady Shtakser - 2018 - Studia Logica 106 (2):311-344.
    The paper presents a family of propositional epistemic logics such that languages of these logics are extended by quantification over modal operators or over agents of knowledge and extended by predicate symbols that take modal operators as arguments. Denote this family by \}\). There exist epistemic logics whose languages have the above mentioned properties :311–350, 1995; Lomuscio and Colombetti in Proceedings of ATAL 1996. Lecture Notes in Computer Science, vol 1193, pp 71–85, 1996). But these logics are obtained from first-order (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation