Back to search

University of Leeds

Structural properties of the local Turing degrees

Abstract

dc:description.abstract

In this thesis we look at some properties of the local Turing Degrees, as a partial order. We first give discussion of the Turing Degrees and certain historical results, some translated into a form resembling the constructions we look at later. Chapter 1 gives a introduction to the Turing Degrees, Chapter 2 introduces the Local Degrees. In Chapter 3 we look at minimal Turing Degrees, modifying some historical results to use a priority tree, which we use in chapter 4 to prove the new result that every c.e. degree has the (minimal) meet property. Chapter 5 uses similar methods to establish existence of a high 2 degree that does not have the meet property.

Degree

thesis:*
Name dc:type.qualificationname
Ph.D
Level dc:type.qualificationlevel
doctoral
Grantor dc:publisher.institution
University of Leeds
Year dc:date.issued
2017

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Riley, James
Advisors dc:contributor.advisor
  • Truss, John
  • Cooper, S Barry
  • Lewis-Pye, Andrew

Rights

Language dc:language.dcterms_iso639_2
eng

Identifiers

dc:identifier.*
Identifier
uk.bl.ethos.713256

Chain of custody

source
Harvested from
White Rose University Consortium
Base URL
etheses.whiterose.ac.uk/cgi/oai2
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
related terms
citation

Riley, James. Structural properties of the local Turing degrees. doctoral thesis, University of Leeds, 2017.