Proof of `First-order definable languages are exactly the aperiodic ones`
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 130 of the paper of lax-157538, Transducers
Description
Theorem C.4.11 as a biconditional, glued from its two halves taken as assumptions.