Two theorems on recursively enumerable sets
- 23 Downloads
Unable to display preview. Download preview PDF.
- 1.A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Nauka, Moscow (1965).Google Scholar
- 2.H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill Series in Higher Mathematics, New York (1967).Google Scholar
- 3.R. W. Robinson, "Simplicity of recursively enumerable sets," Journal of Symb. Logic,32, No. 2 (1967).Google Scholar
- 4.R. W. Robinson, "Two theorems on hyperhypersimple sets," Transactions Amer. Math. Soc.,128, No. 1 (1967).Google Scholar
© Consultants Bureau 1968