Hypercontact semilattices

Paolo Lipparini

arxiv: 2308.04874 · v5 · submitted 2023-08-09 · 🧮 math.LO · math.RA

Hypercontact semilattices

Paolo Lipparini This is my paper

Pith reviewed 2026-05-24 07:43 UTC · model grok-4.3

classification 🧮 math.LO math.RA

keywords hypercontact relationsjoin semilatticesBoolean algebrasrepresentation theoremscontact algebrasevent structuresregion-based spacehypergraphs

0 comments

The pith

Join semilattices with a hypercontact relation embed into Boolean algebras, with or without overlap hypercontact, and the proofs are choice-free except one.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper studies join semilattices equipped with an n-ary hypercontact relation as a common structure for contact in spatial theories and binary conflict in event structures. It establishes representation theorems that embed these semilattices into Boolean algebras preserving the hypercontact, with or without an additional overlap version. The work unifies earlier lines of research on contact algebras and concurrent systems by weakening the underlying lattice to a semilattice. All proofs but one avoid the axiom of choice. Examples, open problems, and brief links to hypergraphs are included.

Core claim

Join semilattices carrying a hypercontact relation admit representations inside Boolean algebras that may or may not carry an overlap hypercontact relation. These embeddings preserve the hypercontact operation and hold with choice-free arguments in all but one case, thereby connecting region-based spatial models with event structures that model binary conflict.

What carries the argument

The n-ary hypercontact relation on a join semilattice, which generalizes binary contact and supports embeddings into Boolean algebras with or without overlap hypercontact.

If this is right

Hypercontact on semilattices supplies a uniform algebraic setting for both spatial region contact and binary event conflict.
The mostly choice-free proofs support constructive applications in modeling concurrent systems.
Overlap hypercontact supplies an optional refinement that distinguishes certain overlaps inside the target Boolean algebra.
Concrete examples arise by restricting hypercontact from known Boolean algebras to their semilattice reducts.
Links to event structures and hypergraphs become available through the same semilattice-with-hypercontact signature.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The representation might extend to other weak algebraic structures such as posets or partial lattices.
Decidability or algorithmic questions for spatial or concurrency logics could be studied via the semilattice presentation.
Higher-arity conflicts in systems might receive simpler models once hypercontact replaces iterated binary conflict.
Checking whether a given hypergraph induces a hypercontact semilattice offers a direct test of the framework.

Load-bearing premise

The hypercontact relation must obey the axioms and closure properties inherited from prior definitions of contact and hypercontact that make the Boolean algebra embedding possible.

What would settle it

A specific join semilattice together with a hypercontact relation that fails to embed into any Boolean algebra while preserving the hypercontact would refute the representation theorems.

read the original abstract

Contact Boolean algebras are one of the main algebraic tools in region-based theory of space. T. Ivanova provided strong motivations for the study of merely 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 and noticed that, in general, a hypercontact relation cannot be retrieved from just a binary contact relation. A similar evolution occurred in the study of the just mentioned event structures in computer science. In an effort to unify the above lines of research, in this paper we study join semilattices with a hypercontact relation. We provide representation theorems into Boolean algebras, with or without overlap hypercontact relation. 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.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

Lipparini moves hypercontact from Boolean algebras and event structures down to join semilattices and supplies representation theorems back into Boolean algebras, mostly without choice.

read the letter

The paper studies join semilattices equipped with an n-ary hypercontact relation and proves they can be represented inside Boolean algebras, with or without an overlap version of the relation. All but one proof is choice-free. This is the central new move: previous work stayed with full Boolean algebras or with binary contact, while this version weakens the underlying order to a semilattice and still recovers the embedding. The motivation from region-based space and from event structures in concurrency is laid out clearly, and the paper adds examples plus a short list of open problems, including links to hypergraphs. That combination of scope and constructive proofs is the part that actually advances the literature. The representation claims rest on axioms for hypercontact that are carried over from earlier papers; the abstract does not exhibit counter-examples or failed cases, but the stress-test note found no internal contradictions or definitional gaps. The single proof that uses choice is flagged explicitly, which is honest. No load-bearing circularity or invented entities appear. The work is narrow and technical, so it will mainly interest people already working on algebraic models of contact or concurrency. A reader who needs choice-free representation results or who wants to see how hypercontact behaves on weaker structures will find concrete theorems and references. It is solid enough on its own terms to go to a referee rather than be desk-rejected; the claims are checkable once the proofs are read, and the unification angle is worth testing against the cited literature.

Referee Report

0 major / 2 minor

Summary. The paper studies join semilattices equipped with an n-ary hypercontact relation. It establishes representation theorems embedding such structures into Boolean algebras, both with and without an overlap hypercontact relation. All but one of the proofs are choice-free. The work is motivated by unifying contact algebras from region-based spatial reasoning, event structures from concurrency theory, and hypergraphs, and includes examples and open problems.

Significance. If the representation theorems hold, the results extend algebraic tools for contact relations from Boolean algebras to the weaker setting of join semilattices while preserving choice-free proofs in most cases. This strengthens the algebraic foundations for both spatial reasoning and concurrent systems by handling hypercontact relations that cannot always be reduced to binary contact, and the explicit unification across fields is a clear contribution.

minor comments (2)

[§1] The abstract and introduction refer to 'representation theorems' without specifying in the opening paragraphs whether the target Boolean algebras are required to be complete or atomic; this should be stated explicitly in §1 or the statement of the main theorems.
[Examples section] Notation for the hypercontact relation (e.g., whether it is written as C_n or H) is introduced but not uniformly used in the examples section; a single consistent symbol would improve readability.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive summary and significance assessment of our manuscript, as well as for recommending minor revision. The referee's description accurately reflects the paper's development of representation theorems for join semilattices with hypercontact relations, the unification of contact algebras, event structures, and hypergraphs, and the mostly choice-free nature of the proofs.

Circularity Check

0 steps flagged

No significant circularity identified

full rationale

The paper states representation theorems embedding join semilattices equipped with a hypercontact relation into Boolean algebras (with or without overlap), with all but one proof choice-free. No equations, fitted parameters, self-definitional reductions, or load-bearing self-citations appear in the abstract or stated claims; the results are presented as following from the given axioms on the hypercontact relation and standard representation techniques. The unification with prior contact algebras and event structures is offered as motivation rather than a formal step that reduces the theorems to the paper's own inputs by construction. The derivation chain is therefore self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Only the abstract is available, so the ledger records the background structures named in the abstract. No free parameters, invented entities, or ad-hoc axioms are described.

axioms (1)

standard math Standard axioms of join semilattices and of n-ary relations on them
The paper takes these as the underlying algebraic setting for the hypercontact relation.

pith-pipeline@v0.9.0 · 5703 in / 1235 out tokens · 34908 ms · 2026-05-24T07:43:12.165867+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

25 extracted references · 25 canonical work pages

[1]

(eds.), Handbook of spatial logics, 99--159, Springer, Dordrecht (2007)

Bennett, B., D\"untsch, I., Axioms, algebras and topology, in Aiello, M., Pratt-Hartmann, I., van Benthem, J. (eds.), Handbook of spatial logics, 99--159, Springer, Dordrecht (2007)

work page 2007
[2]

Pure Appl

Bezhanishvili, G., Bezhanishvili, N., Santoli, T., Venema, Y., A strict implication calculus for compact Hausdorff spaces , Ann. Pure Appl. Logic 170, 102714, 1--29 (2019)

work page 2019
[3]

Pure Appl

Bezhanishvili, N., Carai, L., Ghilardi, S., Landi, L., Admissibility of $ _2$ -inference rules: interpolation, model completion, and contact algebras , Ann. Pure Appl. Logic 174, 103169, 1--31 (2023)

work page 2023
[4]

A., Precontact relations and quasi-modal operators in Boolean algebras , in Platzeck, M

Celani, S. A., Precontact relations and quasi-modal operators in Boolean algebras , in Platzeck, M. I., Redondo, M. J. (eds.), Actas del XIII congreso ``Dr. Antonio A. R. Monteiro'', 63--79, Bah \' a Blanca: Universidad Nacional del Sur, Instituto de Matem \'a tica (2016)

work page 2016
[5]

Chajda, I., Hala s , R., K\" u hr, J., Semilattice structures, Research and Exposition in Mathematics 30, Heldermann Verlag, Lemgo (2007)

work page 2007
[6]

(eds), Beyond topology, Contemp

Di Concilio, A., Proximity: a powerful tool in extension theory, function spaces, hyperspaces, B oolean algebras and point-free geometry , in Mynard, F., Pearl E. (eds), Beyond topology, Contemp. Math. 486, 89--114, Amer. Math. Soc., Providence, RI (2009)

work page 2009
[7]

D \"u ntsch, I., MacCaull, W., Vakarelov, D., Winter, M., Distributive contact lattices: topological representations, J. Log. Algebr. Program. 76, 18--34 (2008)

work page 2008
[8]

D \"u ntsch, I., and Li, S., Extension properties of Boolean contact algebras , in Kahl, W., Griffin, T. G. (eds.), Relational and algebraic methods in computer science. 13th international conference, RAMiCS 2012, Cambridge, UK, September 17--20, 2012, 342--356, Springer, Berlin (2012)

work page 2012
[9]

u ntsch, I., Winter, M., Weak contact structures, in MacCaull, W., Winter, M., D \

D \"u ntsch, I., Winter, M., Weak contact structures, in MacCaull, W., Winter, M., D \"u ntsch, I. (eds.), Relational methods in computer science. 8th international seminar on relational methods in computer science, 3rd international workshop on applications of Kleene algebra, and Workshop of COST Action 274: TARSKI, St. Catharines, ON, Canada, February 2...

work page 2005
[10]

Pure Appl

Ghilardi, S., Gianola, A., Modularity results for interpolation, amalgamation and superamalgamation, Ann. Pure Appl. Logic 169, 731--754 (2018)

work page 2018
[11]

J., Plotkin, G

van Glabbeek, R. J., Plotkin, G. D., Configuration structures, event structures and P etri nets , Theoret. Comput. Sci. 410, 4111--4159 (2009)

work page 2009
[12]

E., Consequences of the axiom of choice, Mathematical Surveys and Monographs 59, American Mathematical Society, Providence, RI (1998)

Howard, P., Rubin, J. E., Consequences of the axiom of choice, Mathematical Surveys and Monographs 59, American Mathematical Society, Providence, RI (1998)

work page 1998
[13]

Ivanova, T., Contact join-semilattices, Studia Logica 110, 1219--1241 (2022)

work page 2022
[14]

Kontchakov, R., Pratt-Hartmann, I., Wolter, F., Zakharyaschev, M., Topology, connectedness, and modal logic, in Advances in modal logic. V ol. 7 , 151--176, Coll. Publ., London (2008)

work page 2008
[15]

Lipparini, P., Contact semilattices, Logic Journal of the IGPL, Published online 22 August 2023; doi:10.1093/jigpal/jzad012 (2023)

work page doi:10.1093/jigpal/jzad012 2023
[16]

Lipparini, P., A model theory of topology, Studia Logica , published online May 2024

work page 2024
[17]

Lipparini, P., Contact join-semilattices are not finitely axiomatizable, arXiv:2311.12599, 1--8 (2023)

work page arXiv 2023
[18]

(eds.), Beyond topology, Contemp

Mynard, F., Pearl E. (eds.), Beyond topology, Contemp. Math. 486, Amer. Math. Soc., Providence, RI (2009)

work page 2009
[19]

P., Nagata, J., Vaughan, J

Naimpally, S., Proximity Spaces, in Hart, K. P., Nagata, J., Vaughan, J. E. (eds.), Encyclopedia of general topology, Chap. e-10, 271--272, Elsevier Science Publishers, Amsterdam (2004)

work page 2004
[20]

Panangaden, P., Causality in physics and computation, Theoret. Comput. Sci. 546, 10--16 (2014)

work page 2014
[21]

Peters, J., Naimpally, S., Applications of near sets, Notices Amer. Math. Soc. 59, 536--542 (2012)

work page 2012
[22]

Vakarelov, D., A mereotopology based on sequent algebras, J. Appl. Non-Class. Log. 27, 342--364 (2017)

work page 2017
[23]

Winskel, G., Event structures as presheaves---two representation theorems, in C ONCUR '99: concurrency theory ( E indhoven) , Lecture Notes in Comput. Sci. 1664, 541--556 , Springer, Berlin (1999)

work page 1999
[24]

Winskel, G., Events, Causality and Symmetry, The Computer Journal 54, 42-57 (2009)

work page 2009
[25]

M., Maibaum, T

Winskel, G., Nielsen, M., Models for concurrency, in Abramsky, S., Gabbay, D. M., Maibaum, T. S. E. (eds), Handbook of logic in computer science, V ol. 4 , 1--148, Oxford Univ. Press, New York (1995)

work page 1995

[1] [1]

(eds.), Handbook of spatial logics, 99--159, Springer, Dordrecht (2007)

Bennett, B., D\"untsch, I., Axioms, algebras and topology, in Aiello, M., Pratt-Hartmann, I., van Benthem, J. (eds.), Handbook of spatial logics, 99--159, Springer, Dordrecht (2007)

work page 2007

[2] [2]

Pure Appl

Bezhanishvili, G., Bezhanishvili, N., Santoli, T., Venema, Y., A strict implication calculus for compact Hausdorff spaces , Ann. Pure Appl. Logic 170, 102714, 1--29 (2019)

work page 2019

[3] [3]

Pure Appl

Bezhanishvili, N., Carai, L., Ghilardi, S., Landi, L., Admissibility of \( _2\) -inference rules: interpolation, model completion, and contact algebras , Ann. Pure Appl. Logic 174, 103169, 1--31 (2023)

work page 2023

[4] [4]

A., Precontact relations and quasi-modal operators in Boolean algebras , in Platzeck, M

Celani, S. A., Precontact relations and quasi-modal operators in Boolean algebras , in Platzeck, M. I., Redondo, M. J. (eds.), Actas del XIII congreso ``Dr. Antonio A. R. Monteiro'', 63--79, Bah \' a Blanca: Universidad Nacional del Sur, Instituto de Matem \'a tica (2016)

work page 2016

[5] [5]

Chajda, I., Hala s , R., K\" u hr, J., Semilattice structures, Research and Exposition in Mathematics 30, Heldermann Verlag, Lemgo (2007)

work page 2007

[6] [6]

(eds), Beyond topology, Contemp

Di Concilio, A., Proximity: a powerful tool in extension theory, function spaces, hyperspaces, B oolean algebras and point-free geometry , in Mynard, F., Pearl E. (eds), Beyond topology, Contemp. Math. 486, 89--114, Amer. Math. Soc., Providence, RI (2009)

work page 2009

[7] [7]

D \"u ntsch, I., MacCaull, W., Vakarelov, D., Winter, M., Distributive contact lattices: topological representations, J. Log. Algebr. Program. 76, 18--34 (2008)

work page 2008

[8] [8]

D \"u ntsch, I., and Li, S., Extension properties of Boolean contact algebras , in Kahl, W., Griffin, T. G. (eds.), Relational and algebraic methods in computer science. 13th international conference, RAMiCS 2012, Cambridge, UK, September 17--20, 2012, 342--356, Springer, Berlin (2012)

work page 2012

[9] [9]

u ntsch, I., Winter, M., Weak contact structures, in MacCaull, W., Winter, M., D \

D \"u ntsch, I., Winter, M., Weak contact structures, in MacCaull, W., Winter, M., D \"u ntsch, I. (eds.), Relational methods in computer science. 8th international seminar on relational methods in computer science, 3rd international workshop on applications of Kleene algebra, and Workshop of COST Action 274: TARSKI, St. Catharines, ON, Canada, February 2...

work page 2005

[10] [10]

Pure Appl

Ghilardi, S., Gianola, A., Modularity results for interpolation, amalgamation and superamalgamation, Ann. Pure Appl. Logic 169, 731--754 (2018)

work page 2018

[11] [11]

J., Plotkin, G

van Glabbeek, R. J., Plotkin, G. D., Configuration structures, event structures and P etri nets , Theoret. Comput. Sci. 410, 4111--4159 (2009)

work page 2009

[12] [12]

E., Consequences of the axiom of choice, Mathematical Surveys and Monographs 59, American Mathematical Society, Providence, RI (1998)

Howard, P., Rubin, J. E., Consequences of the axiom of choice, Mathematical Surveys and Monographs 59, American Mathematical Society, Providence, RI (1998)

work page 1998

[13] [13]

Ivanova, T., Contact join-semilattices, Studia Logica 110, 1219--1241 (2022)

work page 2022

[14] [14]

Kontchakov, R., Pratt-Hartmann, I., Wolter, F., Zakharyaschev, M., Topology, connectedness, and modal logic, in Advances in modal logic. V ol. 7 , 151--176, Coll. Publ., London (2008)

work page 2008

[15] [15]

Lipparini, P., Contact semilattices, Logic Journal of the IGPL, Published online 22 August 2023; doi:10.1093/jigpal/jzad012 (2023)

work page doi:10.1093/jigpal/jzad012 2023

[16] [16]

Lipparini, P., A model theory of topology, Studia Logica , published online May 2024

work page 2024

[17] [17]

Lipparini, P., Contact join-semilattices are not finitely axiomatizable, arXiv:2311.12599, 1--8 (2023)

work page arXiv 2023

[18] [18]

(eds.), Beyond topology, Contemp

Mynard, F., Pearl E. (eds.), Beyond topology, Contemp. Math. 486, Amer. Math. Soc., Providence, RI (2009)

work page 2009

[19] [19]

P., Nagata, J., Vaughan, J

Naimpally, S., Proximity Spaces, in Hart, K. P., Nagata, J., Vaughan, J. E. (eds.), Encyclopedia of general topology, Chap. e-10, 271--272, Elsevier Science Publishers, Amsterdam (2004)

work page 2004

[20] [20]

Panangaden, P., Causality in physics and computation, Theoret. Comput. Sci. 546, 10--16 (2014)

work page 2014

[21] [21]

Peters, J., Naimpally, S., Applications of near sets, Notices Amer. Math. Soc. 59, 536--542 (2012)

work page 2012

[22] [22]

Vakarelov, D., A mereotopology based on sequent algebras, J. Appl. Non-Class. Log. 27, 342--364 (2017)

work page 2017

[23] [23]

Winskel, G., Event structures as presheaves---two representation theorems, in C ONCUR '99: concurrency theory ( E indhoven) , Lecture Notes in Comput. Sci. 1664, 541--556 , Springer, Berlin (1999)

work page 1999

[24] [24]

Winskel, G., Events, Causality and Symmetry, The Computer Journal 54, 42-57 (2009)

work page 2009

[25] [25]

M., Maibaum, T

Winskel, G., Nielsen, M., Models for concurrency, in Abramsky, S., Gabbay, D. M., Maibaum, T. S. E. (eds), Handbook of logic in computer science, V ol. 4 , 1--148, Oxford Univ. Press, New York (1995)

work page 1995