SearcharxivSearch

arXiv · 2512.22314

Skands and coskands (The non-founded set theory with individuals and its model in the Field of all Conway numbers)

Abstract

The basic one in this work is the axiomatic set theory $NBG$ (von Neumann-Bernays-G{\"o}del), which is a first-order theory with its own axioms, including in particular the axiom of choice ${\bf AC}$ and the axiom of regularity ${\bf RA}$. The universal class ${\bf V}$ of all sets in this theory exactly coincides with the class of all founded sets, i.e., such $X\in{\bf V}$ that {\it does not exist} an infinitely descending $\in$-sequence $X\ni X_1\ni X_2\ni...\ni X_n\ni...$ of sets $X_n$, $n=1,2,3,...\,\,$. In the first part of the paper, a new concept of {\it skand} is introduced -- a random aggregate, or \grqq decreasing\grqq\, tuple composed of founded sets, e.g., $X=\{1,\{2,\{3,\{...\,\,\,...\}\}\}\}$, and the theory of $NBG^-=NBG-{\bf RA}$, i.e., the theory of $NBG$ without the axiom of regularity ${\bf RA}$, to which is added the new axiom ${\bf SEA}$ of the existence of infinite-length skands and the pseudo-founding axiom ${\bf PFA}$. These new axioms are a negation of the axiom of regularity and are thus less restrictive than the axiom of regularity ${\bf RA}$ in the sense that they admit the existence of non-founded sets, and the axiom of regularity excludes the existence of such sets. At the same time of course the axiom of extensionality ${\bf EA}$ is replaced by a more accurate axiom of extensionality ${\bf EEA}$, since it takes into account the equality of new objects. In the second part of the paper, a new concept of {\it coskand} is introduced, which is dual to a notion of skand and is a random aggregate, or \grqq increasing\grqq\, tuple composed of founded sets and the theory of $NBG$ and actually is a theory $NBG[\cal U]$ with individuals as limiting coskands, e.g., $X=...\{3,\{2,\{1,\{0\}\}\}\}...\,\,$.

Explore related subjects

Keep this discovery

BibTeXRIS

Ju. T. Lisica. 2025-12-26. Skands and coskands (The non-founded set theory with individuals and its model in the Field of all Conway numbers). https://arxiv.org/abs/2512.22314

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