Partial combinatory algebra and generalized numberings
From MaRDI portal
Publication:2148902
DOI10.1016/J.TCS.2022.04.054OpenAlexW2981017762MaRDI QIDQ2148902FDOQ2148902
Authors: Henk Barendregt, Sebastiaan A. Terwijn 
Publication date: 24 June 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.07750
Combinatory logic and lambda calculus (03B40) Theory of numerations, effectively presented structures (03D45)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
- Title not available (Why is that?)
- Realizability. An introduction to its categorical side
- A Note on Positive Equivalence Relations
- Higher-order computability
- Classical recursion theory. Vol. II
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theorie der Numerierungen I
- The λ-calculus is ω-incomplete
- Classifying positive equivalence relations
- Title not available (Why is that?)
- GENERALIZATIONS OF THE RECURSION THEOREM
- Title not available (Why is that?)
- Index sets of quotient objects of the Post numeration
- A survey on universal computably enumerable equivalence relations
- More on Geometric Morphisms between Realizability Toposes
- Extensions of Scott's graph model and Kleene's second algebra
- Fixed point theorems for precomplete numberings
- Title not available (Why is that?)
Cited In (4)
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)
