Effective operations of type 2 in PCAs
Eric Faber, Jaap van Oosten · Computability · 2016
We exhibit a way of “forcing a partial functional to be realizable as effective operation” for arbitrary partial combinatory algebras (pcas). This gives a method of defining new pcas from old ones for some fixed type 2 (partial) functional, where the