Version history

Submission versions

  1. lax-362205current version

    The Immerman–Szelepcsényi Theorem

  2. lax-733996viewing

    The Immerman–Szelepcsényi Theorem

    GitHub sourceShown on this page

Proof of `Correctness of rejection by counting`

groundedproofs/Lax733996Proofs/Complement.lean · lax-733996

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.

Read the Lean proof on GitHub

In the paper

  • page 3 of this submission's paper

Description

Apply the nonreachability certificate to each possible accepting configuration.