Proof of `Locally definable construction sequences from chains`
groundedproofs/Lax185574Proofs/ChainConstructionSequences.lean · lax-185574
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.
In the paper
- page 39 of this submission's paper
Description
The statement for graphs and , from the version for simple graphs: the algorithm is the program with its exponent, the script of a graph is that of its simple graph, and the constants stay the same.