Switch to: References

Add citations

You must login to add citations.
  1. Rules with Parameters in Modal Logic I.Emil Jeřábek - 2015 - Annals of Pure and Applied Logic 166 (9):881-933.
  • Unification, Finite Duality and Projectivity in Varieties of Heyting Algebras.Silvio Ghilardi - 2004 - Annals of Pure and Applied Logic 127 (1-3):99-115.
    We investigate finitarity of unification types in locally finite varieties of Heyting algebras, giving both positive and negative results. We make essential use of finite dualities within a conceptualization for E-unification theory 733–752) relying on the algebraic notion of a projective object.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  • Unification in First-Order Transitive Modal Logic.Wojciech Dzik & Piotr Wojtylak - forthcoming - Logic Journal of the IGPL.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Unification in Superintuitionistic Predicate Logics and its Applications.Wojciech Dzik & Piotr Wojtylak - 2019 - Review of Symbolic Logic 12 (1):37-61.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Finitary Unification in Locally Tabular Modal Logics Characterized.Wojciech Dzik, Sławomir Kost & Piotr Wojtylak - 2022 - Annals of Pure and Applied Logic 173 (4):103072.
  • Almost Structurally Complete Infinitary Consequence Operations Extending S4.3.Wojciech Dzik & Piotr Wojtylak - 2015 - Logic Journal of the IGPL 23 (4):640-661.
  • Unification in Epistemic Logics.Philippe Balbiani & Çiğdem Gencer - 2017 - Journal of Applied Non-Classical Logics 27 (1-2):91-105.
    Epistemic logics are essential to the design of logical systems that capture elements of reasoning about knowledge. In this paper, we study the computability of unifiability and the unification types in several epistemic logics.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  • Remarks About the Unification Type of Several Non-Symmetric Non-Transitive Modal Logics.Philippe Balbiani - 2019 - Logic Journal of the IGPL 27 (5):639-658.
    The problem of unification in a normal modal logic $L$ can be defined as follows: given a formula $\varphi$, determine whether there exists a substitution $\sigma$ such that $\sigma $ is in $L$. In this paper, we prove that for several non-symmetric non-transitive modal logics, there exists unifiable formulas that possess no minimal complete set of unifiers.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Remarks About the Unification Types of Some Locally Tabular Normal Modal Logics.Philippe Balbiani, ÇiĞdem Gencer, Maryam Rostamigiv & Tinko Tinchev - forthcoming - Logic Journal of the IGPL.
    It is already known that unifiable formulas in normal modal logic $\textbf {K}+\square ^{2}\bot $ are either finitary or unitary and unifiable formulas in normal modal logic $\textbf {Alt}_{1}+\square ^{2}\bot $ are unitary. In this paper, we prove that for all $d{\geq }3$, unifiable formulas in normal modal logic $\textbf {K}+\square ^{d}\bot $ are either finitary or unitary and unifiable formulas in normal modal logic $\textbf {Alt}_{1}+\square ^{d}\bot $ are unitary.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • KD is Nullary.Philippe Balbiani & Çiğdem Gencer - 2017 - Journal of Applied Non-Classical Logics 27 (3-4):196-205.
    In the ordinary modal language, KD is the modal logic determined by the class of all serial frames. In this paper, we demonstrate that KD is nullary.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  • Unification Types in Euclidean Modal Logics.Majid Alizadeh, Mohammad Ardeshir, Philippe Balbiani & Mojtaba Mojtahedi - forthcoming - Logic Journal of the IGPL.
    We prove that $\textbf {K}5$ and some of its extensions that do not contain $\textbf {K}4$ are of unification type $1$.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Projective Formulas and Unification in Linear Temporal Logic LTLU.V. Rybakov - 2014 - Logic Journal of the IGPL 22 (4):665-672.
  • Discrete Linear Temporal Logic with Current Time Point Clusters, Deciding Algorithms.V. Rybakov - 2008 - Logic and Logical Philosophy 17 (1-2):143-161.
    The paper studies the logic TL(NBox+-wC) – logic of discrete linear time with current time point clusters. Its language uses modalities Diamond+ (possible in future) and Diamond- (possible in past) and special temporal operations, – Box+w (weakly necessary in future) and Box-w (weakly necessary in past). We proceed by developing an algorithm recognizing theorems of TL(NBox+-wC), so we prove that TL(NBox+-wC) is decidable. The algorithm is based on reduction of formulas to inference rules and converting the rules in special reduced (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark