The effective theory of Borel equivalence relations
From MaRDI portal
Publication:636325
DOI10.1016/j.apal.2009.10.002zbMath1223.03031arXiv0907.0802MaRDI QIDQ636325
Sy-David Friedman, Ekaterina B. Fokina, Asger Törnquist
Publication date: 26 August 2011
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0907.0802
03E15: Descriptive set theory
03D30: Other degrees and reducibilities in computability and recursion theory
03D60: Computability and recursion theory on ordinals, admissible sets, etc.
Related Items
Classes of Polish spaces under effective Borel isomorphism, Isomorphism relations on computable structures, Turing computable embeddings of equivalences other than isomorphism, Wadge hardness in Scott spaces and its effectivization, Agreement reducibility, Implicit definability in arithmetic, Reducibilities among equivalence relations induced by recursively enumerable structures, The theory of ceers computes true arithmetic, On computably enumerable structures, On \(\Delta_2^0\)-categoricity of equivalence relations, Graphs realised by r.e. equivalence relations, The Borel complexity of von Neumann equivalence, UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS, FINITARY REDUCIBILITY ON EQUIVALENCE RELATIONS, 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10, On Σ1 1 equivalence relations over the natural numbers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Descriptive set theory
- Classical recursion theory. Vol. II
- Recent developments in the theory of Borel reducibility
- Counting the number of equivalence classes of Borel and coanalytic equivalence relations
- A Glimm-Effros Dichotomy for Borel Equivalence Relations
- New Directions in Descriptive Set Theory
- Measure and category in effective descriptive set theory
- COUNTABLE BOREL EQUIVALENCE RELATIONS
- Set Theory
