Hypercontact semilattices

Contact 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.

Authors

Institutions

Publication Details

Journal
Journal of Applied Non-Classical Logics
Published
2025-01-22
DOI
https://doi.org/10.1080/11663081.2025.2452738
Citations
1
Primary Topic
Advanced Algebra and Logic
Type
article
Field-Weighted Citation Impact
1.50

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Hypercontact semilattices

Paolo Lipparini
1 citations
Journal of Applied Non-Classical Logics
Advanced Algebra and Logic
1.50
article

Hypercontact semilattices

Paolo Lipparini
article en
1 citations

Abstract

Contact 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.

Journal of Applied Non-Classical LogicsVol. 35(2)
University of Rome Tor Vergata (IT)
Università degli Studi di Roma Tor Vergata
Openalex Percentile: Top 20%
Advanced Algebra and Logic
1.50
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Hypercontact semilattices — Paolo Lipparini · Journal of Applied Non-Classical Logics (2025) | TGRS Research Map | TGRS