NOT  

Definition  
Truth table  
Logic gate  
Normal forms  
Disjunctive  
Conjunctive  
Zhegalkin polynomial  
Post's lattices  
0preserving  no 
1preserving  no 
Monotone  no 
Affine  yes 
Selfdual  yes 
Logical connectives  



Related concepts  
Applications  
Category  
In logic, negation, also called the logical not or logical complement, is an operation that takes a proposition to another proposition "not ", standing for " is not true", written , or . It is interpreted intuitively as being true when is false, and false when is true.^{[1]}^{[2]} Negation is thus a unary logical connective. It may be applied as an operation on notions, propositions, truth values, or semantic values more generally. In classical logic, negation is normally identified with the truth function that takes truth to falsity (and vice versa). In intuitionistic logic, according to the Brouwer–Heyting–Kolmogorov interpretation, the negation of a proposition is the proposition whose proofs are the refutations of .
An operand of a negation is a negand,^{[3]} or negatum.^{[3]}
Classical negation is an operation on one logical value, typically the value of a proposition, that produces a value of true when its operand is false, and a value of false when its operand is true. Thus if statement is true, then (pronounced "not P") would then be false; and conversely, if is true, then would be false.
The truth table of is as follows:
True  False 
False  True 
Negation can be defined in terms of other logical operations. For example, can be defined as (where is logical consequence and is absolute falsehood). Conversely, one can define as for any proposition Q (where is logical conjunction). The idea here is that any contradiction is false, and while these ideas work in both classical and intuitionistic logic, they do not work in paraconsistent logic, where contradictions are not necessarily false. In classical logic, we also get a further identity, can be defined as , where is logical disjunction.
Algebraically, classical negation corresponds to complementation in a Boolean algebra, and intuitionistic negation to pseudocomplementation in a Heyting algebra. These algebras provide a semantics for classical and intuitionistic logic.
The negation of a proposition p is notated in different ways, in various contexts of discussion and fields of application. The following table documents some of these variants:
Notation  Plain text  Vocalization 

¬p , 7p^{[4]}  Not p  
~p  Not p  
p  Not p  
En p  
p' 
 
̅p 
 
!p 

The notation is Polish notation.
In set theory, is also used to indicate 'not in the set of': is the set of all members of U that are not members of A.
Regardless how it is notated or symbolized, the negation can be read as "it is not the case that P", "not that P", or usually more simply as "not P".
As a way of reducing the number of necessary parentheses, one may introduce precedence rules: ¬ has higher precedence than ∧, ∧ higher than ∨, and ∨ higher than →. So for example, is short for
Here is a table that shows a commonly used precedence of logical operators.^{[5]}
Operator  Precedence 

1  
2  
3  
4  
5 
Within a system of classical logic, double negation, that is, the negation of the negation of a proposition , is logically equivalent to . Expressed in symbolic terms, . In intuitionistic logic, a proposition implies its double negation, but not conversely. This marks one important difference between classical and intuitionistic negation. Algebraically, classical negation is called an involution of period two.
However, in intuitionistic logic, the weaker equivalence does hold. This is because in intuitionistic logic, is just a shorthand for , and we also have . Composing that last implication with triple negation implies that .
As a result, in the propositional case, a sentence is classically provable if its double negation is intuitionistically provable. This result is known as Glivenko's theorem.
De Morgan's laws provide a way of distributing negation over disjunction and conjunction:
Let denote the logical xor operation. In Boolean algebra, a linear function is one such that:
If there exists , , for all .
Another way to express this is that each variable always makes a difference in the truthvalue of the operation, or it never makes a difference. Negation is a linear logical operator.
In Boolean algebra, a self dual function is a function such that:
for all . Negation is a self dual logical operator.
In firstorder logic, there are two quantifiers, one is the universal quantifier (means "for all") and the other is the existential quantifier (means "there exists"). The negation of one quantifier is the other quantifier ( and ). For example, with the predicate P as "x is mortal" and the domain of x as the collection of all humans, means "a person x in all humans is mortal" or "all humans are mortal". The negation of it is , meaning "there exists a person x in all humans who is not mortal", or "there exists someone who lives forever".
There are a number of equivalent ways to formulate rules for negation. One usual way to formulate classical negation in a natural deduction setting is to take as primitive rules of inference negation introduction (from a derivation of to both and , infer ; this rule also being called reductio ad absurdum), negation elimination (from and infer ; this rule also being called ex falso quodlibet), and double negation elimination (from infer ). One obtains the rules for intuitionistic negation the same way but by excluding double negation elimination.
Negation introduction states that if an absurdity can be drawn as conclusion from then must not be the case (i.e. is false (classically) or refutable (intuitionistically) or etc.). Negation elimination states that anything follows from an absurdity. Sometimes negation elimination is formulated using a primitive absurdity sign . In this case the rule says that from and follows an absurdity. Together with double negation elimination one may infer our originally formulated rule, namely that anything follows from an absurdity.
Typically the intuitionistic negation of is defined as . Then negation introduction and elimination are just special cases of implication introduction (conditional proof) and elimination (modus ponens). In this case one must also add as a primitive rule ex falso quodlibet.
As in mathematics, negation is used in computer science to construct logical statements.
if (!(r == t))
{
/*...statements executed when r does NOT equal t...*/
}
The exclamation mark "!
" signifies logical NOT in B, C, and languages with a Cinspired syntax such as C++, Java, JavaScript, Perl, and PHP. "NOT
" is the operator used in ALGOL 60, BASIC, and languages with an ALGOL or BASICinspired syntax such as Pascal, Ada, Eiffel and Seed7. Some languages (C++, Perl, etc.) provide more than one operator for negation. A few languages like PL/I and Ratfor use ¬
for negation. Most modern languages allow the above statement to be shortened from if (!(r == t))
to if (r != t)
, which allows sometimes, when the compiler/interpreter is not able to optimize it, faster programs.
In computer science there is also bitwise negation. This takes the value given and switches all the binary 1s to 0s and 0s to 1s. See bitwise operation. This is often used to create ones' complement or "~
" in C or C++ and two's complement (just simplified to "
" or the negative sign since this is equivalent to taking the arithmetic negative value of the number) as it basically creates the opposite (negative value equivalent) or mathematical complement of the value (where both values are added together they create a whole).
To get the absolute (positive equivalent) value of a given integer the following would work as the "
" changes it from negative to positive (it is negative because "x < 0
" yields true)
unsigned int abs(int x)
{
if (x < 0)
return x;
else
return x;
}
To demonstrate logical negation:
unsigned int abs(int x)
{
if (!(x < 0))
return x;
else
return x;
}
Inverting the condition and reversing the outcomes produces code that is logically equivalent to the original code, i.e. will have identical results for any input (depending on the compiler used, the actual instructions performed by the computer may differ).
In C (and some other languages descended from C), double negation (!!x
) is used as an idiom to convert x
to a canonical Boolean, ie. an integer with a value of either 0 or 1 and no other. Although any integer other than 0 is logically true in C and 1 is not special in this regard, it is sometimes important to ensure that a canonical value is used, for example for printing or if the number is subsequently used for arithmetic operations.^{[6]}
The convention of using !
to signify negation occasionally surfaces in ordinary written speech, as computerrelated slang for not. For example, the phrase !voting
means "not voting". Another example is the phrase !clue
which is used as a synonym for "noclue" or "clueless".^{[7]}^{[8]}
In Kripke semantics where the semantic values of formulae are sets of possible worlds, negation can be taken to mean settheoretic complementation^{[citation needed]} (see also possible world semantics for more).
Common logical connectives  

Common logical symbols  

General  

Theorems (list) and paradoxes  
Logics 
 
Set theory 
 
Formal systems (list), language and syntax 
 
Proof theory  
Model theory  
Computability theory  
Related  