Saved in:
Bibliographic Details
Main Authors: Lutz, Patrick, Siskind, Benjamin
Format: Preprint
Published: 2023
Subjects:
Online Access:https://arxiv.org/abs/2305.19646
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866909161404497920
author Lutz, Patrick
Siskind, Benjamin
author_facet Lutz, Patrick
Siskind, Benjamin
contents Martin's Conjecture is a proposed classification of the definable functions on the Turing degrees. It is usually divided into two parts, the first of which classifies functions which are not above the identity and the second of which classifies functions which are above the identity. Slaman and Steel proved the second part of the conjecture for Borel functions which are order-preserving (i.e. which preserve Turing reducibility). We prove the first part of the conjecture for all order-preserving functions. We do this by introducing a class of functions on the Turing degrees which we call "measure-preserving" and proving that part 1 of Martin's Conjecture holds for all measure-preserving functions and also that all non-trivial order-preserving functions are measure-preserving. Our result on measure-preserving functions has several other consequences for Martin's Conjecture, including an equivalence between part 1 of the conjecture and a statement about the structure of the Rudin-Keisler order on ultrafilters on the Turing degrees.
format Preprint
id arxiv_https___arxiv_org_abs_2305_19646
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Part 1 of Martin's Conjecture for order-preserving and measure-preserving functions
Lutz, Patrick
Siskind, Benjamin
Logic
03D55, 03E60
Martin's Conjecture is a proposed classification of the definable functions on the Turing degrees. It is usually divided into two parts, the first of which classifies functions which are not above the identity and the second of which classifies functions which are above the identity. Slaman and Steel proved the second part of the conjecture for Borel functions which are order-preserving (i.e. which preserve Turing reducibility). We prove the first part of the conjecture for all order-preserving functions. We do this by introducing a class of functions on the Turing degrees which we call "measure-preserving" and proving that part 1 of Martin's Conjecture holds for all measure-preserving functions and also that all non-trivial order-preserving functions are measure-preserving. Our result on measure-preserving functions has several other consequences for Martin's Conjecture, including an equivalence between part 1 of the conjecture and a statement about the structure of the Rudin-Keisler order on ultrafilters on the Turing degrees.
title Part 1 of Martin's Conjecture for order-preserving and measure-preserving functions
topic Logic
03D55, 03E60
url https://arxiv.org/abs/2305.19646