Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Barmpalias, George
and
Montalbán, Antonio
2007.
A Cappable Almost Everywhere Dominating Computably Enumerable Degree.
Electronic Notes in Theoretical Computer Science,
Vol. 167,
Issue. ,
p.
17.
Simpson, Stephen G.
2007.
Mass problems and almost everywhere domination.
Mathematical Logic Quarterly,
Vol. 53,
Issue. 4-5,
p.
483.
Simpson, Stephen G.
2007.
Almost everywhere domination and superhighness.
Mathematical Logic Quarterly,
Vol. 53,
Issue. 4-5,
p.
462.
Kjos-Hanssen , Bjørn
and
Nies , Andrée
2009.
Superhighness.
Notre Dame Journal of Formal Logic,
Vol. 50,
Issue. 4,
Simpson, Stephen G.
2009.
Mass Problems and Measure-Theoretic Regularity.
The Bulletin of Symbolic Logic,
Vol. 15,
Issue. 4,
p.
385.
BARMPALIAS, GEORGE
and
MORPHETT, ANTHONY
2009.
Non-cupping, measure and computably enumerable splittings.
Mathematical Structures in Computer Science,
Vol. 19,
Issue. 1,
p.
25.
Csima, Barbara F.
and
Kalimullin, Iskander S.
2010.
Degree spectra and immunity properties.
Mathematical Logic Quarterly,
Vol. 56,
Issue. 1,
p.
67.
Kjos-Hanssen, Bjørn
and
Reimann, Jan
2010.
Programs, Proofs, Processes.
Vol. 6158,
Issue. ,
p.
229.
Simpson, Stephen G.
2011.
Mass problems associated with effectively closed sets.
Tohoku Mathematical Journal,
Vol. 63,
Issue. 4,
Hinman, Peter G.
2012.
A Survey of Mučnik and Medvedev Degrees.
The Bulletin of Symbolic Logic,
Vol. 18,
Issue. 2,
p.
161.
Barmpalias, George
Miller, Joseph S.
and
Nies, André
2012.
Randomness notions and partial relativization.
Israel Journal of Mathematics,
Vol. 191,
Issue. 2,
p.
791.
Downey, Rod
and
Greenberg, Noam
2012.
Strong jump-traceability II: K-triviality.
Israel Journal of Mathematics,
Vol. 191,
Issue. 2,
p.
647.
Barmpalias, George
2012.
Tracing and domination in the Turing degrees.
Annals of Pure and Applied Logic,
Vol. 163,
Issue. 5,
p.
500.
Downey, Rod
and
Greenberg, Noam
2013.
Pseudo-jump inversion, upper cone avoidance, and strong jump-traceability.
Advances in Mathematics,
Vol. 237,
Issue. ,
p.
252.
Bienvenu, Laurent
Hölzl, Rupert
Miller, Joseph S.
and
Nies, André
2014.
Denjoy, Demuth and density.
Journal of Mathematical Logic,
Vol. 14,
Issue. 01,
p.
1450004.
Stephan, Frank
and
Yu, Liang
2014.
A reducibility related to being hyperimmune-free.
Annals of Pure and Applied Logic,
Vol. 165,
Issue. 7-8,
p.
1291.
Faizrahmanov, M. Kh.
2014.
On arithmetical level of the class of superhigh sets.
Russian Mathematics,
Vol. 58,
Issue. 5,
p.
43.
Bienvenu, Laurent
and
Patey, Ludovic
2017.
Diagonally non-computable functions and fireworks.
Information and Computation,
Vol. 253,
Issue. ,
p.
64.
Hirschfeldt, Denis R.
Jockusch, Carl G.
and
Schupp, Paul E.
2024.
Coarse computability, the density metric, Hausdorff distances between Turing degrees, perfect trees, and reverse mathematics.
Journal of Mathematical Logic,
Vol. 24,
Issue. 02,