Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2311.12587

A Renunciation of Axiom, A New Conception of Logic

Eitan Wander
View original source ↗Read source document ↗Export metadata ↓

Abstract

Mathematicians invented Mathematics to escape from words, but at last they depend on them just as much as everybody else. At the end, all basic definitions will be reliant on words, yet the mathematician believes that he's elevated from them by use of axioms, only that just postpones the problem and later becomes more serious G\"odelian problems due to the countability of the axiomatic array. I think we should do our best to rid ourselves of axioms, and in this paper, I revisit what's called "Na\"ive Set Theory", which is set theory that is fully reliant on verbal definitions, and resolve the problems that were once found with it in the form of paradoxes, most notably, Russell's Paradox. I believe that by this, a new approach to mathematics as a whole is presented, an approach that refers to mathematics as the science of definitions. The question "how do you define definition?" will not be a part of Mathematics but of Metamathematics and to it many of the problems known about Na\"ive Set Theory will be funneled. A thorough yet concise treatment of the matter will be given in this paper.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Eitan Wander. 2023-11-21. A Renunciation of Axiom, A New Conception of Logic. https://arxiv.org/abs/2311.12587

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

KEEP EXPLORING

Related papers

arXiv2026

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

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

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↗