Proof : Suppose every partial negation of Ω is consistent.
the question posed at the outset of this article was: for a constraint set CON with k constraints that map candidates to natural numbers, what is the cardinality of the largest set of candidates S such that, for each subset t ⊆ S, there is at least one ranking R CON under which every t in t is optimal, but no s in S − t is optimal?