Logical Disjunction

A Logical Disjunction is a binary Propositional Formula Connective that maps two Logic Sentences to True if any one of the Logic Sentences is True.

• AKA: ∨, Or, Inclusive Or Operation.
• Context:
  • It is a Commutative Operation.
  • It is an Idempotent Relation.
  • It is an Associative Operation.
  • It is a Distributive Relation.
  • It is a Monotone Relation.
  • It has Truth Table:

    • X	Y		X∨Y
      T	T		T
      T	F		T
      F	T		T
      F	F		F

• Example(s):
  • ∨(X,Y) or equivalently [math]\displaystyle{ X }[/math] ∨ Y.
  • …
• Counter-Example(s):
  • Logical Conjunction.
  • Logical Negation.
• See: Disjunctive Normal Form, Exclusive Logical Disjunction, Logic Clause, Propositional Logic Formula.

---

---

References

2009

• (Wikipedia, 2009) ⇒ http://en.wikipedia.org/wiki/Logical_disjunction
  • In logic and mathematics, or, also known as logical disjunction or inclusive disjunction is a logical operator that results in true whenever one or more of its operands are true. E.g. in this context, "A or B" is true if A is true, or if B is true, or if both A and B are true. In grammar, or is a coordinating conjunction. In ordinary language "or" sometimes has the meaning of exclusive disjunction.

---