Abstract
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.
Citation
Alberto Marcone. Christian Rosendal. "The complexity of continuous embeddability between dendrites." J. Symbolic Logic 69 (3) 663 - 673, September 2004. https://doi.org/10.2178/jsl/1096901760
Information
