Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-18T02:57:27.317Z Has data issue: false hasContentIssue false

Almost everywhere domination

Published online by Cambridge University Press:  12 March 2014

Natasha L. Dobrinen
Affiliation:
Department of Mathematics, Pennsylvania State University, 413 McAllister Bld, University Park, State College, PA 16802, USA, E-mail: dobrinen@math.psu.edu, URL: http://www.math.psu.edu/dobrinen/
Stephen G. Simpson
Affiliation:
Department of Mathematics, Pennsylvania State University, 413 McAllister Bld, University Park, State College, PA 16802, USA, E-mail: simpson@math.psu.edu, URL: http://www.math.psu.edu/simpson/

Abstract.

A Turing degree a is said to be almost everywhere dominating if, for almost all X ∈ 2ω with respect to the “fair coin” probability measure on 2ω, and for all g: ω → ω Turing reducible to X, there exists f: ω → ω of Turing degree a which dominates g. We study the problem of characterizing the almost everywhere dominating Turing degrees and other, similarly defined classes of Turing degrees. We relate this problem to some questions in the reverse mathematics of measure theory.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2004

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