We extend the priority method in α-recursion theory to certain arguments with no a priori bound on the required preservations by proving the splitting theorem for all admissible α. THEOREM: Let C be a ...
This is a preview. Log in through your library . Abstract It is shown that the four element Boolean algebra can be embedded in the recursively enumerable truth-table degrees with least and greatest ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback