2021/10/04 by Philipp Lücke, Sandra Müller, Lücke, Philipp +1
Arts and Humanities · Computer Science · Mathematics · #03E35 #03E45 #03E47 #03E55 #Advanced Topology and Set Theory #Computability, Logic, AI Algorithms #Epistemology, Ethics, and Metaphysics #FOS: Mathematics #Logic (math.LO)
paper · pdf · doi:10.48550/arxiv.2110.01468
openalex publication_date 2021/10/04 · openalex created_date 2022/10/03 · openalex updated_date 2026/07/28
Given an uncountable cardinal κ, we consider the question of whether subsets of the power set of κ that are usually constructed with the help of the Axiom of Choice are definable by Σ1-formulas that only use the cardinal κ and sets of hereditary cardinality less than κ 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 κ of length at least κ+ implies the existence of a projective well-ordering of the reals. In addition, we determine the exact consistency strength of the non-existence of Σ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 ω1.