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

After we have explained what Boolean functions and what truth tables are, it is time to use these concepts to introduce important examples of connectives.

Definition: Negation

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

\[\neg :=\begin{cases}L & \mapsto L \\
x &\mapsto \neg x \\
\end{cases}\]

defined by the following truth table:

Truth Table of the Negation
$[[x]]_I$ $[[\neg x]]_I$
\(1\) \(0\)
\(0\) \(1\)

Notes

| | | | | created: 2014-06-22 20:51:07 | modified: 2018-05-04 23:32:35 | by: bookofproofs | references: [7838]

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