8 citations · 20 across the 21 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.LO2019
Computability in partial combinatory algebras
S. A. Terwijn
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 cons…
math.LO2019★ 1 cited
Partial combinatory algebra and generalized numberings
H. P. Barendregt, S. A. Terwijn
Generalized numberings are an extension of Ershov's notion of numbering, based on partial combinatory algebra (pca) instead of the natural numbers. We study various algebraic prope…