P | ¬P | P ∧ ¬P |
---|---|---|
F | T | F |
T | F | F |
This represents the simplest contradiction in logic: a proposition and its negation cannot both be true simultaneously. This form is sometimes called the law of non-contradiction and is a fundamental principle in classical logic. No matter what truth value is assigned to P, the formula evaluates to false because a statement cannot be both true and false at the same time.