Hostname: page-component-745bb68f8f-mzp66 Total loading time: 0 Render date: 2025-02-05T19:57:19.439Z Has data issue: false hasContentIssue false
  • English
  • Français

Initial segments of the degrees of unsolvability Part II: minimal degrees

Published online by Cambridge University Press:  12 March 2014

C. E. M. Yates
C. E. M. Yates*
Affiliation:
The University, Manchester, England
Get access Rights & Permissions [Opens in a new window]

Extract

The first of this sequence of papers [21] surveyed the progress that has been made in embedding partially ordered sets as initial segments of the uncountable upper semilattice D of degrees of unsolvability. The principal concern of the present and subsequent parts will be with initial segments of the countable upper semilattice D (≦0(1)) of degrees ≦0(1); a summary appeared in [21].

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 35 , Issue 2 , June 1970 , pp. 243 - 266
Copyright
Copyright © Association for Symbolic Logic 1970

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Dekker, J. C. E., A theorem on hypersimple sets, Proceedings of the American Mathematical Society, vol. 5 (1954), pp. 791–796.CrossRefGoogle Scholar
[2]Friedberg, R. M., Two recursively enumerable sets of incomparable degrees of unsolvability, Proceedings of the National Academy of Sciences of the United States of America, vol. 43 (1957), pp. 236–238.CrossRefGoogle ScholarPubMed
[3]Friedberg, R. M., The fine structure of degrees of unsolvability of recursively enumerable sets, Summaries of Cornell Univ. Summer Inst. for Symbolic Logic, 1957, pp. 404–406.Google Scholar
[4]Friedberg, R. M., Three theorems on recursive enumeration, this Journal, vol. 23 (1958), pp. 309–316.Google Scholar
[5]Hugill, D. F., Initial segments of Turing degrees, Proceedings of the London Mathematical Society, vol. 19 (1969), pp. 1–16.CrossRefGoogle Scholar
[6]Hugill, D. F. and Lachlan, A. H., Distributive initial segments of the degrees of unsolvability, Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 14 (1968), pp. 457–472.Google Scholar
[7]Martin, D. A., Classes of recursively enumerable sets and degrees of unsolvability, Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 12 (1966), pp. 295–310.CrossRefGoogle Scholar
[8]Mučnic, A. A., Negative answer to the problem of reducibility of the theory of algorithms, Doklady Akademii Nauk SSSR, vol. 108 (1956), pp. 194–197. (Russian)Google Scholar
[9]Post, E. L., Recursively enumerable sets of positive integers and their decision problems, Bulletin of the American Mathematical Society, vol. 50 (1944), pp. 284–316.CrossRefGoogle Scholar
[10]Rogers, H. Jr., Theory of recursive functions and effective computability, McGraw-Hill, New York, 1968.Google Scholar
[11]Sacks, G. E., A minimal degree less than 0′, Bulletin of the American Mathematical Society, vol. 67 (1961), pp. 416–419.CrossRefGoogle Scholar
[12]Sacks, G. E., On the degrees less than 0′, Annals of mathematics, vol. 77 (1963), pp. 211–231.CrossRefGoogle Scholar
[13]Sacks, G. E., Degrees of unsolvability, Annals of Mathematics Studies No. 55, Princeton University Press, Princeton, N.J., 1963.Google Scholar
[14]Sacks, G. E., The recursively enumerable degrees are dense. Annals of mathematics, vol. 80 (1964), pp. 300–312.CrossRefGoogle Scholar
[15]Shoenfield, J. R., A theorem on minimal degrees, this Journal, vol. 31 (1966), pp. 539–544.Google Scholar
[16]Spector, C., On degrees of recursive unsolvability, Annals of mathematics, vol. 64 (1956), pp. 581–592.CrossRefGoogle Scholar
[17]Yates, C. E. M., Three theorems on the degrees of recursively enumerable sets, Duke mathematical journal, vol. 32 (1965), pp. 461–468.CrossRefGoogle Scholar
[18]Yates, C. E. M., On the degrees of index sets, Transactions of the American Mathematical Society, vol. 121 (1966), pp. 309–328.CrossRefGoogle Scholar
[19]Yates, C. E. M., Recursively enumerable degrees and the degrees less than 0(1), Sets, models and recursion theory, North-Holland, Amsterdam, 1967, pp. 264–271.CrossRefGoogle Scholar
[20]Yates, C. E. M., Density and incomparability in the degrees less than 0(1), this Journal, vol. 31 (1966), pp. 301–302.Google Scholar
[21]Yates, C. E. M., Initial segments of the degrees of unsolvability: Part I: A survey, Mathematical logic and the foundations of set theory, North-Holland, Amsterdam, 1969.Google Scholar