Hostname: page-component-cd9895bd7-dzt6s Total loading time: 0 Render date: 2024-12-23T05:45:19.653Z Has data issue: false hasContentIssue false
  • English
  • Français

The complexity of continuous embeddability between dendrites

Published online by Cambridge University Press:  12 March 2014

Alberto Marcone  and
Christian Rosendal
Alberto Marcone
Affiliation:
Dipartimento di Matematica e Informatica, Università di Udine, Via Delle Scienze 208, 33100 Udine, Italy, E-mail: [email protected]
Christian Rosendal
Affiliation:
Équipe D'Analyse Fonctionnelle, Université Paris 6, Tour 46-0. Boîte 186; 4, Place Jussieu, 75252 Paris, France, E-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract.

We show that the quasi-order of continuous embeddability between finitely branching dendrites (a natural class of fairly simple compacta) is -complete. We also show that embeddability between countable linear orders with infinitely many colors is -complete.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 69 , Issue 3 , September 2004 , pp. 663 - 673
Copyright
Copyright © Association for Symbolic Logic 2004

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[BK96]Becker, Howard and Kechris, Alexander S., The descriptive set theory of Polish group actions, Cambridge University Press, Cambridge, 1996.CrossRefGoogle Scholar
[CDM02]Camerlo, Riccardo, Darji, Udayan B. and Marcone, Alberto, Classification problems in continuum theory, preprint, 2002.Google Scholar
[FS89]Friedman, Harvey and Stanley, Lee, A Borel reducibility theory for classes of countable structures, this Journal, vol. 54 (1989), no. 3, pp. 894–914.Google Scholar
[Hjo00]Hjorth, Greg, Classification and orbit equivalence relations, American Mathematical Society, Providence, RI, 2000.Google Scholar
[Kec95]Kechris, Alexander S., Classical descriptive set theory, Graduate Texts in Mathematics, no. 156, Springer-Verlag, New York, 1995.CrossRefGoogle Scholar
[Lav71]Laver, Richard, On Fraïssé's order type conjecture, Annals of Mathematics (2), vol. 93 (1971), pp. 89–111.CrossRefGoogle Scholar
[LR02]Louveau, Alain and Rosendal, Christian, Complete analytic equivalence relations, preprint, 2002.Google Scholar
[Nad92]Nadler, Sam B. Jr., Continuum theory, Marcel Dekker Inc., New York, 1992.Google Scholar