The graph-theoretic approach to descriptive set theory
From MaRDI portal
Publication:4902771
DOI10.2178/bsl.1804030zbMath1361.03047OpenAlexW1995113137MaRDI QIDQ4902771
Publication date: 17 January 2013
Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.bsl/1352802981
Applications of graph theory (05C90) Descriptive set theory (03E15) Classes of sets (Borel fields, (sigma)-rings, etc.), measurable sets, Suslin sets, analytic sets (28A05)
Related Items (14)
Cardinal invariants of closed graphs ⋮ THE CLASSIFICATION PROBLEM FOR AUTOMORPHISMS OF C*-ALGEBRAS ⋮ Essential countability of treeable equivalence relations ⋮ ON THE EXISTENCE OF LARGE ANTICHAINS FOR DEFINABLE QUASI-ORDERS ⋮ A dichotomy for Polish modules ⋮ Minimal definable graphs of definable chromatic number at least three ⋮ A complexity problem for Borel graphs ⋮ MEASURABLE PERFECT MATCHINGS FOR ACYCLIC LOCALLY COUNTABLE BOREL GRAPHS ⋮ BROOKS’ THEOREM FOR MEASURABLE COLORINGS ⋮ Polishness of some topologies related to word or tree automata ⋮ A determinacy approach to Borel combinatorics ⋮ A SEPARATION RESULT FOR COUNTABLE UNIONS OF BOREL RECTANGLES ⋮ CANONICAL MODELS FOR FRAGMENTS OF THE AXIOM OF CHOICE ⋮ A note on an effective Polish topology and Silver’s dichotomy theorem
Cites Work
- Unnamed Item
- Unnamed Item
- Dichotomy theorems for countably infinite dimensional analytic hypergraphs
- Borel chromatic numbers
- On co-\(\kappa\)-Souslin relations
- Type I \(C^ *\)-algebras
- Transformation groups and \(C^ *\)-algebras
- Definability of small puncture sets
- Selection theorems and treeability
- Counting the number of equivalence classes of Borel and coanalytic equivalence relations
- A dichotomy characterizing analytic digraphs of uncountable Borel chromatic number in any dimension
- THE INDEPENDENCE OF THE CONTINUUM HYPOTHESIS
This page was built for publication: The graph-theoretic approach to descriptive set theory
