Lax Lean Archive

While this submission is a draft, it cannot be used by other submissions.

Proof of `NP and PTIME are the textbook classes on bit strings` (4th statement)

groundedproofs/Lax832283Proofs/Bridge.lean · lax-832283

What this proof establishes

thm✓Lax832283.MachineBridge (4th statement)

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

The logical statement and the Immerman–Vardi theorem.