Back to the index. Or to the chambers

This article has 12 links. View as Cloud or List.

Arity Logic Operation Quantifier Signature Relation Theory Implication Contradictory Statement Conjunction Polish Notation De Morgans Laws Disjunction

Loading ...

Planetmath Browser (2008—2009)

BSD licence | A django site

All articles taken from PlanetMath.org snapshot under CC-BY-SA licence.

→ The original article on PlanetMath.org

Other Formats: LaTeX

New! You can click on formulas to copy the LaTeX source to your clipboard. | Math Videos

Negation

In logics and mathematics, negation (from Latin negare `to deny') is the unary operation “ $\lnot$ ” which swaps the truth value of any operand to the opposite truth value. So, if the statement is true then its negated statement $\lnot P$ is false, and vice versa.

Note 1. The negated statement $\lnot P$ (by Heyting) has been denoted also with (Peano), $\sim\! P$ (Russell), $\overline{P}$ (Hilbert) and (by the Polish notation).

Note 2. $\lnot P$ may be expressed by implication as

$\displaystyle P\to\curlywedge$

where $\curlywedge$ means any contradictory statement.

Note 3. The negation of logical or and logical and give the results

$\displaystyle \lnot(P\lor Q) \equiv \lnot P \land \lnot Q,\;\;\; \lnot(P\land Q) \equiv \lnot P \lor \lnot Q.$

Analogical results concern the quantifier statements:

$\displaystyle \lnot (\exists x)P(x) \equiv (\forall x)\lnot P(x),\;\;\; \lnot (\forall x)P(x) \equiv (\exists x)\lnot P(x).$

These all are known as de Morgan's laws.

Note 4. Many mathematical relation statements, expressed with such special relation symbols as $=,\, \subseteq,\, \in,\, \cong,\, \parallel,\, \mid$ , are negated by using in the symbol an additional cross line: $\neq,\, \nsubseteq,\, \notin,\, \ncong,\, \nparallel,\, \nmid$ .

1	Arity
1	Signature
1	Operation
1	Logic
1	Relation Theory
1	Implication
1	Quantifier
2	Conjunction
2	Contradictory Statement
3	Polish Notation
4	Disjunction
6	De Morgans Laws