Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Maximal sets without Choice (2208.00923v1)

Published 1 Aug 2022 in math.LO

Abstract: We show that it is consistent relative to ZF, that there is no well-ordering of $\mathbb{R}$ while a wide class of special sets of reals such as Hamel bases, transcendence bases, Vitali sets or Bernstein sets exists. To be more precise, we can assume that every projective hypergraph on $\mathbb{R}$ has a maximal independent set, among a few other things. For example, we get transversals for all projective equivalence relations. Moreover, this is possible while either $\mathsf{DC}_{\omega_1}$ holds, or countable choice for reals fails. Assuming the consistency of an inaccessible cardinal, "projective" can even be replaced with "$L(\mathbb{R})$". This vastly strengthens earlier consistency results in the literature.

Summary

We haven't generated a summary for this paper yet.