Abstract: Building on last week's talk, we will analyze the structure of the arithmetically definable sets under two partial orders from recursion theory-the many-one degrees and the turing degrees. In particular, we will focus on results that require a forcing argument
Thinking about UNT?
It's easy to apply online. Join us and discover why we're the choice of over 46,000 students.
Apply now