Negation

Mathematical Logic · Axiom Academy

Understanding the fundamental operation of logical negation in propositional logic In symbolic notation, we use the symbol ¬ (read as "not") to represent negation. If p represents a proposition, then ¬ p represents its negation. Example: Let p = "It is raining" If p is true (it is raining), then ¬ p is false If p is false (it is not raining), then ¬ p is true The truth table is a systematic way to show all possible truth values for a logical operation. For negation, since we only have one proposition p , there are only two possible cases: What happens when we negate a negation? Since negation flips the truth value, negating twice brings us back to the original value. This is formalized as the Law of Double Negation : This equivalence (denoted by ≡) means that ¬¬ p and p always have the same truth value. ¬¬ p = "It is not the case that the sky is not blue" = "The sky is blue" 4. Negation in Natural Language In everyday English, we express negation in several ways: "not" - the most direct form: "It is not raining" "It is not the case that..." - formal logical language: "It is not the case that all birds can fly" Negative prefixes - un-, in-, dis-, non-: "unhappy", "incomplete", "dishonest", "nonzero" Implicit negation - "nobody", "nothing", "never", "nowhere" Examples of translating English to logical notation: "The door is not open" → ¬ p where p = "The door is open" "It is not true that all students passed" → ¬ q where q = "All students passed"

This is the written version of the interactive lesson above. See the full Mathematical Logic course.