Rudolf Adamkovič Personal site


Conjunction

A binary logical connective, denoted

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

and read

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

that is ‘trueif and only if

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

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


© 2024 Rudolf Adamkovič under GNU General Public License version 3.
Made with Emacs and the secret alien technologies of yesteryear.