Negation Sign — Definition, Formula & Examples
The negation sign is the symbol (or sometimes ) placed before a logical statement to reverse its truth value. If a statement is true, its negation is false, and vice versa.
Given a proposition , the negation is a unary logical operator defined such that is true if and only if is false. Its truth table assigns the opposite truth value to the operand.
Key Formula
Where:
- = The negation operator, read as "not"
- = Any proposition (a statement that is either true or false)
How It Works
Place the negation sign directly before the statement you want to negate. If represents "It is raining," then represents "It is not raining." When negating a compound statement, use parentheses carefully: negates the entire conjunction, whereas negates only . The truth table has just two rows: when is T, is F; when is F, is T.
Worked Example
Problem: Let p represent the statement "5 is even." Determine the truth value of ¬p.
Step 1: Evaluate the original statement p. The number 5 is odd, so p is false.
Step 2: Apply the negation sign. Since p is false, ¬p takes the opposite truth value.
Answer: ¬p is true, meaning "5 is not even" is a true statement.
Why It Matters
You need the negation sign every time you write a contrapositive, construct a proof by contradiction, or apply De Morgan's Laws. In computer science, negation maps directly to the NOT gate in circuit design and the `!` operator in programming languages.
Common Mistakes
Mistake: Negating a compound statement by distributing the sign incorrectly, e.g., writing as .
Correction: By De Morgan's Law, . The connective flips from AND to OR (and vice versa) when you distribute a negation.
