journal article Jan 31, 2007

An extension of the recursively enumerable Turing degrees

View at Publisher Save 10.1112/jlms/jdl015
Topics

No keywords indexed for this article. Browse by subject →

Metrics
27
Citations
0
References
Details
Published
Jan 31, 2007
Vol/Issue
75(2)
Pages
287-297
License
View
Cite This Article
Stephen G. Simpson (2007). An extension of the recursively enumerable Turing degrees. Journal of the London Mathematical Society, 75(2), 287-297. https://doi.org/10.1112/jlms/jdl015
Related

You May Also Like

On Representatives of Subsets

P. Hall · 1935

1,249 citations

Eine Bemerkung Über Ungerade Schlichte Funktionen

M. Fekete, G. Szegö · 1933

452 citations

Morita Theory for Derived Categories

Jeremy Rickard · 1989

449 citations