Proof of `Model Checking for Σ₁ Reduces to Positive Σ₁`

groundedproofs/Lax496464Proofs/WHierarchy/Lemmas/NegElim/Final.lean · lax-496464

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

Description

p−MC(Σ1)≤fptp−MC(Σ1+)p-MC(Σ_1) ≤fpt p-MC(Σ_1⁺) (Flum–Grohe, Lemma 6.11). The universe is first compressed to the entries of the tuples and ∣x∣|x| further elements (a Σ1Σ_1-formula of size at most ∣x∣|x| cannot tell the difference); the structure is then expanded by the order << and, per symbol RR, by its first tuple, its last tuple, its consecutive pairs and ZRZ_R (the universe if RR is empty), and every negative literal is replaced by a positive existential formula over these (¬x=y¬ x = y by x<y∨y<xx < y ∨ y < x). The new parameter is at most 72k72 k, and the map is computed by an IMP+ program in O(∣x∣3)O(|x|³) steps.