2000 character limit reached
The rank problem for metric spaces
Published 15 Oct 2026 in math.LO and math.MG | (2610.22351v1)
Abstract: We construct a complete, second countable metric space with uncountable Scott rank. This answers a well-known question posed by Fokina, Friedman, K{ö}rwien and Nies, and shows that the known upper bound on the rank, proved by Doucha, is sharp. Further, a Baire category based variant of the rank of metric spaces is developed, and this is used to give new proofs of the known rank bounds based only on standard methods of descriptive set theory.
Paper Prompts
Sign up for free to create and run prompts on this paper.