Use-Bounded Strong Reducibilities
dc.contributor.author | Belanger, David | |
dc.date.accessioned | 2009-08-20 13:38:41 (GMT) | |
dc.date.available | 2009-08-20 13:38:41 (GMT) | |
dc.date.issued | 2009-08-20T13:38:41Z | |
dc.date.submitted | 2009 | |
dc.identifier.uri | http://hdl.handle.net/10012/4564 | |
dc.description.abstract | We study the degree structures of the strong reducibilities $(\leq_{ibT})$ and $(\leq_{cl})$, as well as $(\leq_{rK})$ and $(\leq_{wtt})$. 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. | en |
dc.language.iso | en | en |
dc.publisher | University of Waterloo | en |
dc.subject | computability | en |
dc.subject | degree structure | en |
dc.title | Use-Bounded Strong Reducibilities | en |
dc.type | Master Thesis | en |
dc.pending | false | en |
dc.subject.program | Pure Mathematics | en |
uws-etd.degree.department | Pure Mathematics | en |
uws-etd.degree | Master of Mathematics | en |
uws.typeOfResource | Text | en |
uws.peerReviewStatus | Unreviewed | en |
uws.scholarLevel | Graduate | en |