SearcharxivSearch

arXiv · 1902.10638

Capturing sets of ordinals by normal ultrapowers

Abstract

We investigate the extent to which ultrapowers by normal measures on $\kappa$ can be correct about powersets $\mathcal{P}(\lambda)$ for $\lambda>\kappa$. We consider two versions of this questions, the capturing property $\mathrm{CP}(\kappa,\lambda)$ and the local capturing property $\mathrm{LCP}(\kappa,\lambda)$. $\mathrm{CP}(\kappa,\lambda)$ holds if there is an ultrapower by a normal measure on $\kappa$ which correctly computes $\mathcal{P}(\lambda)$. $\mathrm{LCP}(\kappa,\lambda)$ is a weakening of $\mathrm{CP}(\kappa,\lambda)$ which holds if every subset of $\lambda$ is contained in some ultrapower by a normal measure on $\kappa$. After examining the basic properties of these two notions, we identify the exact consistency strength of $\mathrm{LCP}(\kappa,\kappa^+)$. Building on results of Cummings, who determined the exact consistency strength of $\mathrm{CP}(\kappa,\kappa^+)$, and using a forcing due to Apter and Shelah, we show that $\mathrm{CP}(\kappa,\lambda)$ can hold at the least measurable cardinal.

Explore related subjects

Keep this discovery

BibTeXRIS

Miha E. Habič, Radek Honzík. 2019-02-27. Capturing sets of ordinals by normal ultrapowers. https://arxiv.org/abs/1902.10638

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