Satisfiable Logic Sentence

A Satisfiable Logic Sentence is a Logic Sentence that can be True for some permutation/interpretation of the Assigned Literals.

• AKA: Satisfiable, Satisfiable Sentence, Satisfiable Formula.
• Context:
  • It can be detected by a Boolean Satisfiability Task.
  • It can be a Tautological Sentence.
• Example(s):
  • [math]\displaystyle{ x \land \lnot y }[/math].
  • any Tautological Sentence, such as [math]\displaystyle{ x \lor \lnot x }[/math].
  • …
• Counter-Example(s):
  • any Contradictory Logic Sentence.
• See: Satisfiable Binary Logic Sentence.

---

---