A binary logical connective, denoted

\[\begin{equation*} P \lor Q \end{equation*} \]

and read

that is ‘`true`’ if and only if

at least one of *\(P\)* and *\(Q\)* is true.

(Levin, 2021, sec. 0.2; Poole & Mackworth, 2017, sec. 5.1)

- Or
- Logical or
- Inclusive or
As opposed to exclusive or.

Construct the truth table for the statement *\(P \lor Q\)*.

<<scheme/org-truth-table>> (org-truth-table (lambda (p q) (or p q)) '("P" "Q" "P \\land Q"))

\(P\) | \(Q\) | \(P \land Q\) |
---|---|---|

false | false | false |

false | true | true |

true | false | true |

true | true | true |

© 2024 Rudolf Adamkovič under GNU General Public License version 3.

Made with Emacs and secret alien technologies of yesteryear.