Abstract
dc:description.abstractWe study the degree structures of the strong reducibilities (\leqibT) and (\leqcl), as well as (\leqrK) and (\leqwtt). We show that any noncomputable c.e. set is part of a uniformly c.e. copy of $(\BQ,\leq)$ in the c.e. cl-degrees within a single wtt-degree; that there exist uncountable chains in each of the degree structures in question; and that any countable partially-ordered set can be embedded into the cl-degrees, and any finite partially-ordered set can be embedded into the ibT-degrees. We also offer new proofs of results of Barmpalias and Lewis-Barmpalias concerning the non-existence of cl-maximal sets.
Degree
thesis:*- Grantor dc:publisher
- University of Waterloo
- Year dc:date.issued
- 2009
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Belanger, David
Subjects
dc:subject × 2Rights
- Language dc:language.iso
- en
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- http://hdl.handle.net/10012/4564