We show that the quasi-order of continuous embeddability between finitely branching dendrites (a natural class of fairly simple compacta) is \Sigma^1_1-complete. We also show that embeddability between countable linear orders with infinitely many colors is \Sigma^1_1-complete.
The complexity of continuous embeddability between dendrites
MARCONE, Alberto Giulio;
2004-01-01
Abstract
We show that the quasi-order of continuous embeddability between finitely branching dendrites (a natural class of fairly simple compacta) is \Sigma^1_1-complete. We also show that embeddability between countable linear orders with infinitely many colors is \Sigma^1_1-complete.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
