The complexity of continuous embeddability between dendrites
Marcone, Alberto ; Rosendal, Christian
J. Symbolic Logic, Tome 69 (2004) no. 1, p. 663-673 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
We show that the quasi-order of continuous embeddability between finitely branching dendrites (a natural class of fairly simple compacta) is Σ11-complete. We also show that embeddability between countable linear orders with infinitely many colors is Σ11-complete.
Publié le : 2004-09-14
Classification:  03E15,  54F15 
@article{1096901760,
     author = {Marcone, Alberto and Rosendal, Christian},
     title = {The complexity of continuous embeddability between dendrites},
     journal = {J. Symbolic Logic},
     volume = {69},
     number = {1},
     year = {2004},
     pages = { 663-673},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1096901760}
}

Marcone, Alberto; Rosendal, Christian. The complexity of continuous embeddability between dendrites. J. Symbolic Logic, Tome 69 (2004) no. 1, pp.  663-673. http://gdmltest.u-ga.fr/item/1096901760/