scientific article; zbMATH DE number 1531923
From MaRDI portal
Publication:4513966
zbMath0962.03033arXivmath/0001173MaRDI QIDQ4513966
Alexander S. Kechris, Randall Dougherty
Publication date: 19 November 2000
Full work available at URL: https://arxiv.org/abs/math/0001173
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexityBorel reducibilityTuring degreescountable Borel equivalence relationsTuring equivalence relation
Descriptive set theory (03E15) Descriptive set theory (topological aspects of Borel, analytic, projective, etc. sets) (54H05) Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28)
Related Items (4)
Popa superrigidity and countable Borel equivalence relations ⋮ Martin's conjecture and strong ergodicity ⋮ Continuous versus Borel reductions ⋮ Uniformity, universality, and computability theory
This page was built for publication:
