Translator Disclaimer
September 2004 Almost everywhere domination
Natasha L. Dobrinen, Stephen G. Simpson
J. Symbolic Logic 69(3): 914-922 (September 2004). DOI: 10.2178/jsl/1096901775

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.

Citation

Download Citation

Natasha L. Dobrinen. Stephen G. Simpson. "Almost everywhere domination." J. Symbolic Logic 69 (3) 914 - 922, September 2004. https://doi.org/10.2178/jsl/1096901775

Information

Published: September 2004
First available in Project Euclid: 4 October 2004

zbMATH: 1075.03021
MathSciNet: MR2078930
Digital Object Identifier: 10.2178/jsl/1096901775

Rights: Copyright © 2004 Association for Symbolic Logic

JOURNAL ARTICLE
9 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.69 • No. 3 • September 2004
Back to Top