Abstract
We provide a natural characterization of the type two Mehlhorn–Cook–Urquhart basic feasible functionals as the provably total type two functionals of our (classical) applicative theory PT introduced in (Inform. Comput. 185 (2003) 263), thus providing a proof of a result claimed in the conclusion of Strahm (2003). This further characterization of the basic feasible functionals underpins their importance as a key candidate for the notion of type two feasibility.
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.
