SearcharxivSearch

arXiv · 1403.6398

Indestructibility of generically strong cardinals

Abstract

Foreman proved the Duality Theorem, which gives an algebraic characterization of certain ideal quotients in generic extensions. As an application he proved that generic supercompactness of $\omega_1$ is preserved by any proper forcing. We generalize portions of Foreman's Duality Theorem to the context of generic extender embeddings and ideal extenders (as introduced by Claverie in his PhD Thesis, Universitat Munster, 2010). As an application we prove that if $\omega_1$ is generically strong, then it remains so after adding any number of Cohen subsets of $\omega_1$; however many other $\omega_1$-closed posets---such as $\text{Col}(\omega_1, \omega_2)$---can destroy the generic strength of $\omega_1$. This generalizes some results of Gitik-Shelah about indestructibility of strong cardinals to the generically strong context. We also prove similar theorems for successor cardinals larger than $\omega_1$.

Explore related subjects

Keep this discovery

BibTeXRIS

Brent Cody, Sean Cox. 2014-03-25. Indestructibility of generically strong cardinals. https://arxiv.org/abs/1403.6398

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