Switch to: References

Add citations

You must login to add citations.
  1. Contact semilattices.Paolo Lipparini - 2024 - Logic Journal of the IGPL 32 (5):815-826.
    We devise exact conditions under which a join semilattice with a weak contact relation can be semilattice embedded into a Boolean algebra with an overlap contact relation, equivalently, into a distributive lattice with additive contact relation. A similar characterization is proved with respect to Boolean algebras and distributive lattices with weak contact, not necessarily additive, nor overlap.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Π2-rule systems and inductive classes of Gödel algebras.Rodrigo Nicolau Almeida - 2025 - Annals of Pure and Applied Logic 176 (4):103552.
    Download  
     
    Export citation  
     
    Bookmark  
  • Hypercontact semilattices.Paolo Lipparini - forthcoming - Journal of Applied Non-Classical Logics:1-26.
    Boolean algebras are one of the main algebraic tools in the region-based theory of space. T. Ivanova provided strong motivations for the study of mere semilattices with a contact relation. Another significant motivation for considering an even weaker underlying structure comes from event structures with binary conflict in the theory of concurrent systems in computer science. All the above-hinted notions deal with a binary contact relation. Several authors suggested the more general study of n-ary ‘hypercontact’ relations. A similar evolution occurred (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Correspondence and canonicity theory of quasi-inequalities and Π 2-statements in modal subordination algebras.Zhiguang Zhao - 2024 - Logic Journal of the IGPL 32 (5):729-778.
    In the present paper, we study the correspondence and canonicity theory of modal subordination algebras and their dual Stone space with two relations, generalizing correspondence results for subordination algebras in [13–15, 25]. Due to the fact that the language of modal subordination algebras involves a binary subordination relation, we will find it convenient to use the so-called quasi-inequalities and $\varPi _{2}$-statements. We use an algorithm to transform (restricted) inductive quasi-inequalities and (restricted) inductive $\varPi _{2}$-statements to equivalent first-order correspondents on the (...)
    Download  
     
    Export citation  
     
    Bookmark