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’.

[1, Sec. 0.2], [9, Sec. 5.1]


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