Proof of `P is closed under complement`
groundedproofs/Lax434930Proofs/ComplementClosure.lean · lax-434930
What this proof establishes
no assumptions
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
In the paper
- page 4 of this submission's paper
Description
Compose the output-alphabet equivalence with Boolean negation. The same machine execution then computes the complemented answer with the same time bound. Negating the correctness equivalence identifies the complement language.