Partial combinatory algebra and generalized numberings

DOI10.1016/J.TCS.2022.04.054MaRDI QIDQ2148902zbMATH OpenOpenAlexFDO

Authors Henk Barendregt, Sebastiaan A. Terwijn

Publication date 24 June 2022

Published in Theoretical Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1910.07750

zbMATH Keywords

extensionalitypartial combinatory algebramodels of the lambda calculusprecomplete numberings

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Theory of numerations, effectively presented structures (03D45)

Recommendations

• Computability in partial combinatory algebras
• Fixed point theorems for precomplete numberings
• Generalized computable universal numberings
• Partial numberings and precompleteness
• A note on partial numberings

Cites work

• scientific article; zbMATH DE number 3875232 (Why is no real title available?)
• scientific article; zbMATH DE number 4148069 (Why is no real title available?)
• scientific article; zbMATH DE number 3827843 (Why is no real title available?)
• scientific article; zbMATH DE number 3735770 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 3536064 (Why is no real title available?)
• scientific article; zbMATH DE number 3556031 (Why is no real title available?)
• scientific article; zbMATH DE number 3216177 (Why is no real title available?)
• scientific article; zbMATH DE number 3280068 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• A Note on Positive Equivalence Relations
• A survey on universal computably enumerable equivalence relations
• Classical recursion theory. Vol. II
• Classifying positive equivalence relations
• Extensions of Scott's graph model and Kleene's second algebra
• Fixed point theorems for precomplete numberings
• GENERALIZATIONS OF THE RECURSION THEOREM
• Higher-order computability
• Index sets of quotient objects of the Post numeration
• More on Geometric Morphisms between Realizability Toposes
• Realizability. An introduction to its categorical side
• The λ-calculus is ω-incomplete
• Theorie der Numerierungen I
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication

Cited in

(4)

• Alternative Characterizations of Precomplete Numerations
• Partial combinatory algebra and generalized numberings
• Collapsing partial combinatory algebras
• On computable numberings of families of Turing degrees

This page was built for publication: Partial combinatory algebra and generalized numberings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2148902)