Skip to main content
Article thumbnail
Location of Repository

Degrees of Unsolvability

By Stuart Barry Cooper

Abstract

Thesis submitted in partial fulfilment of the requirements for the degree of Doctor of Philosophy at the University of Leicester Awarded 1971

Publisher: University of Leicester
Year: 1971
OAI identifier: oai:lra.le.ac.uk:2381/9037

Suggested articles

Citations

  1. (1957). A criterion for completeness of degrees of unsolvability, doi
  2. (1968). A dichotomy of the recursively enumerable sets, doi
  3. (1966). A minimal pair of recursively entmerable degrees, doi
  4. A minimal pair of recursively enumerable degrees, doi
  5. (1955). Creative sets,
  6. (1963). Degrees of Unsolvability, doi
  7. (1957). Friedberg: Acriterion for completeness of degrees of unsolvability, doi
  8. Initial segments of the degrees of unsolvabiiity, Part
  9. (1968). Initial segments of the degrees of unsolvability, Part I: A survey, doi
  10. (1970). Initial segments of the degrees of unsolvability, Part II: Minimal dogreos, doi
  11. Jockusch: The degrees of hyperhyperimmune sets, doi
  12. Lachlan: Lower bounds for pairs of recursively enumerable degrees, doi
  13. (1966). Lower bounds for pairs of recursively enumerable degrees, doi
  14. Minimal degrees and the Jump Operator,, to appear. 2: S. Feferman, Degrees 4±' unsolvability associated with classes of formalised theories,
  15. (1956). On degrees of recursive unsolvability, doi
  16. (1956). On degrees of recursive unsolvabilitys, doi
  17. On degrees of unsolvability, doi
  18. (1959). On degrees of unsolvability, Annals of 2cath., rag doi
  19. On relative complements for recursively enumerable degrees, doi
  20. On the joins of pairs of minimal degrees, doi
  21. Partitions induced by the jump operator ,
  22. Recursively en=erable sets of positive Integers and their decision problems, doi
  23. (1955). Recursively enumerable sets of positive integers and their decision problems, doi
  24. (1963). Sacks: Degrees of unsolvability, Annals of mathematics studies, no. 55, doi
  25. Shoenfield: Atheorem on minimal degrees,
  26. (1966). Sub-lattices of the recursively enterable degrees,
  27. (1970). The diophantine nature of recursively enumerable sets (Russian), Dokladi Akad. Nauk
  28. (1967). Theory of Recursive Functions and Effective Computability, doi
  29. (1968). Uniformly intro-reducible sets,

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.