Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
I understand that the theorem is due to Spector (1956) On degrees of recursive unsolvability, Annals of Mathematics 64:581-592. It's a very nice theorem: Shore stresses its use in eliminating second-order quantification.
How are functions specified? Will your logic include the lambda-calculus (e.g., is a Henken-like calculus)? Do you want to have, say, all linear transformations?