Embeddings between partial combinatory algebras
From MaRDI portal
Publication:6158341
DOI10.1215/00294527-2023-0002arXiv2204.03553OpenAlexW4360612139MaRDI QIDQ6158341
Anton Golov, Sebastiaan A. Terwijn
Publication date: 31 May 2023
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.03553
Applications of computability and recursion theory (03D80) Combinatory logic and lambda calculus (03B40) Other Turing degree structures (03D28)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Realizability. An introduction to its categorical side
- Realizability and recursive set theory
- Classical recursion theory. The theory of functions and sets of natural numbers
- Constructivism in mathematics. An introduction. Volume II
- Classical recursion theory. Vol. II
- Higher-Order Computability
- Theorie der Numerierungen I
- A sufficient condition for completability of partial combinatory algebras
- ORDINAL ANALYSIS OF PARTIAL COMBINATORY ALGEBRAS
- Uniformly Reflexive Structures: On the Nature of Godelizations and Relative Computability
- Extensional realizability for intuitionistic set theory
This page was built for publication: Embeddings between partial combinatory algebras
