SearcharxivSearch

arXiv · 1510.04082

Hyperclass Forcing in Morse-Kelley Class Theory

Abstract

In this article we introduce and study hyperclass-forcing (where the conditions of the forcing notion are themselves classes) in the context of an extension of Morse-Kelley class theory, called MK$^{**}$. We define this forcing by using a symmetry between MK$^{**}$ models and models of ZFC$^-$ plus there exists a strongly inaccessible cardinal (called SetMK$^{**}$). We develop a coding between $\beta$-models $\mathcal{M}$ of MK$^{**}$ and transitive models $M^+$ of SetMK$^{**}$ which will allow us to go from $\mathcal{M}$ to $M^+$ and vice versa. So instead of forcing with a hyperclass in MK$^{**}$ we can force over the corresponding SetMK$^{**}$ model with a class of conditions. For class-forcing to work in the context of ZFC$^-$ we show that the SetMK$^{**}$ model $M^+$ can be forced to look like $L_{\kappa^*}[X]$, where $\kappa^*$ is the height of $M^+$, $\kappa$ strongly inaccessible in $M^+$ and $X\subseteq\kappa$. Over such a model we can apply definable class forcing and we arrive at an extension of $M^+$ from which we can go back to the corresponding $\beta$-model of MK$^{**}$, which will in turn be an extension of the original $\mathcal{M}$. Our main result combines hyperclass forcing with coding methods of [BJW82] and [Fri00] to show that every $\beta$-model of MK$^{**}$ can be extended to a minimal such model of MK$^{**}$ with the same ordinals. A simpler version of the proof also provides a new and analogous minimality result for models of second-order arithmetic.

Explore related subjects

Keep this discovery

BibTeXRIS

Carolin Antos, Sy-David Friedman. 2015-10-14. Hyperclass Forcing in Morse-Kelley Class Theory. https://arxiv.org/abs/1510.04082

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