The complexity of completions in partial combinatory algebra
From MaRDI portal
Publication:6635151
DOI10.1017/S0960129524000252MaRDI QIDQ6635151FDOQ6635151
Authors: Sebastiaan A. Terwijn 
Publication date: 9 November 2024
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Cites Work
- Algorithmic randomness and complexity.
- Title not available (Why is that?)
- Title not available (Why is that?)
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Introduction to Turing categories
- Realizability. An introduction to its categorical side
- Higher-Order Computability
- Classical recursion theory. The theory of functions and sets of natural numbers
- Classical recursion theory. Vol. II
- Title not available (Why is that?)
- Constructivism in mathematics. An introduction. Volume 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?)
- Realizability for constructive Zermelo-Fraenkel set theory
- Extensional realizability for intuitionistic set theory
- Extending partial combinatory algebras
- Title not available (Why is that?)
- Realizability and recursive set theory
- Embeddings between partial combinatory algebras
- Collapsing partial combinatory algebras
- ORDINAL ANALYSIS OF PARTIAL COMBINATORY ALGEBRAS
- On the existence of extensional partial combinatory algebras
- A journey to computably enumerable structures (tutorial lectures)
- A sufficient condition for completability of partial combinatory algebras
This page was built for publication: The complexity of completions in partial combinatory algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635151)
