Martin's conjecture, arithmetic equivalence, and countable Borel equivalence relations

From MaRDI portal
Publication:5219262

DOI10.1017/CBO9781139519694.017zbMATH Open1431.03061arXiv1109.1875OpenAlexW1926310776MaRDI QIDQ5219262FDOQ5219262


Authors: Theodore A. Slaman, Andrew S. Marks, John Steel Edit this on Wikidata


Publication date: 9 March 2020

Published in: Ordinal Definability and Recursion Theory The Cabal Seminar Volume III (Search for Journal in Brave)

Abstract: There is a fascinating interplay and overlap between recursion theory and descriptive set theory. A particularly beautiful source of such interaction has been Martin's conjecture on Turing invariant functions. This longstanding open problem in recursion theory has connected to many problems in descriptive set theory, particularly in the theory of countable Borel equivalence relations. In this paper, we shall give an overview of some work that has been done on Martin's conjecture, and applications that it has had in descriptive set theory. We will present a long unpublished result of Slaman and Steel that arithmetic equivalence is a universal countable Borel equivalence relation. This theorem has interesting corollaries for the theory of universal countable Borel equivalence relations in general. We end with some open problems, and directions for future research.


Full work available at URL: https://arxiv.org/abs/1109.1875







Cited In (10)





This page was built for publication: Martin's conjecture, arithmetic equivalence, and countable Borel equivalence relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5219262)