Article contents
The complexity of continuous embeddability between dendrites
Published online by Cambridge University Press: 12 March 2014
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
- Copyright
- Copyright © Association for Symbolic Logic 2004
References
REFERENCES
- 5
- Cited by