Camerlo, R. Order (2005) 22: 289. doi:10.1007/s11083-005-9015-8
Some examples of Σ11-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 Σ11-universality of continuous embeddability for dendrites whose branch points have order 3 is obtained.
Mathematics Subject Classification (2000)
coloured total orderBorel reducibilityΣ11-universalitydendrite