Sciweavers

7 search results - page 1 / 2
» Almost everywhere domination and superhighness
Sort
View
MLQ
2007
91views more  MLQ 2007»
13 years 4 months ago
Almost everywhere domination and superhighness
Let ω denote the set of natural numbers. For functions f, g : ω → ω, we say that f is dominated by g if f(n) < g(n) for all but finitely many n ∈ ω. We consider the st...
Stephen G. Simpson
ENTCS
2007
91views more  ENTCS 2007»
13 years 4 months ago
A Cappable Almost Everywhere Dominating Computably Enumerable Degree
We show that there exists an almost everywhere (a.e.) dominating computably enumerable (c.e.) degree which is half of a minimal pair.
George Barmpalias, Antonio Montalbán
MLQ
2007
72views more  MLQ 2007»
13 years 4 months ago
Mass problems and almost everywhere domination
We examine the concept of almost everywhere domination from the viewpoint of mass problems. Let AED and MLR be the set of reals which are almost everywhere dominating and Martin-L...
Stephen G. Simpson
JSYML
2006
62views more  JSYML 2006»
13 years 4 months ago
Uniform almost everywhere domination
Abstract. We explore the interaction between Lebesgue measure and dominating functions. We show, via both a priority construction and a forcing construction, that there is a functi...
Peter Cholak, Noam Greenberg, Joseph S. Miller
JSYML
2006
59views more  JSYML 2006»
13 years 4 months ago
On a conjecture of Dobrinen and Simpson concerning almost everywhere domination
Stephen Binns, Bjørn Kjos-Hanssen, Manuel L...