SearcharxivSearch

arXiv · 1710.09766

$\Sigma_1(\kappa)$-definable subsets of $\mathrm{H}(\kappa^+)$

Abstract

We study $\Sigma_1(\omega_1)$-definable sets (i.e. sets that are equal to the collection of all sets satisfying a certain $\Sigma_1$-formula with parameter $\omega_1$) in the presence of large cardinals. Our results show that the existence of a Woodin cardinal and a measurable cardinal above it imply that no well-ordering of the reals is $\Sigma_1(\omega_1)$-definable, the set of all stationary subsets of $\omega_1$ is not $\Sigma_1(\omega_1)$-definable and the complement of every $\Sigma_1(\omega_1)$-definable Bernstein subset of ${}^{\omega_1}\omega_1$ is not $\Sigma_1(\omega_1)$-definable. In contrast, we show that the existence of a Woodin cardinal is compatible with the existence of a $\Sigma_1(\omega_1)$-definable well-ordering of $\mathrm{H}({\omega_2})$ and the existence of a $\Delta_1(\omega_1)$-definable Bernstein subset of ${}^{\omega_1}\omega_1$. We also show that, if there are infinitely many Woodin cardinals and a measurable cardinal above them, then there is no $\Sigma_1(\omega_1)$-definable uniformization of the club filter on $\omega_1$. Moreover, we prove a perfect set theorem for $\Sigma_1(\omega_1)$-definable subsets of ${}^{\omega_1}\omega_1$, assuming that there is a measurable cardinal and the non-stationary ideal on $\omega_1$ is saturated. The proofs of these results use iterated generic ultrapowers and Woodin's $\mathbb{P}_{\mathrm{max}}$-forcing. Finally, we also prove variants of some of these results for $\Sigma_1(\kappa)$-definable subsets of ${}^{\kappa}\kappa$, in the case where $\kappa$ itself has certain large cardinal properties.

Explore related subjects

Keep this discovery

BibTeXRIS

Philipp Lücke, Ralf Schindler, Philipp Schlicht. 2017-10-26. $\Sigma_1(\kappa)$-definable subsets of $\mathrm{H}(\kappa^+)$. https://arxiv.org/abs/1710.09766

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