Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-17T22:27:53.963Z Has data issue: false hasContentIssue false

Amenable equivalence relations and Turing degrees

Published online by Cambridge University Press:  12 March 2014

Alexander S. Kechris*
Affiliation:
Department of Mathematics, California Institute of Technology, Pasadena, California 91125

Extract

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?

They had already obtained a partial answer to this question by showing that there is no such d ↦ <d with <d of order type ζ = ω* + ω on a cone. Already the possibility that <d has order type ζ · ζ was left open.

We use here, ideas and methods associated with the concept of amenability (of groups, actions, equivalence relations, etc.) to prove some general results from which one can obtain a positive answer to the above problem.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1991

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable