Proof of `The Cook–Levin theorem, by first-order reductions` (3rd statement)

groundedproofs/Lax904597Proofs/Bridge.lean · lax-904597

What this proof establishes

no assumptions

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

SAT is existential second-order definable: guess a truth assignment and check every clause in first-order logic.