Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2406.00767

Independence Phenomena in Mathematics: a Set Theoretic Perspective on Current Obstacles and Scenarios for Solutions

Sandra Müller
View original source ↗Read source document ↗Export metadata ↓

Abstract

The standard axioms of set theory, the Zermelo-Fraenkel axioms (ZFC), do not suffice to answer all questions in mathematics. While this follows abstractly from Kurt G\"odel's famous incompleteness theorems, we nowadays know numerous concrete examples for such questions. A large number of problems in set theory, for example, regularity properties such as Lebesgue measurability and the Baire property are not decided - for even rather simple (for example, projective) sets of reals - by ZFC. Even many problems outside of set theory have been showed to be unsolvable, meaning neither their truth nor their failure can be proven from ZFC. A major part of set theory is devoted to attacking this problem by studying various extensions of ZFC and their properties. We outline some of these extensions and explain current obstacles in understanding their impact on the set theoretical universe together with recent progress on these questions and future scenarios. This work is related to the overall goal to identify the "right" axioms for mathematics.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sandra Müller. 2024-06-02. Independence Phenomena in Mathematics: a Set Theoretic Perspective on Current Obstacles and Scenarios for Solutions. https://arxiv.org/abs/2406.00767

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↗