SearcharxivSearch

arXiv · 1605.08811

Universal Graphs at $\aleph_{\omega_1+1}$ and Set-theoretic Geology

Abstract

This thesis consists of two parts: the construction of a jointly universal family of graphs, and then an exploration of set-theoretic geology. Firstly we shall construct a model in which $2^{\aleph_{\omega_1}}=2^{\aleph_{\omega_1+1}}=\aleph_{\omega_1+3}$ but there is a jointly universal family of size $\aleph_{\omega_1+2}$ of graphs on $\aleph_{\omega_1+1}$. We take a supercompact cardinal $\kappa$ and will use Radin forcing with interleaved collapses to change $\kappa$ into $\aleph_{\omega_1}$. Prior to the Radin forcing we perform a preparatory iteration to add functions from $\kappa^+$ into Radin names for what will become members of the jointly universal family on $\kappa^+$. The same technique can be used with any uncountable cardinal in place of $\omega_1$. Secondly we explore various topics in set-theoretic geology. We begin by showing that a class Easton support iteration of $\mathrm{Add}(\kappa,1)$ at $\kappa$ regular results in a universe that is its own generic mantle. We then consider set forcings $\mathbb{P}$, $\mathbb{Q}$, $\mathbb{R}$ and $\mathbb{S}$ with respective generics $G$, $H$, $I$ and $J$ such that $V[G][I]=V[H][J]$ and show that $V[G]$ and $V[H]$ must have a shared ground via $(|\mathbb{R}|+|\mathbb{S}|)^+$-cc forcing. This allows a similar analysis of the related situation when $\mathbb{P}$ is replaced by a class iteration and $V[H]$ by a generic ground of $V[G]$. We conclude with a simple characterisation of the mantle of a class forcing extension, and an investigation of the possibilities for a version of the intermediate model theorem that applies to class forcing.

Explore related subjects

Keep this discovery

BibTeXRIS

Jacob Davis. 2016-05-27. Universal Graphs at $\aleph_{\omega_1+1}$ and Set-theoretic Geology. https://arxiv.org/abs/1605.08811

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