What Is a Logical Statement?
A logical statement is a declarative sentence that can be assigned a truth value—either true or false. Unlike questions or commands, it asserts a proposition that can be judged for correctness. For example, "The sky is blue" is a logical statement because it can be true or false, whereas "Close the door!" is not.
Basic Logical Symbols
- Negation ({{~}}): Represents "not". The symbol ~ applied to a proposition p yields the statement "~p", which is true exactly when p is false.
- Conjunction (∧): Means "both true". The compound statement "p ∧ q" is true only when both p and q are true.
- Disjunction (∨): Means "at least one true". The statement "p ∨ q" is true if either p, q, or both are true.
- Conditional (→): Expresses "if p then q". It asserts that whenever p is true, q must also be true.
Understanding Conditionals
The conditional connective → is central to logical reasoning. In the sentence "If it rains, then we will watch movies," the hypothesis (or antecedent) is the proposition "r" ("it rains"). The conclusion (or consequent) is "we will watch movies". The truth of the conditional depends on the relationship between these parts: if the hypothesis is true, the conclusion must also be true; if the hypothesis is false, the conditional is automatically true regardless of the conclusion.
Equivalents of a Conditional
Two forms are especially important:
- Contrapositive: The statement "¬q → ¬p" ("if not q then not p") is always logically equivalent to the original conditional "p → q". This means they share the same truth table and can be substituted for each other in proofs.
- Converse: The statement "q → p" is not generally equivalent to the original conditional. Only in special cases where the original conditional is a tautology does the converse share the same truth value.
Quantifiers in Logic
Quantifiers allow us to make statements about collections of objects.
- Universal Quantifier: Expressed with words like "all" or "every". It asserts that a property holds for every element in a domain. For example, "All birds can fly" claims the property for every bird.
- Existential Quantifier: Expressed with "some" or "there exists". It asserts that at least one object satisfies the condition. For instance, "Some birds cannot fly" states that there is at least one bird for which the property fails.
It is a common misconception that the universal quantifier is represented by the word "some"; this is false. The correct wording for a universal claim uses "all" or "every".
Tautologies and Contradictions
A tautology is a statement that is true in every possible interpretation. In a truth table, this means the final column contains only the value {{True}}. Tautologies are useful because they guarantee truth regardless of the truth values of their components.
Validity of Arguments
An argument is considered valid when its conclusion necessarily follows from its premises. In formal terms, if all premises are true, the conclusion cannot be false. Validity does not require the premises themselves to be true; it only concerns the logical connection between premises and conclusion.
Common Misconceptions
- Questions are not logical statements. For example, "Did you finish reading Chapter 6?" cannot be assigned a truth value and therefore is not a logical proposition.
- The converse of a conditional is not automatically equivalent to the original statement; only the contrapositive preserves equivalence.
- The universal quantifier is not expressed by "some"; it uses "all" or "every".
Summary Table
| Concept | Symbol | Meaning |
|---|---|---|
| Negation | ~ | "Not" – flips truth value |
| Conjunction | ∧ | Both components must be true |
| Disjunction | ∨ | At least one component true |
| Conditional | → | If antecedent then consequent |
| Contrapositive | ¬q → ¬p | Logically equivalent to original conditional |
| Universal Quantifier | ∀ | All elements satisfy the property |
| Existential Quantifier | ∃ | At least one element satisfies the property |
Applying These Concepts
When analyzing any logical argument, begin by identifying the logical statements involved—ensure they are declarative and can be true or false. Next, translate connective words into their symbolic forms (∧, ∨, →, ~). Determine whether quantifiers are universal or existential, and apply the appropriate symbols (∀, ∃). Finally, test the argument's validity by checking whether the conclusion follows necessarily from the premises, often using truth tables or logical equivalences such as the contrapositive.
Mastering these fundamentals equips you to evaluate arguments rigorously, construct sound proofs, and avoid common logical pitfalls.
