Abstract
Computability relative to a partial function f on the natural numbers can be formalized using the notion of an oracle for this function f. This can be generalized to arbitrary partial combinatory algebras, yielding a notion of ‘adjoining a partial function to a partial combinatory algebra A’. A similar construction is known for second-order functionals, but the third-order case is more difficult. In this paper, we prove several results for this third-order case. Given a third-order functional Φ on a partial combinatory algebra A, we show how to construct a partial combinatory algebra A[Φ] where Φ is ‘computable’, and which has a ‘lax’ factorization property (Theorem 7.3 below). Moreover, we show that, on the level of first-order functions, the effect of making a third-order functional computable can be described as adding an oracle for a first-order function.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
