SearcharxivSearch

arXiv · 1207.2985

Skand theory and its applications. (A new look at non-well-founded sets)

Abstract

A new mathematical object called a skand is introduced, which turns out in general to be a non-well-founded set. Skands of finite lengths are ordinary well-founded sets, and skands of very long length (like the hyper-skand of all ordinals) are hyper-classes. Self-similar skands are also considered, and they clarify the reflexivity of sets, i.e., the meaning of the relation X is a member of X; in particular, self-similar skands considered as non-well-founded sets are always reflexive, but not vice versa. The existence of self-similar skands shows at once that Russell's well-known paradox is not a paradox at all. The inconsistency of Russell's "set" R, which is the collection of all sets that are not members of themselves, is proved here not with the help of Russell's paradox (as it is traditionally given, which is incorrect), but via a simple method of the maximality (universality) of R which goes back to Cantor and can be also applied to other set-theoretical paradoxes. Generalized skands are also defined and a new look at the generalized skand-class of all ordinals is demonstrated. In particular, the last (class) ordinal called the eschaton is defined. The next application of skand theory is a description of all epsilon-numbers in the sense of Cantor. Another application is a generalized theory of one-dimensional continua of arbitrary powers and the construction of generalized real numbers as a non-Archimedean straight line of arbitrary power, and the introduction of the absolute continuum and the absolute straight line as the hyper-classes nearest to the class of sets.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ju. T. Lisica. 2012-08-02. Skand theory and its applications. (A new look at non-well-founded sets). https://arxiv.org/abs/1207.2985

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