cnf_vars
def
The set var(F) of variables occurring in a CNF formula F, given as a finite set of clauses, each a finite set of literals.
Statement
def cnf_vars {V : Type*} [DecidableEq V] (F : Finset (Finset (CnfLit V))) : Finset V
- Defined in
- Short Resolution Refutations for CNFs with Bounded Weighted Incidence Treewidth, arXiv:2610.02047, Sec. 3.1 (variables of a CNF formula)
- Verified
- 06 Oct 2026
- Axioms
- none listed
- Built on 2
- cnf_lit_varThe variable of a literal: var(x) = var(not x) = x.
- CnfLitA CNF literal over a variable type V is either a positive variable or a negated variable.
- Used by 3
- cnf_incidence_treewidth_emptyThe incidence treewidth of the empty formula is 0.
- cnf_incidence_treewidth_le_cardUniversal upper bound: the incidence treewidth of any CNF formula F is at most |vars(F)| + |F|.
- cnf_incidence_graphThe incidence graph G*(F) of a CNF formula F: the bipartite graph whose vertices are the variables of F and the clauses of F, a variable x…
Lean source view module on GitHub
/-- The variables of a CNF formula given as a finite set of clauses, each a finite set of literals. -/ def cnf_vars {V : Type*} [DecidableEq V] (F : Finset (Finset (CnfLit V))) : Finset V := F.biUnion fun C => C.image cnf_lit_var