Negation in Discrete Mathematics [ English ]

Languages

• English

1. Introduction to Negation

In discrete mathematics, logical reasoning often involves analyzing not only what is true, but also what is not true. The logical operator that allows us to reverse the truth value of a proposition is called negation.

Negation is one of the most fundamental operations in logic and serves as the basis for more complex logical constructions.

2. Definition of Negation

A negation is a unary logical operation that reverses the truth value of a proposition.

Formal Definition:

If p is a proposition, then its negation is written as:

¬p

• If p is true, then ¬p is false
• If p is false, then ¬p is true

3. Symbol and Representation

The symbol used for negation is:

¬

Interpretation:

• ¬p is read as:

  • “not p”
  • “it is not the case that p”

4. Truth Table of Negation

Explanation:

• Negation simply flips the truth value
• It is the simplest logical operation

5. Examples of Negation (Formally Correct)

Example 1: Simple Proposition

Let:

• p: It is raining

Then:

¬p

means: It is not raining

Example 2: Numerical Statement

Let:

• p: 5 is even (False)

Then:

¬p → True

✔ Since the original statement is false, its negation is true.

Example 3: Using Predicates

Let:

• p(x): x > 0

Then:

¬p(x): x ≤ 0

✔ This is still a predicate, not a proposition, until a value is assigned.

Converting into a Proposition

Case 1: Let x = 3

• p(3): 3 > 0 → True
• ¬p(3) → False

Case 2: Let x = -2

• p(-2): -2 > 0 → False
• ¬p(-2) → True

6. Negation of Compound Propositions

Negation can also be applied to compound statements.

(a) Negation of Conjunction

¬(p ∧ q) ≡ ¬p ∨ ¬q

(b) Negation of Disjunction

¬(p ∨ q) ≡ ¬p ∧ ¬q

These are known as De Morgan’s Laws.

7. Double Negation Law

¬(¬p) ≡ p

Explanation:

Negating a statement twice returns the original statement.

8. Real-Life Interpretation

Negation is commonly used in everyday reasoning:

• “It is not raining”
• “The system is not active”
• “The number is not positive”

In programming:

if (!condition)

9. Applications of Negation

(a) Computer Science

• Conditional statements
• Boolean logic
• Program control flow

(b) Mathematics

• Proof techniques
• Defining complements

(c) Logic

• Constructing opposite statements
• Analyzing arguments

10. Summary

• Negation reverses the truth value of a proposition

• Represented using ¬

• Truth table simply flips values

• Works with both simple and compound propositions

• Follows important laws such as:

  • De Morgan’s Laws
  • Double Negation Law