Primitive Recursion on the Partial Continuous Functionals

Minimal Logic for Computable Functions

“…[{(ut,i>i):i G -0]r, and the result should have as its value the supremum of all V{ with i such that the value of r extendsIn order to deal with this difficulty we must extend our notion of a primitive recursive term by some more term-forming Operations. For the details we refer the reader to[13].…”