Essential countability of treeable equivalence relations (Q406286): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.aim.2014.07.035 / rank
Normal rank
 
Property / cites work
 
Property / cites work: The Structure of Hyperfinite Borel Equivalence Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Glimm-Effros Dichotomy for Borel Equivalence Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selection theorems and treeability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4323294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The classification of hypersmooth Borel equivalence relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borel chromatic numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The graph-theoretic approach to descriptive set theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting the number of equivalence classes of Borel and coanalytic equivalence relations / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.AIM.2014.07.035 / rank
 
Normal rank

Latest revision as of 16:40, 9 December 2024

scientific article
Language Label Description Also known as
English
Essential countability of treeable equivalence relations
scientific article

    Statements

    Essential countability of treeable equivalence relations (English)
    0 references
    0 references
    0 references
    0 references
    8 September 2014
    0 references
    dichotomy theorem
    0 references
    essentially countable equivalence relation
    0 references
    essentially hyperfinite equivalence relation
    0 references
    hypersmooth equivalence relation
    0 references

    Identifiers