Lax Lean Archive

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

Proof of `PSPACE by Turing machines in bounded space` (2nd statement)

groundedproofs/Lax134656Proofs/Bridge.lean · lax-134656

What this proof establishes

thm✓Lax134656.SpaceMachinesPSPACEComplete (2nd 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 deterministic problem is PSPACE-hard, by this submission's statement, and cofinal hardness is the usual one, a statement of the core.