Recursion in total functionals of finite type
Recursion theoretic operators and morphisms on numbered sets
Recursive expansions
Let A be a recursive structure, and let ψ be a recursive infinitary sentence involving a new relation symbol. The main result of the paper gives syntactical conditions which are necessary and sufficient for every recursive copy of A to have a recursive expansion to a model of ψ, provided A satisfies certain decidability conditions. The decidability conditions involve a notion of rank. The main result is applied to prove some earlier results of Metakides-Nerode and Goncharov. In these applications,...
Recursively enumerable classes and their application to recursive sequences of formal theories.
Relatively constructible transitive models
Relativizations of the P = NP problem over the complex number field.