Proof of `Trakhtenbrot's theorem: finite satisfiability is RE-complete`
groundedproofs/Lax624099Proofs/Bridge.lean · lax-624099
What this proof establishes
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
Membership from the library's definition of finite satisfiability with value invention; hardness from the library's generic reduction of any problem definable with value invention to finite satisfiability. Both are transported to the concept's problem along the agreement.