Computability In Partial Combinatory Algebras
Work
Year: 2020
Type: article
Abstract: 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 p... more
Source: Bulletin of Symbolic Logic
Author Sebastiaan A. Terwijn
Institution Radboud University Nijmegen
Cites: 31
Cited by: 1
Related to: 10
FWCI:
Citation percentile (by year/subfield): 34.97
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green