SearcharxivSearch

arXiv · 1311.0303

Easton functions and supercompactness

Abstract

Suppose $κ$ is $λ$-supercompact witnessed by an elementary embedding $j:V\rightarrow M$ with critical point $κ$, and further suppose that $F$ is a function from the class of regular cardinals to the class of cardinals satisfying the requirements of Easton's theorem: (1) $\forallα$ $α<\textrm{cf}(F(α))$ and (2) $α<β$ $\Longrightarrow$ $F(α)\leq F(β)$. In this article we address the question: assuming GCH, what additional assumptions are necessary on $j$ and $F$ if one wants to be able to force the continuum function to agree with $F$ globally, while preserving the $λ$-supercompactness of $κ$? We show that, assuming GCH, if $F$ is any function as above, and in addition for some regular cardinal $λ>κ$ there is an elementary embedding $j:V\rightarrow M$ with critical point $κ$ such that $κ$ is closed under $F$, the model $M$ is closed under $λ$-sequences, $H(F(λ))\subseteq M$, and for each regular cardinal $γ\leq λ$ one has $(|j(F)(γ)|=F(γ))^V$, then there is a cardinal-preserving forcing extension in which $2^δ=F(δ)$ for every regular cardinal $δ$ and $κ$ remains $λ$-supercompact. This answers a question of B. Cody, M. Magidor, On supercompactness and the continuum function, Ann. Pure Appl. Logic, (2013).

Explore related subjects

Keep this discovery

BibTeXRIS

Brent Cody, Sy-David Friedman, Radek Honzik. 2013-11-01. Easton functions and supercompactness. https://arxiv.org/abs/1311.0303

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