Back to search
University of Illinois at Urbana-Champaign
A Hierarchy of Families of Recursively Enumerable Degrees and A Theorem on Bounding Minimal Pairs
Abstract
dc:descriptionThis thesis is concerned with the properties of recursivelyenumerable sets--that is, sets which can be listed by Turingmachines--and their Turing degrees. We shall use the abbreviationr.e. to stand for the phrase recursively enumerable.
Degree
thesis:*- Name thesis:degree_name
- Ph.D.
- Level thesis:degree_level
- Dissertation
- Discipline thesis:degree_discipline
- Mathematics
- Grantor
- University of Illinois at Urbana-Champaign
- Year dc:date
- 2014
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Welch, Lawrence Vaughn
Subjects
dc:subject × 1Rights
- Language dc:language
- eng
Identifiers
dc:identifier.*- Identifier
- (UMI)AAI8127730
- OAI identifier oai:identifier
- oai:www.ideals.illinois.edu:2142/68183