Computability in partial combinatory algebras

10/21/2019

∙

by   S. A. Terwijn, et al.

∙

0

∙

share

We prove a number of elementary facts about computability in partial combinatory algebras (pca's). We disprove a suggestion made by Kreisel about using Friedberg numberings to construct extensional pca's. We then discuss separability and elements without total extensions. We relate this to Ershov's notion of precompleteness, and we show that precomplete numberings are not 1-1 in general.