Computability by means of effectively definable schemes and definability via enumerations

Ivan N. Soskov. Computability by means of effectively definable schemes and definability via enumerations. Arch. Math. Log., 29(3):187-200, 1990. [doi]

Abstract

Abstract is missing.