The descriptive set-theoretical complexity of the embeddability relation on models of large size

Details The descriptive set-theoretical complexity of the embeddability relation on models of large size The descriptive set-theoretical complexity of the embeddability relation on models of large size

2011-12-01

arxiv.org/abs/1112.0354v1

Mathematics

Logic

40 pages, preprint, submitted

Scientific paper

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 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.

Affiliated with

Also associated with

No associations

Rating

The descriptive set-theoretical complexity of the embeddability relation on models of large size does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The descriptive set-theoretical complexity of the embeddability relation on models of large size, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The descriptive set-theoretical complexity of the embeddability relation on models of large size will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-139546