Lax Lean Archive

Proof of `The inclusion chain of complexity classes` (2nd statement)

groundedproofs/Lax434930Proofs/NLPolynomialTime.lean · lax-434930

What this proof establishes

no assumptions

thm✓Lax434930.BasicProperties (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

In the paper

  • page 4 of this submission's paper

Description

A finite deterministic stack machine computes reachability in a polynomial-size encoding of the original logarithmic-space machine's configurations. The checked compiler gives polynomial running time and the original acceptance definition gives the characteristic function.