Pages that link to "Item:Q1791165"
From MaRDI portal
The following pages link to Verification of PCP-related computational reductions in Coq (Q1791165):
Displayed 8 items.
- Formalization of the computational theory of a Turing complete functional language model (Q2102949) (← links)
- Trakhtenbrot’s Theorem in Coq (Q5048993) (← links)
- Hilbert's Tenth Problem in Coq (Q5089029) (← links)
- (Q5091142) (← links)
- (Q5094119) (← links)
- (Q5094147) (← 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)