Publication:2852343
From MaRDI portal
zbMath1273.03144MaRDI QIDQ2852343
Publication date: 8 October 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066106001861
03G30: Categorical logic, topoi
03F65: Other constructive mathematics
68Q01: General topics in the theory of computing
03D75: Abstract and axiomatic computability and recursion theory
Related Items
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, 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, Type-theoretic approaches to ordinals