AFTD Auto-Formalizing Theoretical Domains

PrioritizedBorelForkValid

inductive

Blockwise histories: every history may stay for an arbitrary visible bit, or take a hidden excursion only when the strategy chooses that bit.

Statement

inductive PrioritizedBorelForkValid (color : List Bool → List Bool → Bool) :
    List Bool → List Bool → Prop
  | root : PrioritizedBorelForkValid color [] []
  | stay {u h} (bit : Bool) : PrioritizedBorelForkValid color u h →
      PrioritizedBorelForkValid color (u ++ [bit]) (h ++ [false])
  | exit {u h} : PrioritizedBorelForkValid color u h →
      PrioritizedBorelForkValid color (u ++ [color u h]) (h ++ [true])
Source
arXiv:2611.10136, Section 5.3.2, smallest lower-bound arena; three-move fork obstruction
Verified
12 Nov 2026
Axioms
none listed
Used by 11

Lean source view module on GitHub

inductive PrioritizedBorelForkValid (color : List Bool → List Bool → Bool) :
    List Bool → List Bool → Prop
  | root : PrioritizedBorelForkValid color [] []
  | stay {u h} (bit : Bool) : PrioritizedBorelForkValid color u h →
      PrioritizedBorelForkValid color (u ++ [bit]) (h ++ [false])
  | exit {u h} : PrioritizedBorelForkValid color u h →
      PrioritizedBorelForkValid color (u ++ [color u h]) (h ++ [true])
See it in the graphDiscuss this resultChallenge it