Location of Repository

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

Provided by:
Leicester Research Archive

Downloaded from
https://lra.le.ac.uk/bitstream/2381/9037/1/1971coopersbphd.pdf

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

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