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 When attempting to generalize recursion theory to admissible ordinals, it may seem as if all classical priority constructions can be lifted to ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback