A statement which connects two other statements using the
Disjunction is a binary truth-function, the output of which
is a sentence true if at least one of the input sentences
(disjuncts) is true, and false otherwise.
The truth table of p OR q (also written as
pq (logic), p || q (computer science), or p + q (electronics))
is as follows: