Papers
Topics
Authors
Recent
Search
2000 character limit reached

$Σ_1$-definability at higher cardinals: Thin sets, almost disjoint families and long well-orders

Published 4 Oct 2021 in math.LO | (2110.01468v2)

Abstract: Given an uncountable cardinal $\kappa$, we consider the question of whether subsets of the power set of $\kappa$ that are usually constructed with the help of the Axiom of Choice are definable by $\Sigma_1$-formulas that only use the cardinal $\kappa$ and sets of hereditary cardinality less than $\kappa$ as parameters. For limits of measurable cardinals, we prove a perfect set theorem for sets definable in this way and use it to generalize two classical non-definability results to higher cardinals. First, we show that a classical result of Mathias on the complexity of maximal almost disjoint families of sets of natural numbers can be generalized to measurable limits of measurables. Second, we prove that for a limit of countably many measurable cardinals, the existence of a simply definable well-ordering of subsets of $\kappa$ of length at least $\kappa+$ implies the existence of a projective well-ordering of the reals. In addition, we determine the exact consistency strength of the non-existence of $\Sigma_1$-definitions of certain objects at singular strong limit cardinals. Finally, we show that both large cardinal assumptions and forcing axioms cause analogs of these statements to hold at the first uncountable cardinal $\omega_1$.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.