The following pages link to (Q2852343):
Displaying 9 items.
- Metric spaces in synthetic topology (Q651311) (← links)
- On fixed-point theorems in synthetic computability (Q1683373) (← links)
- Weak call-by-value lambda calculus as a model of computation in Coq (Q1687735) (← links)
- Parametric Church's thesis: synthetic computability without choice (Q2151397) (← links)
- Call-by-value lambda calculus as a model of computation in Coq (Q2319993) (← links)
- Type-theoretic approaches to ordinals (Q2700785) (← links)
- Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version) (Q6137845) (← links)
- Synthetic undecidability and incompleteness of first-order axiom systems in Coq. Extended version (Q6156642) (← links)
- An analysis of Tennenbaum's theorem in constructive type theory (Q6563042) (← links)
