Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
COLE, JOSHUA A.
and
SIMPSON, STEPHEN G.
2007.
MASS PROBLEMS AND HYPERARITHMETICITY.
Journal of Mathematical Logic,
Vol. 07,
Issue. 02,
p.
125.
Simpson, Stephen G.
2007.
Almost everywhere domination and superhighness.
Mathematical Logic Quarterly,
Vol. 53,
Issue. 4-5,
p.
462.
Simpson, Stephen G.
2007.
Mass problems and almost everywhere domination.
Mathematical Logic Quarterly,
Vol. 53,
Issue. 4-5,
p.
483.
Simpson, Stephen G.
2009.
Mass Problems and Measure-Theoretic Regularity.
The Bulletin of Symbolic Logic,
Vol. 15,
Issue. 4,
p.
385.
Kjos-Hanssen , Bjørn
and
Nies , Andrée
2009.
Superhighness.
Notre Dame Journal of Formal Logic,
Vol. 50,
Issue. 4,
BARMPALIAS, GEORGE
and
MORPHETT, ANTHONY
2009.
Non-cupping, measure and computably enumerable splittings.
Mathematical Structures in Computer Science,
Vol. 19,
Issue. 1,
p.
25.
Franklin, Johanna N.Y.
and
Stephan, Frank
2011.
Van Lambalgen's Theorem and High Degrees.
Notre Dame Journal of Formal Logic,
Vol. 52,
Issue. 2,
Simpson, Stephen G.
2011.
Mass problems associated with effectively closed sets.
Tohoku Mathematical Journal,
Vol. 63,
Issue. 4,
Morphett, A.
2012.
Prompt enumerations and relative randomness.
Journal of Logic and Computation,
Vol. 22,
Issue. 4,
p.
877.
Barmpalias, George
2012.
Tracing and domination in the Turing degrees.
Annals of Pure and Applied Logic,
Vol. 163,
Issue. 5,
p.
500.
Avigad, Jeremy
Dean, Edward T.
and
Rute, Jason
2012.
Algorithmic randomness, reverse mathematics, and the dominated convergence theorem.
Annals of Pure and Applied Logic,
Vol. 163,
Issue. 12,
p.
1854.
Conidis, Chris J.
2012.
Effectively approximating measurable sets by open sets.
Theoretical Computer Science,
Vol. 428,
Issue. ,
p.
36.