Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 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

The descriptive set-theoretical complexity of the embeddability relation on models of large size (1112.0354v3)

Published 1 Dec 2011 in math.LO

Abstract: We show that if \kappa\ is a weakly compact cardinal then the embeddability relation on (generalized) trees of size \kappa\ is invariantly universal. This means that for every analytic quasi-order R on the generalized Cantor space 2\kappa\ there is an L_{\kappa+ \kappa}-sentence \phi\ such that the embeddability relation on its models of size \kappa, which are all trees, is Borel bireducible (and, in fact, classwise Borel isomorphic) to R. In particular, this implies that the relation of embeddability on trees of size \kappa\ is complete for analytic quasi-orders. These facts generalize analogous results for \kappa=\omega\ obtained in [LR05, FMR11], and it also partially extends a result from [Bau76] concerning the structure of the embeddability relation on linear orders of size \kappa.

Summary

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