`UniqueSolutionXOR`

definition

show as: view math explainer →

module: IndisputableMonolith.Complexity.SAT.XOR
domain: Complexity
line: 104 · github
papers citing: none yet

open explainer

Generate a durable explainer page for this declaration.

open lean source

IndisputableMonolith.Complexity.SAT.XOR on GitHub at line 104.

browse module

All declarations in this module, on Recognition.

explainer page

Tracked in the explainer inventory; generation is lazy so crawlers do not trigger LLM jobs.

open explainer

depends on

used by

formal source

 101  ∃ a : Assignment n, evalCNF a ψ.φ = true ∧ satisfiesSystem a ψ.H
 102
 103/-- Unique solution under XOR constraints. -/
 104def UniqueSolutionXOR {n} (ψ : CNFWithXOR n) : Prop :=
 105  ∃! a : Assignment n, evalCNF a ψ.φ = true ∧ satisfiesSystem a ψ.H
 106
 107end SAT
 108end Complexity
 109end IndisputableMonolith

papers checked against this theorem

No papers in the current corpus map onto this theorem yet.