Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published March 1991 | Published
Journal Article Open

Amenable Equivalence Relations and Turing Degrees

Abstract

In [12] Slaman and Steel posed the following problem: Assume ZF + DC + AD. Suppose we have a function assigning to each Turing degree d a linear order <_d of d. Then must the rationals embed order preservingly in <_d for a cone of d's?

Additional Information

© 1991 Association for Symbolic Logic. Received July 19, 1989; revised February 1, 1990. This research was partially supported by NSF grant DMS-8718847.

Attached Files

Published - 2274913.pdf

Files

2274913.pdf
Files (309.3 kB)
Name Size Download all
md5:703dd44d82d83ada13f2ac097aba8406
309.3 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
March 5, 2024