BranchesHistoryFPLHelpLogin
Welcome guest
You're not logged in.
342 users online, thereof 0 logged in

Definition: Conjunction

Let \(L\) be a set of propositions with the interpretation $I$ and the corresponding valuation function $[[]]_I$. A conjunction “\(\wedge \)” is a Boolean function

\[\wedge :=\begin{cases}L \times L & \mapsto L \\
(x,y) &\mapsto x \wedge y.
\end{cases}\]

defined by the following truth table:

Truth Table of the Conjunction
$[[x]]_I$ $[[y]]_I$ $[[x \wedge y]]_I$
\(1\) \(1\) \(1\)
\(0\) \(1\) \(0\)
\(1\) \(0\) \(0\)
\(0\) \(0\) \(0\)

We read the conjunction $x\wedge y$

“$x$ and $y$”.

Notes

| | | | | created: 2014-06-22 19:24:58 | modified: 2018-05-04 23:35:45 | by: bookofproofs | references: [7838]

1.Corollary: Commutativity of Conjunction

2.Proposition: Associativity of Conjunction

Edit or AddNotationAxiomatic Method

This work was contributed under CC BY-SA 4.0 by:

This work is a derivative of:

Bibliography (further reading)

[7838] Kohar, Richard: “Basic Discrete Mathematics, Logic, Set Theory & Probability”, World Scientific, 2016