2000 character limit reached
Uncountable structures are not classifiable up to bi-embeddability
Published 18 Mar 2019 in math.LO | (1903.08091v1)
Abstract: Answering some of the main questions from [MR13], we show that whenever $\kappa$ is a cardinal satisfying $\kappa{< \kappa} = \kappa > \omega$, then the embeddability relation between $\kappa$-sized structures is strongly invariantly universal, and hence complete for ($\kappa$-)analytic quasi-orders. We also prove that in the above result we can further restrict our attention to various natural classes of structures, including (generalized) trees, graphs, or groups. This fully generalizes to the uncountable case the main results of [LR05,FMR11,Wil14,CMR17].
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.