The Big Idea
Mathematics rarely works with isolated statements for long. We deny claims, join them, offer alternatives, describe consequences, and state when two conditions mean the same thing. Words such as not, and, or, and if…then perform this work.
A logical connective is an operation that forms a compound proposition from one or more propositions. Each connective has a precise truth condition: a rule that tells us when the compound proposition is true or false.
This is one place where ordinary language becomes mathematical structure. Once the structure is visible, we can test reasoning systematically instead of relying only on how a sentence sounds.
Letters Can Stand for Whole Propositions
Let
- \(p\): “\(18\) is even,” and
- \(q\): “\(18\) is divisible by \(3\).”
Both \(p\) and \(q\) are true. Here the letters do not represent numbers. They stand for complete propositions and can take the truth values \(T\) or \(F\).
We can now write \(\neg p\), \(p\land q\), \(p\lor q\), \(p\to q\), and \(p\leftrightarrow q\). These symbolic forms help us see the logical construction without repeatedly writing the full sentences.
The Five Core Connectives
| Name | Symbolic form | Usual reading | Basic truth condition |
|---|---|---|---|
| Negation | \(\neg p\) | not \(p\) | Reverses the truth value of \(p\) |
| Conjunction | \(p\land q\) | \(p\) and \(q\) | True only when both parts are true |
| Disjunction | \(p\lor q\) | \(p\) or \(q\) | True when at least one part is true |
| Conditional | \(p\to q\) | if \(p\), then \(q\) | False only when \(p\) is true and \(q\) is false |
| Biconditional | \(p\leftrightarrow q\) | \(p\) if and only if \(q\) | True when both parts have the same truth value |
Symbols vary slightly among books and fields. You may see \({\sim}p\) for negation, \(p\mathbin{\&}q\) for conjunction, or \(p\supset q\) for a conditional. The notation changes; the truth conditions remain the central idea.
Negation: Not
Negation is a unary connective: it acts on one proposition. The negation \(\neg p\) is true exactly when \(p\) is false, and false exactly when \(p\) is true.
| \(p\) | \(\neg p\) |
|---|---|
| \(T\) | \(F\) |
| \(F\) | \(T\) |
If \(p\) is “\(18\) is even,” then \(\neg p\) is “\(18\) is not even.” Because \(p\) is true, \(\neg p\) is false.
A precise negation denies exactly the original claim. The negation of “Every integer is positive” is “At least one integer is not positive,” not the much stronger sentence “No integer is positive.”
Conjunction: And
The conjunction \(p\land q\) claims that both \(p\) and \(q\) are true. A single false component makes the entire conjunction false.
Using our propositions, \(p\land q\) says:
\[ 18\text{ is even and }18\text{ is divisible by }3. \]
This conjunction is true because both component propositions are true.
| \(p\) | \(q\) | \(p\land q\) |
|---|---|---|
| \(T\) | \(T\) | \(T\) |
| \(T\) | \(F\) | \(F\) |
| \(F\) | \(T\) | \(F\) |
| \(F\) | \(F\) | \(F\) |
In ordinary speech, the word “but” usually carries contrast or surprise. Logically, however, “\(p\), but \(q\)” normally has the same truth condition as \(p\land q\).
Disjunction: Or
The disjunction \(p\lor q\) claims that at least one of its components is true. Standard mathematical “or” is inclusive: the compound proposition is still true when both parts are true.
| \(p\) | \(q\) | \(p\lor q\) |
|---|---|---|
| \(T\) | \(T\) | \(T\) |
| \(T\) | \(F\) | \(T\) |
| \(F\) | \(T\) | \(T\) |
| \(F\) | \(F\) | \(F\) |
The sentence “\(18\) is even or \(18\) is divisible by \(3\)” is true. In fact, both parts are true, which is allowed by inclusive disjunction.
Everyday language sometimes uses an exclusive or: one option or the other, but not both. Exclusive disjunction may be written \(p\oplus q\). It is true when the component propositions have different truth values.
When the distinction matters, state it. “Choose soup or salad, but not both” is exclusive; “submit a passport or birth certificate” may permit either or both, depending on the policy.
Conditional: If…Then
The conditional \(p\to q\) is read “if \(p\), then \(q\).” The proposition \(p\) is the antecedent or hypothesis, and \(q\) is the consequent or conclusion.
For example:
\[ \text{If an integer is divisible by }4,\text{ then it is even.} \]
The conditional promises that every case satisfying the antecedent also satisfies the consequent. It fails only when the antecedent is true but the consequent is false.
| \(p\) | \(q\) | \(p\to q\) |
|---|---|---|
| \(T\) | \(T\) | \(T\) |
| \(T\) | \(F\) | \(F\) |
| \(F\) | \(T\) | \(T\) |
| \(F\) | \(F\) | \(T\) |
The final two rows can feel unusual at first. If \(p\) is false, the conditional has not been broken: it made a promise only about cases where \(p\) is true. This is sometimes called vacuous truth.
Suppose a sign says, “If a figure is a square, then it has four sides.” A triangle does not disprove the rule because it never satisfied the “square” condition. To disprove the conditional, we would need a square that did not have four sides.
Recognizing Conditional Language
A conditional does not always arrive in the exact form “if \(p\), then \(q\).” These sentences all express \(p\to q\):
- If \(p\), then \(q\).
- \(p\) implies \(q\).
- \(p\) is sufficient for \(q\).
- \(q\) is necessary for \(p\).
- \(q\) whenever \(p\).
- \(p\) only if \(q\).
The phrase only if deserves special attention. “A number is divisible by \(4\) only if it is even” means
\[ \text{divisible by }4\ \to\ \text{even}. \]
“Only if” introduces a necessary condition. It does not reverse the arrow.
Biconditional: If and Only If
The biconditional \(p\leftrightarrow q\) says that \(p\) and \(q\) have the same truth value. It can be understood as two conditionals joined by “and”:
\[ p\leftrightarrow q \quad\text{means}\quad (p\to q)\land(q\to p). \]
| \(p\) | \(q\) | \(p\leftrightarrow q\) |
|---|---|---|
| \(T\) | \(T\) | \(T\) |
| \(T\) | \(F\) | \(F\) |
| \(F\) | \(T\) | \(F\) |
| \(F\) | \(F\) | \(T\) |
“An integer is even if and only if it is divisible by \(2\)” is a biconditional. Divisibility by \(2\) is both necessary and sufficient for an integer to be even.
Mathematicians often abbreviate “if and only if” as iff. Definitions frequently take biconditional form because a definition should identify exactly which objects belong to a category.
One Table, Five Connectives
A combined truth table makes the different behavior of the connectives easy to compare.
| \(p\) | \(q\) | \(\neg p\) | \(p\land q\) | \(p\lor q\) | \(p\to q\) | \(p\leftrightarrow q\) |
|---|---|---|---|---|---|---|
| \(T\) | \(T\) | \(F\) | \(T\) | \(T\) | \(T\) | \(T\) |
| \(T\) | \(F\) | \(F\) | \(F\) | \(T\) | \(F\) | \(F\) |
| \(F\) | \(T\) | \(T\) | \(F\) | \(T\) | \(T\) | \(F\) |
| \(F\) | \(F\) | \(T\) | \(F\) | \(F\) | \(T\) | \(T\) |
Try reading each column as a rule. Conjunction is demanding because it needs two true parts. Disjunction is permissive because one true part is enough. A conditional looks for a broken promise, while a biconditional checks whether the parts match.
Grouping and Scope
Compound propositions can contain several connectives. Parentheses show which components belong together, just as they do in arithmetic.
Compare:
- \(\neg(p\land q)\): it is not the case that both \(p\) and \(q\) are true.
- \((\neg p)\land q\): \(p\) is false, and \(q\) is true.
These are not equivalent. If \(p\) and \(q\) are both false, then \(\neg(p\land q)\) is true, while \((\neg p)\land q\) is false.
A common precedence convention evaluates connectives in this order:
- parentheses,
- negation \(\neg\),
- conjunction \(\land\),
- disjunction \(\lor\),
- conditional \(\to\),
- biconditional \(\leftrightarrow\).
Conventions can vary, so use parentheses whenever the intended grouping might be unclear. A few extra symbols are cheaper than an ambiguous argument.
Building a Truth Table
A truth table lists every possible assignment of truth values to the simple propositions and then evaluates the compound proposition one connective at a time.
With \(n\) distinct proposition variables, there are \(2^n\) possible rows. One variable needs \(2\) rows, two variables need \(4\), and three variables need \(8\).
To evaluate \((p\lor q)\land\neg p\):
- List the four possible combinations of \(p\) and \(q\).
- Compute \(p\lor q\).
- Compute \(\neg p\).
- Join those intermediate columns with \(\land\).
| \(p\) | \(q\) | \(p\lor q\) | \(\neg p\) | \((p\lor q)\land\neg p\) |
|---|---|---|---|---|
| \(T\) | \(T\) | \(T\) | \(F\) | \(F\) |
| \(T\) | \(F\) | \(T\) | \(F\) | \(F\) |
| \(F\) | \(T\) | \(T\) | \(T\) | \(T\) |
| \(F\) | \(F\) | \(F\) | \(T\) | \(F\) |
The final expression is true only when \(p\) is false and \(q\) is true. Intermediate columns make the work easier to check and reduce mental bookkeeping.
Translating Between Words and Symbols
Let \(p\) mean “the file exists” and \(q\) mean “the file is readable.”
| Words | Symbolic form |
|---|---|
| The file does not exist | \(\neg p\) |
| The file exists and is readable | \(p\land q\) |
| The file exists or is readable | \(p\lor q\) |
| If the file exists, then it is readable | \(p\to q\) |
| The file exists if and only if it is readable | \(p\leftrightarrow q\) |
| The file exists but is not readable | \(p\land\neg q\) |
Translation is not merely symbol replacement. First identify the smallest complete propositions, then determine the main connective, and finally preserve the original grouping.
Connectives Across Mathematics
Logical connectives reappear throughout mathematics and computing:
- Set theory: “\(x\in A\) and \(x\in B\)” describes membership in \(A\cap B\).
- Set theory: “\(x\in A\) or \(x\in B\)” describes membership in \(A\cup B\).
- Algebra: \(2\lt x\land x\le8\) describes the interval \((2,8]\).
- Definitions: biconditionals identify necessary and sufficient conditions.
- Proof: conditionals express the hypothesis-conclusion structure of theorems.
- Programming: Boolean operators control decisions, searches, filters, and access rules.
- Digital circuits: AND, OR, and NOT gates implement logical operations physically.
These are not just similar-looking ideas. They share a common logical structure, which is why learning the connectives early pays dividends across many branches.
Common Mistakes
Treating mathematical “or” as automatically exclusive
Standard disjunction is inclusive: \(p\lor q\) is true when either part or both parts are true. Use “but not both” or an exclusive-or symbol when exclusivity is intended.
Reversing “only if”
“\(p\) only if \(q\)” means \(p\to q\). The phrase introduces a condition that is necessary for \(p\).
Thinking a conditional requires a causal relationship
A formal conditional records a truth relationship, not necessarily cause and effect. In mathematics, “if \(n\) is divisible by \(4\), then \(n\) is even” expresses implication without describing a physical cause.
Forgetting the scope of negation
\(\neg(p\land q)\) negates the entire conjunction, while \((\neg p)\land q\) negates only \(p\). Parentheses make the intended scope visible.
Reading the conditional arrow as a two-way relationship
\(p\to q\) does not automatically give \(q\to p\). A two-way relationship requires a biconditional or separate proof of the reverse implication.
Working Summary
Logical connectives turn propositions into compound propositions with precise truth conditions. Negation reverses a truth value, conjunction requires both parts, inclusive disjunction requires at least one part, a conditional rules out a true antecedent with a false consequent, and a biconditional requires matching truth values.
Symbols make the structure compact, truth tables test every possible case, and parentheses control scope. Together, these tools let us translate language, analyze definitions, test arguments, build set descriptions, and prepare for formal proof.
Check Your Understanding
When is \(p\land q\) true?
Only when both \(p\) and \(q\) are true.
If \(p\) and \(q\) are both true, what is the truth value of \(p\lor q\)?
True. Standard mathematical disjunction is inclusive, so it allows both parts to be true.
When is \(p\to q\) false?
Only when \(p\) is true and \(q\) is false. That is the one case in which the conditional’s promise is broken.
What does \(p\leftrightarrow q\) say?
It says both \(p\to q\) and \(q\to p\). Equivalently, \(p\) and \(q\) must have the same truth value.
How many rows does a truth table with three proposition variables need?
\(2^3=8\) rows, one for each possible assignment of truth values to the three variables.