Onm - degrees of recursively enumerable sets
- 20 Downloads
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 1.A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Nauka (1965).Google Scholar
- 2.H. S. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill (1967).Google Scholar
- 3.J. R. Shoenfield, Annals of Mathematics,69, No. 3, 644–653 (1959).Google Scholar
- 4.G. Sacks, “On degrees less than o',” Annals of Mathematics,77, No. 2, 211–231 (1963).Google Scholar
- 5.A. H. Lachlan, “A note on universal sets,” J. Symbolic Logic,31, No. 4, 573–574 (1966).Google Scholar
© Consultants Bureau 1971