2019/10/17 by Hendrik Pieter Barendregt, Barendregt, H. P., S. A. Terwijn +1
Computer Science · #03B40 #03D45 #03D80 #Advanced Algebra and Logic #Computability, Logic, AI Algorithms #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO) #Logic, programming, and type systems
paper · pdf · doi:10.48550/arxiv.1910.07750
openalex publication_date 2019/10/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 properties of generalized numberings, relating properties of the numbering to properties of the pca. As in the lambda calculus, extensionality is a key notion here.