On equivalence relations and bounded turing degrees
Date of Issue2018-07-31
School of Physical and Mathematical Sciences
This thesis examines three areas in computability theory. In Chapter 2 we look at certain classes of equivalence relations under computable reducibility. In Chapters 3 and 4 we examine the bounded jump operator and the notion of highness for the bounded jump. In Chapter 5 we look at different ways of effectivizing the properties of a dominant function.