Proof of `First-order model checking on nowhere dense classes in almost linear time`
groundedproofs/Lax3Proofs/SolveMachine.lean · lax-3
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.
Description
The complete concrete word-RAM model checker, with one program and one almost-linear time bound chosen before all graphs and word lengths.