Fixed point theorems for minimal numberings

Abstract

Abstract This paper considers various forms of the fixed point theorem (Kleene’s recursion theorem with and without parameters, Arslanov’s and Ershov’s recursion theorems) in arbitrary numberings. We prove that the classes of minimal numberings satisfying different of the listed forms of the fixed point theorem are pairwise distinct.