Switch to: References

Add citations

You must login to add citations.
  1. All Finitely Axiomatizable Tense Logics of Linear Time Flows Are CoNP-complete.Tadeusz Litak & Frank Wolter - 2005 - Studia Logica 81 (2):153-165.
    We prove that all finitely axiomatizable tense logics with temporal operators for ‘always in the future’ and ‘always in the past’ and determined by linear fows time are coNP-complete. It follows, for example, that all tense logics containing a density axiom of the form ■n+1F p → nF p, for some n ≥ 0, are coNP-complete. Additionally, we prove coNP-completeness of all ∩-irreducible tense logics. As these classes of tense logics contain many Kripke incomplete bimodal logics, we obtain many natural (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • All Normal Extensions of S5-squared Are Finitely Axiomatizable.Ian Hodkinson - 2004 - Studia Logica 78 (3):443-457.
    We prove that every normal extension of the bi-modal system S52 is finitely axiomatizable and that every proper normal extension has NP-complete satisfiability problem.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • What is the correct logic of necessity, actuality and apriority?Peter Fritz - 2014 - Review of Symbolic Logic 7 (3):385-414.
    This paper is concerned with a propositional modal logic with operators for necessity, actuality and apriority. The logic is characterized by a class of relational structures defined according to ideas of epistemic two-dimensional semantics, and can therefore be seen as formalizing the relations between necessity, actuality and apriority according to epistemic two-dimensional semantics. We can ask whether this logic is correct, in the sense that its theorems are all and only the informally valid formulas. This paper gives outlines of two (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   18 citations  
  • All Normal Extensions of S5-squared Are Finitely Axiomatizable.Nick Bezhanishvili & Ian Hodkinson - 2004 - Studia Logica 78 (3):443-457.
    We prove that every normal extension of the bi-modal system S52 is finitely axiomatizable and that every proper normal extension has NP-complete satisfiability problem.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation