Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1609.00093

From geometry to geology: An invitation to mathematical pluralism through the phenomenon of independence

Jonas Reitz
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper explores how a pluralist view can arise in a natural way out of the day-to-day practice of modern set theory. By contrast, the widely accepted orthodox view is that there is an ultimate universe of sets $V$, and it is in this universe that mathematics takes place. From this view, the purpose of set theory is "learning the truth about $V$." It has become apparent, however, that the phenomenon of independence - those questions left unresolved by the axioms - holds a central place in the investigation. This paper introduces the notion of independence, explores the primary tool ("soundness") for establishing independence results, and shows how a plurality of models arises through the investigation of this phenomenon. Building on a familiar example from Euclidean geometry, a template for independence proofs is established. Applying this template in the domain of set theory leads to a consideration of forcing, the tool par excellence for constructing universes of sets. Fifty years of forcing has resulted in a profusion of universes exhibiting a wide variety of characteristics - a multiverse of set theories. Direct study of this multiverse presents technical challenges due to its second-order nature. Nonetheless, there are certain nice "local neighborhoods" of the multiverse that are amenable to first-order analysis, and \emph{set-theoretic geology} studies just such a neighborhood, the collection of grounds of a given universe $V$ of set theory. I will explore some of the properties of this collection, touching on major concepts, open questions, and recent developments.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Jonas Reitz. 2016-09-01. From geometry to geology: An invitation to mathematical pluralism through the phenomenon of independence. https://arxiv.org/abs/1609.00093

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↗