The complexity of continuous embeddability between dendrites (Q5311746): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On Fraissé's order type conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Borel reductibility theory for classes of countable structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4933738 / rank
 
Normal rank

Latest revision as of 15:45, 10 June 2024

scientific article; zbMATH DE number 2199951
Language Label Description Also known as
English
The complexity of continuous embeddability between dendrites
scientific article; zbMATH DE number 2199951

    Statements

    The complexity of continuous embeddability between dendrites (English)
    0 references
    0 references
    0 references
    29 August 2005
    0 references
    Borel reducibility
    0 references
    dendrite
    0 references
    embedding
    0 references
    \(\boldsymbol\Sigma_1^1\)-complete relation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references