AFTD Auto-Formalizing Theoretical Domains

temporal_feasible

def

A set of (candidate, round) pairs is feasible in the general-approval embedding of a temporal election if it uses every round at most once.

Statement

def temporal_feasible {ℓ m : ℕ} (X : Finset (Fin m × Fin ℓ)) : Prop
Defined in
arXiv:2505.22513, App. A (general-approval embedding of a temporal election: feasible sets of (candidate, round) pairs)
Verified
06 Oct 2026
Axioms
none listed
Used by 1
  • is_bfjr_cohesive(α, β)-BFJR-cohesiveness (arXiv:2505.22513, Def. A.5) in the embedding of a temporal election: for every feasible X, either some Y with…

Lean source view module on GitHub

/-- Feasibility in the general-approval embedding of a temporal election: a set of (candidate, round) pairs is feasible if it uses each round at most once. -/
def temporal_feasible {ℓ m : ℕ} (X : Finset (Fin m × Fin ℓ)) : Prop :=
  ∀ p ∈ X, ∀ q ∈ X, p.2 = q.2 → p.1 = q.1
See it in the graphDiscuss this resultChallenge it