Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-13T09:59:10.299Z Has data issue: false hasContentIssue false

The complexity of continuous embeddability between dendrites

Published online by Cambridge University Press:  12 March 2014

Alberto Marcone
Affiliation:
Dipartimento di Matematica e Informatica, Università di Udine, Via Delle Scienze 208, 33100 Udine, Italy, E-mail: marcone@dimi.uniud.it
Christian Rosendal
Affiliation:
Équipe D'Analyse Fonctionnelle, Université Paris 6, Tour 46-0. Boîte 186; 4, Place Jussieu, 75252 Paris, France, E-mail: rosendal@ccr.jussieu.fr

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.

Information

Type
Research Article
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.)

Article purchase

Temporarily unavailable