Gao, Su (2002) Some applications of the Adams-Kechris technique. Proceedings of the American Mathematical Society, 130 (3). pp. 863-874. ISSN 0002-9939. doi:10.1090/S0002-9939-01-06082-8. https://resolver.caltech.edu/CaltechAUTHORS:20170408-140337226
Full text is not posted in this repository. Consult Related URLs below.
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20170408-140337226
Abstract
We analyze the technique used by Adams and Kechris (2000) to obtain their results about Borel reducibility of countable Borel equivalence relations. Using this technique, we show that every Σ_1^1 equivalence relation is Borel reducible to the Borel bi-reducibility of countable Borel equivalence relations. We also apply the technique to two other classes of essentially uncountable Borel equivalence relations and derive analogous results for the classification problem of Borel automorphisms.
| Item Type: | Article | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Related URLs: |
| |||||||||
| Additional Information: | © 2001 American Mathematical Society. Received by editor(s): February 10, 2000. Received by editor(s) in revised form: August 13, 2000, and August 23, 2000. Published electronically: June 20, 2001. (Communicated by Carl G. Jockusch, Jr.) | |||||||||
| Subject Keywords: | Borel equivalence relations, Borel (bi-)reducibility | |||||||||
| Issue or Number: | 3 | |||||||||
| DOI: | 10.1090/S0002-9939-01-06082-8 | |||||||||
| Record Number: | CaltechAUTHORS:20170408-140337226 | |||||||||
| Persistent URL: | https://resolver.caltech.edu/CaltechAUTHORS:20170408-140337226 | |||||||||
| Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. | |||||||||
| ID Code: | 75911 | |||||||||
| Collection: | CaltechAUTHORS | |||||||||
| Deposited By: | 1Science Import | |||||||||
| Deposited On: | 19 Apr 2017 18:34 | |||||||||
| Last Modified: | 15 Nov 2021 16:56 |
Repository Staff Only: item control page
