The following pages link to Trakhtenbrot’s Theorem in Coq (Q5048993):
Displaying 4 items.
- Formalization of the computational theory of a Turing complete functional language model (Q2102949) (← links)
- (Q5094147) (← 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)