Hilbert algebras provide the equivalent algebraic semantics in the sense of Blok and Pigozzi to the implication fragment of intuitionistic logic. They are closely related to implicative semilattices. Porta proved that every Hilbert algebra has a free implicative semilattice extension. In this paper we introduce the notion of an optimal deductive filter of a Hilbert algebra and use it to provide a different proof of the existence of the free implicative semilattice extension of a Hilbert algebra as well as a (...) simplified characterization of it. The optimal deductive filters turn out to be the traces in the Hilbert algebra of the prime filters of the distributive lattice free extension of the free implicative semilattice extension of the Hilbert algebra. To define the concept of optimal deductive filter we need to introduce the concept of a strong Frink ideal for Hilbert algebras which generalizes the concept of a Frink ideal for posets. (shrink)

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 (...) in the study of the just mentioned event structures in computer science. To unify the above lines of research, in this paper, we study joining semilattices with a hypercontact relation. We provide representation theorems into Boolean algebras. With a single exception, our proofs are choice-free. We also present several examples and problems; in particular, we briefly discuss some connections with event structures and hypergraphs. (shrink)

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 (...) in the study of the just mentioned event structures in computer science. To unify the above lines of research, in this paper, we study joining semilattices with a hypercontact relation. We provide representation theorems into Boolean algebras. With a single exception, our proofs are choice-free. We also present several examples and problems; in particular, we briefly discuss some connections with event structures and hypergraphs. (shrink)