Lax Lean Archive

Proof of `Trakhtenbrot's theorem: finite satisfiability is undecidable`

groundedproofs/Lax624099Proofs/Bridge.lean · lax-624099

What this proof establishes

thm✓Lax624099.Trakhtenbrot

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

Description

Finite satisfiability is RE-hard, and every RE-hard problem is undecidable.