Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Zakharov, S. D.
1986.
Degrees of denumerability reducibilities.
Algebra and Logic,
Vol. 25,
Issue. 2,
p.
75.
Cooper, S. Barry
1987.
Enumeration Reducibility Using Bounded Information: Counting Minimal Covers.
Mathematical Logic Quarterly,
Vol. 33,
Issue. 6,
p.
537.
Cooper, S. Barry
1990.
Recursion Theory Week.
Vol. 1432,
Issue. ,
p.
57.
Sorbi, Andrea
1990.
On some filters and ideals of the Medvedev lattice.
Archive for Mathematical Logic,
Vol. 30,
Issue. 1,
p.
29.
Copestake, C. S.
1990.
Mathematical Logic.
p.
257.
Lachlan, Alistair H.
and
Shore, Richard A.
1992.
Then-rea enumeration degrees are dense.
Archive for Mathematical Logic,
Vol. 31,
Issue. 4,
p.
277.
Copestake, Kate
1997.
On Nondeterminism, Enumeration Reducibility and Polynomial Bounds.
Mathematical Logic Quarterly,
Vol. 43,
Issue. 3,
p.
287.
Ahmad, Seema
and
Lachlan, Alistair H.
1998.
Some Special Pairs of Σ2 e‐Degrees.
Mathematical Logic Quarterly,
Vol. 44,
Issue. 4,
p.
431.
Slaman, Theodore A.
and
Sorbi, A.
1998.
Quasi-minimal enumeration degrees and minimal Turing degrees.
Annali di Matematica Pura ed Applicata,
Vol. 174,
Issue. 1,
p.
97.
Sorbi, Andrea
1998.
Sets of generators and automorphism bases for the enumeration degrees.
Annals of Pure and Applied Logic,
Vol. 94,
Issue. 1-3,
p.
263.
Odifreddi, Piergiorgio
1999.
Handbook of Computability Theory.
Vol. 140,
Issue. ,
p.
89.
Cooper, S. Barry
Li, Angsheng
Sorbi, Andrea
and
Yang, Yue
2003.
There exists a maximal 3-C.E. enumeration degree.
Israel Journal of Mathematics,
Vol. 137,
Issue. 1,
p.
285.
Arslanov, M.M.
Chong, C.T.
Cooper, S.B.
and
Yang, Y.
2005.
The minimal e-degree problem in fragments of Peano arithmetic.
Annals of Pure and Applied Logic,
Vol. 131,
Issue. 1-3,
p.
159.
Omanadze, Roland Sh.
and
Sorbi, Andrea
2006.
Strong Enumeration Reducibilities.
Archive for Mathematical Logic,
Vol. 45,
Issue. 7,
p.
869.
Soskova, Mariya Ivanova
and
Wu, Guohua
2007.
Computation and Logic in the Real World.
Vol. 4497,
Issue. ,
p.
727.
Soskova, Mariya Ivanova
2008.
Logic and Theory of Algorithms.
Vol. 5028,
Issue. ,
p.
554.
SOSKOVA, MARIYA IVANOVA
and
WU, GUOHUA
2009.
Cupping Δ20 enumeration degrees to 0e′.
Mathematical Structures in Computer Science,
Vol. 19,
Issue. 1,
p.
169.
Harris, Charles M.
2010.
Goodness in the enumeration and singleton degrees.
Archive for Mathematical Logic,
Vol. 49,
Issue. 6,
p.
673.
Arslanov, Marat M.
and
Sorbi, Andrea
2017.
Logic Colloquium '98.
p.
44.
Ganchev, Hristo A.
Soskova, Mariya I.
and
Löwe, Benedikt
2018.
The jump hierarchy in the enumeration degrees.
Computability,
Vol. 7,
Issue. 2-3,
p.
179.