The complexity of completions in partial combinatory algebra
From MaRDI portal
Publication:6635151
Cites work
- scientific article; zbMATH DE number 3900744 (Why is no real title available?)
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 3467029 (Why is no real title available?)
- scientific article; zbMATH DE number 3503199 (Why is no real title available?)
- scientific article; zbMATH DE number 3550662 (Why is no real title available?)
- scientific article; zbMATH DE number 3556031 (Why is no real title available?)
- scientific article; zbMATH DE number 1390012 (Why is no real title available?)
- scientific article; zbMATH DE number 3216177 (Why is no real title available?)
- A journey to computably enumerable structures (tutorial lectures)
- A sufficient condition for completability of partial combinatory algebras
- Algorithmic randomness and complexity.
- Classical recursion theory. The theory of functions and sets of natural numbers
- Classical recursion theory. Vol. II
- Collapsing partial combinatory algebras
- Constructivism in mathematics. An introduction. Volume II
- Embeddings between partial combinatory algebras
- Extending partial combinatory algebras
- Extensional realizability for intuitionistic set theory
- Higher-order computability
- Introduction to Turing categories
- On the existence of extensional partial combinatory algebras
- Ordinal analysis of partial combinatory algebras
- Realizability and recursive set theory
- Realizability for constructive Zermelo-Fraenkel set theory
- Realizability. An introduction to its categorical side
- The lambda calculus. Its syntax and semantics. Rev. ed.
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)
