Amenable equivalence relations and Turing degrees

DOI10.2307/2274913zbMath0734.03028OpenAlexW2030582980MaRDI QIDQ3360846

Alexander S. Kechris

Publication date: 1991

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://resolver.caltech.edu/CaltechAUTHORS:20130521-150404346

zbMATH Keywords

Borel setamenabilityPolish spacedeterminacyTuring degree

Mathematics Subject Classification ID

Descriptive set theory (03E15) Recursively (computably) enumerable sets and degrees (03D25) Determinacy principles (03E60)

Related Items (8)

New jump operators on equivalence relations ⋮ COUNTABLE BOREL EQUIVALENCE RELATIONS ⋮ New Dichotomies for Borel Equivalence Relations ⋮ A Glimm-Effros Dichotomy for Borel Equivalence Relations ⋮ Amenability, Kazhdan's property and percolation for trees, groups and equivalence relations ⋮ The Structure of Hyperfinite Borel Equivalence Relations ⋮ THE FILTER DICHOTOMY AND MEDIAL LIMITS ⋮ Borel equivalence relations and classifications of countable models

Cites Work

• Unnamed Item
• Unnamed Item
• Random walks and percolation on trees
• Coordinates for triangular operators algebras
• Amenability and Kunze-Stein property for groups acting on a tree
• Hyperfinite factors and amenable ergodic actions

This page was built for publication: Amenable equivalence relations and Turing degrees