Lax Lean Archive

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

Proof of `PTIME by deterministic Turing machines` (1st statement)

groundedproofs/Lax535992Proofs/Bridge.lean · lax-535992

What this proof establishes

thm✓Lax535992.DeterministicMachinePTIMEComplete (1st 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 library's theorem, transported to the concept's problem along the agreement.