Search arXivSearch

arXiv · 2511.12727

A Topological Rewriting of Tarski's Mereogeometry

Abstract

Qualitative spatial models based on Goodman-style mereology and pseudo-topology often pose problems for advanced geometric reasoning, as they lack true Euclidean geometry and fully developed topological spaces. We address this issue by extending an existing formalization grounded in a dependent type theory using the Coq proof assistant, together with a Whitehead-like point-free interpretation of Tarski's geometry. More precisely, we build on a library called lambda-MM to formalize Tarski's geometry of solids by investigating an algebraic formulation of topological relations on top of the mereological framework. Since Tarski's work is rooted in Lesniewski's mereology, and given that lambda-MM currently provides only a partial implementation of Tarski's geometry, the first part of the paper completes this framework by proving that mereological classes correspond to regular open sets. This yields a topology of individual names that can be extended with Tarski's geometric primitives. Unlike classical approaches in qualitative logical theories, we adopt a solution that derives a full topological space from mereology together with a geometric subspace, thereby increasing the expressiveness of the theory. In the second part, we show that Tarski's geometry forms a subspace of this topology in which regions correspond to restricted classes. We also prove three of Tarski's original postulates, reducing his axiomatic system, and extend the theory with the T2 (Hausdorff) property and additional definitions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Patrick Barlatier, Richard Dapoigny. 2025-11-16. A Topological Rewriting of Tarski's Mereogeometry. https://doi.org/10.1609/aaai.v40i23.38976

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

KEEP EXPLORING

Related papers

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO