Pages that link to "Item:Q4902771"
From MaRDI portal
The following pages link to The graph-theoretic approach to descriptive set theory (Q4902771):
Displaying 14 items.
- Essential countability of treeable equivalence relations (Q406286) (← links)
- Cardinal invariants of closed graphs (Q1617948) (← links)
- A complexity problem for Borel graphs (Q2238048) (← links)
- A determinacy approach to Borel combinatorics (Q2792320) (← links)
- CANONICAL MODELS FOR FRAGMENTS OF THE AXIOM OF CHOICE (Q4977217) (← links)
- ON THE EXISTENCE OF LARGE ANTICHAINS FOR DEFINABLE QUASI-ORDERS (Q5107221) (← links)
- Minimal definable graphs of definable chromatic number at least three (Q5149654) (← links)
- A SEPARATION RESULT FOR COUNTABLE UNIONS OF BOREL RECTANGLES (Q5222522) (← links)
- A note on an effective Polish topology and Silver’s dichotomy theorem (Q5233981) (← links)
- THE CLASSIFICATION PROBLEM FOR AUTOMORPHISMS OF C*-ALGEBRAS (Q5346686) (← links)
- Polishness of some topologies related to word or tree automata (Q5376660) (← links)
- MEASURABLE PERFECT MATCHINGS FOR ACYCLIC LOCALLY COUNTABLE BOREL GRAPHS (Q5738201) (← links)
- BROOKS’ THEOREM FOR MEASURABLE COLORINGS (Q5739905) (← links)
- A dichotomy for Polish modules (Q6161732) (← links)