Abstract. We define, in the spirit of Fenstad [2], a higher type computation theory, and show that countable recursion over the continuous functionals forms ...

Abstract. We define, in the spirit of Fenstad [2], a higher type computation theory, and show that countable recursion over the continuous functionals forms ...

We define, in the spirit of Fenstad [2], a higher type computation theory, and show that countable recursion over the continuous functionals forms such a ...

Abstract. We define, in the spirit of Fenstad [2], a higher type computation theory, and show that countable recursion over the continuous functionals forms ...

In this paper we will consider two types of problems both concerning the recursion theory of the continuous or countable functionalsa.

This chapter discusses the axiomatic recursive function theory. The results of Wagner-Strong theory are general and they hold for all basic recursive ...

Nov 15, 2018 · It is well known that many theorems in recursion theory can be “relativized”. This means that they remain true if partial recursive ...

The purpose of this paper is to describe the present state of knowledge and the major unsolved problems in this area what I call the intrinsic recursion theory ...

Generalized recursion theory can be many different things. Starting from ordinary recursion theory one may e.g. move up in.

We consider the logical properties of partially continuous functions defined by various transformers and, in particular, by macrotransformers over labeled ...