SearcharxivSearch

arXiv · 2006.01077

On the consistency of ZF with an elementary embedding from $V_{\lambda+2}$ into $V_{\lambda+2}$

Abstract

According to a theorem due to Kenneth Kunen, under ZFC, there is no ordinal $\lambda$ and non-trivial elementary embedding $j:V_{\lambda+2}\to V_{\lambda+2}$. His proof relied on the Axiom of Choice (AC), and no proof from ZF alone has been discovered. $I_{0,\lambda}$ is the assertion, introduced by W. Hugh Woodin, that $\lambda$ is an ordinal and there is an elementary embedding $j:L(V_{\lambda+1})\to L(V_{\lambda+1})$ with critical point ${<\lambda}$. And $I_0$ asserts that $I_{0,\lambda}$ holds for some $\lambda$. The axiom $I_0$ is one of the strongest large cardinals not known to be inconsistent with AC. It is usually studied assuming ZFC in the full universe $V$ (in which case $\lambda$ must be a limit ordinal), but we assume only ZF. We prove, assuming ZF + $I_{0,\lambda}$ + "$\lambda$ is an even ordinal", that there is a proper class transitive inner model $M$ containing $V_{\lambda+1}$ and satisfying ZF + $I_{0,\lambda}$ + "there is an elementary embedding $k:V_{\lambda+2}\to V_{\lambda+2}$"; in fact we will have $k\subseteq j$, where $j$ witnesses $I_{0,\lambda}$ in $M$. This result was first proved by the author under the added assumption that $V_{\lambda+1}^\#$ exists; Gabe Goldberg noticed that this extra assumption was unnecessary. If also $\lambda$ is a limit ordinal and $\lambda$-DC holds in $V$, then the model $M$ will also satisfy $\lambda$-DC. We show that ZFC + "$\lambda$ is even" + $I_{0,\lambda}$ implies $A^\#$ exists for every $A\in V_{\lambda+1}$, but if consistent, this theory does not imply $V_{\lambda+1}^\#$ exists.

Explore related subjects

Keep this discovery

BibTeXRIS

Farmer Schlutzenberg. 2020-06-01. On the consistency of ZF with an elementary embedding from $V_{\lambda+2}$ into $V_{\lambda+2}$. https://doi.org/10.1142/s0219061324500132

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