arxiv: 2604.16874 · v1 · submitted 2026-04-18 · 🧮 math.LO

Recognition: unknown

Ultracontact algebras and stack systems

Anna Laura Suarez, Ivo D\"untsch, Luca Carai, Rafa{\l} Gruszczy\'nski

Pith reviewed 2026-05-10 07:20 UTC · model grok-4.3

classification 🧮 math.LO

keywords ultracontact algebrasstack systemscontact relationBoolean algebrasalgebraic logicspatial reasoningcontact algebrasgeneralized structures

0 comments

The pith

Ultracontact algebras generalize multiple approaches to contact relations on Boolean algebras.

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

The paper introduces and examines ultracontact algebras as a class of structures that extend and unify various existing definitions of the contact relation on Boolean algebras. Contact relations express when two elements overlap or adjoin in an algebraic setting, and different authors have proposed slightly different axiom sets for them. By defining this broader class and introducing stack systems as a corresponding representation, the work provides a single setting in which properties of these relations can be investigated together. A reader would care because contact appears across topology, spatial logic, and mereology, and a common framework can make comparisons and transfers of results more direct.

Core claim

Ultracontact algebras are Boolean algebras equipped with a binary relation obeying a collection of axioms that encompass the axioms used in prior definitions of contact. Stack systems consist of families of sets closed under certain operations that serve as concrete models for these algebras. The authors develop the basic theory of both notions, establish their equivalence or correspondence, and show how standard contact algebras fit inside the new class.

What carries the argument

The ultracontact algebra: a Boolean algebra with an added binary relation satisfying the ultracontact axioms that generalize standard contact properties; stack systems serve as the set-based representation that realizes these algebras.

Load-bearing premise

The various existing definitions of contact on Boolean algebras share a common core that can be captured by one set of axioms without erasing the distinctive features each approach was designed to preserve.

What would settle it

A concrete contact relation from the literature that satisfies its original axioms yet fails at least one ultracontact axiom, or an ultracontact algebra whose relation cannot be interpreted as any previously studied contact relation while keeping the intended meaning.

Figures

Figures reproduced from arXiv: 2604.16874 by Anna Laura Suarez, Ivo D\"untsch, Luca Carai, Rafa{\l} Gruszczy\'nski.

**Figure 1.** Figure 1: Configurations that are indistinguishable by binary contact relations Throughout the paper, ⟨B, +, ·, −, 0, 1⟩ will denote a non-trivial Boolean algebra, with the operations—respectively—of join, meet, and complement. On B we define, in the standard way, the binary order relation ≤. B+ is the set of all non-zero elementts of B. If M ⊆ B, then x ∈ B is a lower bound of M if for all y ∈ M, x ≤ y. To simplif… view at source ↗

**Figure 2.** Figure 2: The simplicial complex corresponding to K on the left, and the one corresponding to Ka,b,c on the right In light of the remarks and examples above, the following observation, with which we conclude this section, should not present any difficulties to the reader. Corollary 7.11. Let ⟨B, K ⟩ be a finite Boolean contact algebra. (1) If K = Kmin, then the only simplexes in σ(K ) are vertices (the singletons of… view at source ↗

read the original abstract

We study the class of structures that, in a way, generalize various approaches to the contact relation on Boolean algebras.

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

Ultracontact algebras aim to generalize contact relations on Boolean algebras, but the paper should show how existing models satisfy the new axioms.

read the letter

The main thing to know is that the authors introduce ultracontact algebras and stack systems to generalize various contact relations on Boolean algebras. They set up the new structures and look at some of their features. The paper does well in providing a formal definition that tries to capture common elements from different approaches in the literature. It builds directly on Boolean algebra with contact, which is a standard base. The authors have done the groundwork in defining what makes a structure ultracontact. One area that needs more attention is whether the standard examples, like topological contact or RCC-style relations, actually meet the ultracontact axioms without any adjustments or loss of their key properties. The definitions are there, but explicit theorems showing preservation or embedding for known models would strengthen the claim of generalization. If those are not present, the unification remains more aspirational than demonstrated. The math appears sound in its setup, with no obvious circularity in the basic axioms. The work is formally presented in the style expected for this subfield. This work is for people deep in algebraic logic and related areas like mereotopology. It could be useful for someone looking to extend or compare different contact frameworks, especially if they want a broader class to work within. A serious referee would be appropriate to assess if the unification holds up under scrutiny and to suggest improvements on the examples or theorems. I would send it for peer review.

Referee Report

2 major / 2 minor

Summary. The manuscript introduces ultracontact algebras and stack systems as a class of structures intended to generalize and unify various existing approaches to contact relations on Boolean algebras, including topological and RCC-style models.

Significance. If the unification succeeds with faithful embeddings of standard models, the framework could offer a coherent setting for comparing contact relations in algebraic logic. The current presentation provides definitions but no embedding or preservation theorems, limiting the assessed significance to a preliminary conceptual proposal.

major comments (2)

[Introduction and definitions of ultracontact algebras] The central claim requires that known contact algebras (e.g., topological contact and RCC) satisfy the ultracontact axioms without modification or loss of essential properties. No embedding theorems, preservation results, or explicit verification for standard models are supplied to support this.
[Abstract] The abstract states the structures 'in a way' generalize approaches, but without concrete axioms, examples, or theorems showing coherence, the unification remains unverified and the weakest assumption (existence of a single coherent class) is not substantiated.

minor comments (2)

[Abstract] The abstract is extremely brief and would benefit from a sentence outlining the main definitions or results.
Notation for the new structures should be introduced with explicit comparison to prior contact algebra axioms to aid readability.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the detailed report and the opportunity to clarify the scope of our work on ultracontact algebras and stack systems. The manuscript is presented as an initial conceptual framework rather than a complete unification with all supporting theorems; we address the major comments below and indicate where revisions will be made.

read point-by-point responses

Referee: [Introduction and definitions of ultracontact algebras] The central claim requires that known contact algebras (e.g., topological contact and RCC) satisfy the ultracontact axioms without modification or loss of essential properties. No embedding theorems, preservation results, or explicit verification for standard models are supplied to support this.

Authors: We agree that the absence of explicit verification leaves the generalization claim less substantiated than it could be. The ultracontact axioms were formulated precisely to be satisfied by the standard topological contact algebras and RCC models without requiring modification to those models, as the axioms encode the shared properties of contact relations. However, we did not include direct checks or preservation statements in the submitted version. We will add a dedicated subsection with explicit verification for the main standard examples and a basic statement on preservation of essential properties. revision: yes
Referee: [Abstract] The abstract states the structures 'in a way' generalize approaches, but without concrete axioms, examples, or theorems showing coherence, the unification remains unverified and the weakest assumption (existence of a single coherent class) is not substantiated.

Authors: The qualifier 'in a way' was chosen to signal that the paper proposes a common axiomatic setting rather than claiming a fully verified embedding of every prior approach. The manuscript does supply the concrete axioms for both ultracontact algebras and stack systems, together with the definition of the class. We accept that the abstract could more clearly indicate what is shown versus what is proposed. We will revise the abstract to state the contribution more precisely and ensure that the main text highlights the coherence of the class through the given definitions. revision: partial

Circularity Check

0 steps flagged

No circularity: purely definitional introduction of new algebraic structures

full rationale

The manuscript introduces ultracontact algebras and stack systems as a proposed unifying class for contact relations on Boolean algebras. No equations, fitted parameters, statistical predictions, or derivation chains appear in the provided text. The central activity is axiomatic definition and study of a new class rather than any reduction of a claimed result to its own inputs by construction. Self-citations, if present, are not load-bearing for any predictive or uniqueness claim. The skeptic's observation that embedding theorems are absent is a question of completeness, not circularity in any derivation.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract provides no information on free parameters, axioms, or invented entities.

pith-pipeline@v0.9.0 · 5304 in / 874 out tokens · 30522 ms · 2026-05-10T07:20:49.425884+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

14 extracted references

[1]

and Dwinger, P

Balbes, R. and Dwinger, P. (1974).Distributive lattices. University of Missouri Press, Columbia, Mo. MR0373985

1974
[2]

(1948).Lattice Theory

Birkhoff, G. (1948).Lattice Theory. American Mathematical Society Colloquium Publications, vol. 25, revised edition. American Mathematical Society, New York, N. Y. MR0029876

1948
[3]

Choquet, G. (1947). Sur les notions de filtre et de grille.Comptes Rendus de l’Académie des Sciences Paris, (224):171–173. MR18813

1947
[4]

and Vakarelov, D

Dimov, G. and Vakarelov, D. (2006). Contact Algebras and Region-based Theory of Space: A Proximity Approach–I.Fundamenta Informaticae, 74(2–3):209–249. MR2284194

2006
[5]

and Winter, M

Düntsch, I. and Winter, M. (2004). Construction of Boolean contact algebras. AI Communications, 13:246. MR2120219

2004
[6]

and Winter, M

Düntsch, I. and Winter, M. (2008). The lattice of contact relations on a Boolean algebra. InRelations and Kleene algebra in computer science, volume 4988 of Lecture Notes in Comput. Sci., pages 99–109. Springer, Berlin. MR2497622. ULTRACONTACT ALGEBRAS AND STACK SYSTEMS 25

2008
[7]

and Winter, M

Düntsch, I. and Winter, M. (2005). A representation theorem for Boolean contact algebras.Theoretical Computer Science, 347(3):498–512. MR2187916

2005
[8]

(2005).Ordered Sets

Harzheim, E. (2005).Ordered Sets. Advances in Mathematics. Springer New York, NY, 1 edition

2005
[9]

(1989).General Theory of Boolean Algebras, volume 1 ofHand- book of Boolean algebras, edited by J.D

Koppelberg, S. (1989).General Theory of Boolean Algebras, volume 1 ofHand- book of Boolean algebras, edited by J.D. Monk and R. Bonnet. North-Holland, Amsterdam. MR0991565

1989
[10]

Lipparini, P. (2025). Hypercontact semilattices.Journal of Applied Non- Classical Logics, 35(2):189–214. MR4921905

2025
[11]

Spanier, E. H. (1994).Algebraic Topology. Springer New York, NY. Originally published by McGraw-Hill, 1966, MR210112

1994
[12]

Stell, J. G. (2000). Boolean Connection Algebras: A New Approach to the Region-Connection Calculus.Artificial Intelligence, 122(1–2):111–136. MR1785701

2000
[13]

Thron, W. J. (1973). Proximity structures and grills.Mathematische Annalen, 206:35–62. MR336710

1973
[14]

Vakarelov, D. (1989). Consistency, completeness and negation. In Priest, G., Routley, R., and Norman, J., editors,Paraconsistent Logic. Essays on the Incon- sistent, München. PhilosophiaVerlag. Luca Carai, Department of Mathematics, University of Milan, Italy, Orcid: 0000- 0001-9545-2365 Email address:luca.carai.uni@gmail.com URL:https://lucacarai.github....

1989