Switch to: References

Add citations

You must login to add citations.
  1. Unification in intermediate logics.Rosalie Iemhoff & Paul Rozière - 2015 - Journal of Symbolic Logic 80 (3):713-729.
  • 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 structural completeness; an algebraic approach.Wojciech Dzik & Michał M. Stronkowski - 2016 - Annals of Pure and Applied Logic 167 (7):525-556.
  • Unification with parameters in the implication fragment of classical propositional logic.Philippe Balbiani & Mojtaba Mojtahedi - 2022 - Logic Journal of the IGPL 30 (3):454-464.
    In this paper, we show that the implication fragment of classical propositional logic is finitary for unification with parameters.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • Remarks about the unification types of some locally tabular normal modal logics.Philippe Balbiani, ÇiĞdem Gencer, Maryam Rostamigiv & Tinko Tinchev - 2023 - Logic Journal of the IGPL 31 (1):115-139.
    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 (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • 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  
  • Proving Cleanthes wrong.Laureano Luna - 2021 - Journal of Applied Logic 8 (3):707-736.
    Hume’s famous character Cleanthes claims that there is no difficulty in explaining the existence of causal chains with no first cause since in them each item is causally explained by its predecessor. Relying on logico-mathematical resources, we argue for two theses: (1) if the existence of Cleanthes’ chain can be explained at all, it must be explained by the fact that the causal law ruling it is in force, and (2) the fact that such a causal law is in force (...)
    Direct download  
     
    Export citation  
     
    Bookmark