First steps in synthetic computability theory
From MaRDI portal
Recommendations
Cited in
(17)- On fixed-point theorems in synthetic computability
- Weak call-by-value lambda calculus as a model of computation in Coq
- Parametric Church's thesis: synthetic computability without choice
- Call-by-value lambda calculus as a model of computation in Coq
- Genericity of weakly computable objects
- Type-theoretic approaches to ordinals
- scientific article; zbMATH DE number 4021127 (Why is no real title available?)
- scientific article; zbMATH DE number 19486 (Why is no real title available?)
- Effective topos as a synthetic universe for the theory of computation
- Synthetic Undecidability and Incompleteness of First-Order Axiom Systems in Coq
- Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version)
- Synthetic undecidability and incompleteness of first-order axiom systems in Coq. Extended version
- Metric spaces in synthetic topology
- An analysis of Tennenbaum's theorem in constructive type theory
- Undecidability of semi-unification on a napkin
- The Kleene-Post and Post's theorem in the calculus of inductive constructions
- Spreen spaces and the synthetic Kreisel-Lacombe-Shoenfield-Tseitin theorem
This page was built for publication: First steps in synthetic computability theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2852343)
