Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Simpson, Stephen G.
1977.
HANDBOOK OF MATHEMATICAL LOGIC.
Vol. 90,
Issue. ,
p.
631.
Hájek, Petr
1978.
Higher Set Theory.
Vol. 669,
Issue. ,
p.
55.
Lachlan, A.H
and
Soare, R.I
1980.
Not every finite lattice is embeddable in the recursively enumerable degrees.
Advances in Mathematics,
Vol. 37,
Issue. 1,
p.
74.
Nerode, Anil
and
Shore, Richard A.
1980.
Reducibility orderings: Theories, definability and automorphisms.
Annals of Mathematical Logic,
Vol. 18,
Issue. 1,
p.
61.
Odifreddi, Piergiorgio
1981.
Strong reducibilities.
Bulletin of the American Mathematical Society,
Vol. 4,
Issue. 1,
p.
37.
Odifreddi, Piergiorgio
1981.
Cabal Seminar 77 – 79.
Vol. 839,
Issue. ,
p.
235.
Soare, Robert I.
1982.
Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets.
Annals of Mathematical Logic,
Vol. 22,
Issue. 1,
p.
69.
Groszek, Marcia J.
and
Slaman, Theodore A.
1983.
Independence results on the global structure of the Turing degrees.
Transactions of the American Mathematical Society,
Vol. 277,
Issue. 2,
p.
579.
Lubarsky, Robert S.
1987.
Lattices of c-degrees.
Annals of Pure and Applied Logic,
Vol. 36,
Issue. ,
p.
115.
Shore, R.A.
and
Slaman, T.A.
1989.
The P-T-degrees of the recursive sets: lattice embeddings, extensions of embeddings and the two quantifier theory.
p.
68.
Cooper, S. Barry
1990.
The jump is definable in the structure of the degrees of unsolvability.
Bulletin of the American Mathematical Society,
Vol. 23,
Issue. 1,
p.
151.
1992.
Vol. 125,
Issue. ,
p.
603.
Shore, Richard A.
and
Slaman, Theodore A.
1992.
The p-T-degrees of the recursive sets: lattice embeddings, extensions of embeddings and the two-quantifier theory.
Theoretical Computer Science,
Vol. 97,
Issue. 2,
p.
263.
Theodore, A. Slaman
1999.
Handbook of Computability Theory.
Vol. 140,
Issue. ,
p.
155.
Cooper, S. Barry
1999.
Handbook of Computability Theory.
Vol. 140,
Issue. ,
p.
121.
Boldi, Paolo
and
Vigna, Sebastiano
2000.
The turing closure of an archimedean field.
Theoretical Computer Science,
Vol. 231,
Issue. 2,
p.
143.
Ишмухаметов, Шамиль Талгатович
and
Ishmukhametov, Shamil' Talgatovich
2002.
О вложении счетных порядков в тьюринговые степени.
Математические заметки,
Vol. 72,
Issue. 5,
p.
682.
Terwijn, Sebastiaan A.
2006.
Constructive Logic and the Medvedev Lattice.
Notre Dame Journal of Formal Logic,
Vol. 47,
Issue. 1,
Downey, Rod
Greenberg, Noam
Lewis, Andrew
and
Montalbán, Antonio
2012.
Extensions of embeddings below computably enumerable degrees.
Transactions of the American Mathematical Society,
Vol. 365,
Issue. 6,
p.
2977.
Sorbi, Andrea
and
Terwijn, Sebastiaan A.
2012.
Intuitionistic logic and Muchnik degrees.
Algebra universalis,
Vol. 67,
Issue. 2,
p.
175.