SearcharxivSearch

arXiv · 2603.11630

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

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

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

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO