Abstract
Some examples of Σ1 1-universal preorders are presented, in the form of various relations of embeddability between countable coloured total orders. As an application, strengthening a theorem of (Marcone, A. and Rosendal, C.: The Complexity of Continuous Embeddability between Dendrites, J. Symb. Log. 69 (2004), 663–673), the Σ1 1-universality of continuous embeddability for dendrites whose branch points have order 3 is obtained.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Friedman, H. and Stanley, L.: A Borel reducibility theory for classes of countable structures, J. Symb. Log. 54 (1989), 894–914.
Hjorth, G.: Classification and Orbit Equivalence Relations, American Mathematical Society 2000.
Kechris, A. S.: Classical Descriptive Set Theory, Springer, 1995.
Laver, R.: On Fraïssé’s order type conjecture, Ann. Math. 93 (1971), 89–111.
Louveau, A. and Rosendal, C.: Relations d’équivalence analytiques complètes, Comptes Rendus de l’Académie des Sciences. Série I 333 (2001), 903–906.
Marcone, A.: Foundations of bqo theory, Trans. Am. Math. Soc. 345 (1994), 641–660.
Marcone, A. and Rosendal, C.: The Complexity of Continuous Embeddability between Dendrites, J. Symb. Log. 69 (2004), 663–673.
Nadler Jr., S. B.: Continuum Theory, Dekker, 1992.
Rosenstein, J. G.: Linear Orderings, Academic Press, 1982.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Camerlo, R. Universality of Embeddability Relations for Coloured Total Orders. Order 22, 289–300 (2005). https://doi.org/10.1007/s11083-005-9015-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11083-005-9015-8