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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(9 intermediate revisions by 8 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.aim.2014.07.035 / rank
Normal rank
 
Property / author
 
Property / author: John D. Clemens / rank
Normal rank
 
Property / author
 
Property / author: John D. Clemens / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03E15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 28A05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6341101 / rank
 
Normal rank
Property / zbMATH Keywords
 
dichotomy theorem
Property / zbMATH Keywords: dichotomy theorem / rank
 
Normal rank
Property / zbMATH Keywords
 
essentially countable equivalence relation
Property / zbMATH Keywords: essentially countable equivalence relation / rank
 
Normal rank
Property / zbMATH Keywords
 
essentially hyperfinite equivalence relation
Property / zbMATH Keywords: essentially hyperfinite equivalence relation / rank
 
Normal rank
Property / zbMATH Keywords
 
hypersmooth equivalence relation
Property / zbMATH Keywords: hypersmooth equivalence relation / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2079722575 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56989313 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1408.3801 / 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
links / mardi / namelinks / mardi / name
 

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