Computability Learning Seminar

Wednesday, April 3, 2019 3:30 pm - 3:30 pm EDT (GMT -04:00)

Michael Deveau, Department of Pure Mathematics, University of Waterloo

“Non-triviality of the Bounded Jump Hierarchy - Part 1”

Now that we have characterized when AbT Bnb,we can use this to show that the bounded jump hierarchy is not trivial at any level, relative to any B. That is, we will show that for all B, there is some set A with B <bT A <bT Bb. We begin by setting up the basic modules for the proof.

MC 5413