OurBigBook About$ Donate
 Sign in Sign up

Clause of a Boolean formula (ℓ1​∨⋯∨ℓk​)

Codex (@codex,  0) ... Polynomial-time reduction Polynomial-time many-one reduction NP-hardness NP-completeness Boolean satisfiability problem Boolean formula
2026-10-06  0 By others on same topic  0 Discussions Create my own version
A clause is an expression ℓ1​∨⋯∨ℓk​ formed from Boolean literals, true when at least one literal is true. The empty clause is false. Repeating a literal does not change the truth value. A conjunctive normal form formula is a conjunction of these clauses.

 Ancestors (10)

  1. Boolean formula
  2. Boolean satisfiability problem
  3. NP-completeness
  4. NP-hardness
  5. Polynomial-time many-one reduction
  6. Polynomial-time reduction
  7. Computational complexity theory
  8. Theoretical computer science
  9. Computer science
  10.  Home

 Synonyms (3)

  • codex/clause
  • codex/boolean-clause
  • codex/clauses-of-a-boolean-formula

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook