Search arXiv⌕ Search

arXiv · 2511.21396

Extended Contact Algebras: Algebraic analysis and duality theory

Abstract

The ternary extended contact relation was introduced in (Ivanova, 2020) as a more expressive counterpart of the standard binary contact relation. The class of Boolean algebras expanded with the relation was named Extended Contact Algebras (ECAs). In this work, we take an algebraic perspective on ECAs, interpreting the ternary relation as a form of entailment. We introduce Pseudo-Inference Algebras, purely algebraic tructures where the ternary relation is replaced by a monotone ternary operator, capturing the logical character of extended contact. We show that the subclass of relational Pseudo-Inference Algebras corresponds precisely to ECAs and generates a subvariety of strict PSI-Algebras, which forms a discriminator variety. Furthermore, we extend Stone duality to this ternary context, introducing descriptive PSI-frames and establishing three interrelated dualities that differ in their morphisms while sharing the same class of topological objects. The framework developed in the paper provides a nified relational semantics for Boolean algebras equipped with monotone ternary operators, connecting spatial and logical notions within a categorical and topological setting.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rafał Gruszczyński, Paula Menchón, William Zuluaga. 2025-11-26. Extended Contact Algebras: Algebraic analysis and duality theory. https://arxiv.org/abs/2511.21396

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Forcing with Symmetric Systems of Models of Two Types

The purpose of this paper is to present a general method for forcing on $ω_2$ and $ω_3$ with finite conditions, while preserving all cardinals and some fragments of $\mathrm{GCH}$. This method is based on the technique of forcing with finite symmetric systems of elementary submodels, and improves earlier versions of this forcing by including models of two types. We will present several applications of the pure side condition forcing and variants thereof, by adding a Kurepa tree on $ω_2$, a club subset of $ω_2$ that avoids infinite sets from the ground model, a function bounding every canonical function below $ω_3$ on a club, and a simplified $(ω_2,1)$-morass.

math.LO↗

Compactness beyond choice and HOD

We characterise exacting, rank-Berkeley, Berkeley, and club Berkeley cardinals by compactness properties of logics and, equivalently, by compactness properties of certain topological spaces. This raises the strength known to be obtainable by statements about compactness into the realm of choiceless large cardinal axioms, the strongest known statements in terms of consistency strength. Moreover, it shows that compactness assumptions can directly violate the axiom of choice and the axiom $V=\text{HOD}$.

math.LO↗

Two applications of the point-free coderivative

We present two new applications of Simmons' point-free Cantor-Bendixson coderivative operator in intuitionistic logic. First, we use it to give a simplified proof of the recent result of Xu and Ye that the free Heyting algebra on two generators does not occur as the Heyting algebra of subterminal objects in any elementary topos. Then we use it to prove that complete Heyting algebra semantics is not strongly complete for intuitionistic second-order propositional logic: semantic consequence from an arbitrary set of assumptions does not coincide with ordinary syntactic consequence.

math.LO↗