A binary logical connective, denoted

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

and read

“*\(P\)* and *\(Q\)*”,

that is ‘`true`’ if and only if

both *\(P\)* and *\(Q\)* are ‘`true`’.

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

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

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

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

false | false | false |

false | true | false |

true | false | false |

true | true | true |

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

Made with Emacs and secret alien technologies of yesteryear.