The complexity of continuous embeddability between dendrites

DOI10.2178/JSL/1096901760MaRDI QIDQ5311746zbMATH OpenOpenAlexFDO

Authors Alberto Marcone, Christian Rosendal

Publication date 29 August 2005

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.460.9182

zbMATH Keywords

\(\boldsymbol\Sigma_1^1\)-complete relationBorel reducibilitydendriteembedding

Mathematics Subject Classification ID

Descriptive set theory (03E15) Continua and generalizations (54F15) Topological spaces of dimension (leq 1); curves, dendrites (54F50)

Recommendations

• Universality of embeddability relations for coloured total orders
• Classification problems in continuum theory
• Representing quasi-orders by embeddability ordering of families of topological spaces
• scientific article; zbMATH DE number 495572
• The descriptive set-theoretical complexity of the embeddability relation on models of large size

Cites work

• A Borel reductibility theory for classes of countable structures
• scientific article; zbMATH DE number 976831 (Why is no real title available?)
• scientific article; zbMATH DE number 1388189 (Why is no real title available?)
• On Fraissé's order type conjecture

Cited in

(7)

• Universality of embeddability relations for coloured total orders
• Anti-classification results for groups acting freely on the line
• Invariantly universal analytic quasi-orders
• Group actions on dendrites and curves
• Classification problems in continuum theory
• Universal analytic preorders arising from surjective functions
• Piecewise convex embeddability on linear orders

This page was built for publication: The complexity of continuous embeddability between dendrites

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311746)