Lax Lean Archive

While this submission is a draft, it cannot be used by other submissions.

Proof of `FO(≤) ⊊ FO(DTC): EVEN is a deterministic walk` (2nd statement)

groundedproofs/Lax945089Proofs/Bridge.lean · lax-945089

What this proof establishes

thm✓Lax945089.FirstOrderBelowTransitiveClosure (2nd statement)

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

FO(TC) definability is membership in NL, a statement of the submission on logarithmic space.