This thesis investigates a notion of Turing reducibility introduced by Winkler [8] that is total on all computably enumerable oracles. Groszek and Weber show in [7] that this is a new notion of reducibility and it is not transitive. They give su...
Constructibility (Set theory). Trees (Graph theory).
This thesis investigates possible initial segments of the degrees of constructibility. Specifically, we completely characterize the structure of degrees in generic extensions of the constructible universe L via forcing with Souslin trees. Then we...
The study of twin primes gives rise to several famously difficult problems in number theory--in fact, we still cannot definitively say whether there are infinitely many twin primes. In this work, we consider a related problem, namely: What is the...
I consider the problem of extending certain invariants of subsets of natural numbers to their equivalents for subsets of larger cardinals. The two specific questions I will address are the extension of the off-branch number [Special characters...