Proof of `FO(TC) definability is closed under first-order reductions` (1st statement)
groundedproofs/Lax485149Proofs/Bridge.lean · lax-485149
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.
Description
FO(TC) definability reads a problem on finite structures only.