Switch to: References

Add citations

You must login to add citations.
  1. Decidability of an Xstit Logic.Gillman Payette - 2014 - Studia Logica 102 (3):577-607.
    This paper presents proofs of completeness and decidability of a non-temporal fragment of an Xstit logic. This shows a distinction between the non-temporal fragments of Xstit logic and regular stit logic since the latter is undecidable. The proof of decidability is via the finite model property. The finite model property is shown to hold by constructing a filtration. However, the set that is used to filter the models isn’t simply closed under subformulas, it has more complex closure conditions. The filtration (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Finite Model Property in Weakly Transitive Tense Logics.Minghui Ma & Qian Chen - 2023 - Studia Logica 111 (2):217-250.
    The finite model property (FMP) in weakly transitive tense logics is explored. Let \(\mathbb {S}=[\textsf{wK}_t\textsf{4}, \textsf{K}_t\textsf{4}]\) be the interval of tense logics between \(\textsf{wK}_t\textsf{4}\) and \(\textsf{K}_t\textsf{4}\). We introduce the modal formula \(\textrm{t}_0^n\) for each \(n\ge 1\). Within the class of all weakly transitive frames, \(\textrm{t}_0^n\) defines the class of all frames in which every cluster has at most _n_ irreflexive points. For each \(n\ge 1\), we define the interval \(\mathbb {S}_n=[\textsf{wK}_t\textsf{4T}_0^{n+1}, \textsf{wK}_t\textsf{4T}_0^{n}]\) which is a subset of \(\mathbb {S}\). There are (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  • On Rules.Rosalie Iemhoff - 2015 - Journal of Philosophical Logic 44 (6):697-711.
    This paper contains a brief overview of the area of admissible rules with an emphasis on results about intermediate and modal propositional logics. No proofs are given but many references to the literature are provided.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  • Characteristic Formulas of Partial Heyting Algebras.Alex Citkin - 2013 - Logica Universalis 7 (2):167-193.
    The goal of this paper is to generalize a notion of characteristic (or Jankov) formula by using finite partial Heyting algebras instead of the finite subdirectly irreducible algebras: with every finite partial Heyting algebra we associate a characteristic formula, and we study the properties of these formulas. We prove that any intermediate logic can be axiomatized by such formulas. We further discuss the correlations between characteristic formulas of finite partial algebras and canonical formulas. Then with every well-connected Heyting algebra we (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark