Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2603.11630

The magmatic universe revisited: we define ordered pairs, relations, numbers and a special form of Separation

Athanassios Tzouvaras
View original source ↗Read source document ↗Export metadata ↓

Abstract

This is a companion article to \cite{Tz24}. We address the following two questions: 1) Can we define in the magmatic universe $M$ of \cite{Tz24} counterparts, or just analogues, of some very basic set-theoretic objects which are missing from $M$, specifically ordered pairs, binary relations, especially functions, as well as natural and ordinal numbers? 2) Are there restricted forms of the Separation and, perhaps, Replacement schemes that hold in $M$? We show the following: 1) Magmatic analogues of ordered pairs can indeed be defined by means of certain magmas called ``magmatic pairs''. However when we use them to generate relations and especially functions, some unsurmountable problems come up. These problems are due to the peculiarity of the elements of magmas to be distinguished into ``intended'' and ``collateral'' ones, a distinction due to their inherent relation of dependence. So magmatic functions are defined under very special conditions. 2) A certain class of formulas, called ``magmatic formulas'' is isolated, and the scheme of Separation restricted to these formulas, called ``Magmatic Separation Scheme'' (MSS), is proven to hold in $M$. On the other hand Replacement fails badly, and this is due to its functional form.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Athanassios Tzouvaras. 2026-03-12. The magmatic universe revisited: we define ordered pairs, relations, numbers and a special form of Separation. https://arxiv.org/abs/2603.11630

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗