Connective — Definition, Formula & Examples
A connective is a symbol or word in logic that joins simple statements together to form a compound statement. The most common connectives are "and" (∧), "or" (∨), "not" (¬), "if…then" (→), and "if and only if" (↔).
A logical connective is an operator that acts on one or more propositions to produce a new proposition whose truth value is completely determined by the truth values of its component propositions and the definition of the connective.
How It Works
Each connective has a precise rule that determines when the resulting compound statement is true or false. For instance, is true only when both and are true, while is true when at least one of them is true. The negation simply flips the truth value of . You can summarize these rules in a truth table, which lists every possible combination of truth values for the component propositions and the resulting value of the compound statement.
Example
Problem: Let p represent "It is raining" (true) and q represent "The ground is wet" (true). Determine the truth value of the compound statement p ∧ q.
Identify the connective: The symbol ∧ means "and" (conjunction). The compound statement is true only when both components are true.
Apply the truth values: Since p is true and q is true, both components are true.
Answer: The compound statement p ∧ q is true.
Why It Matters
Connectives are the building blocks of every logical argument and proof you encounter in geometry, algebra, and discrete mathematics. Understanding them is essential for writing valid proofs, evaluating conditional statements, and designing circuits or algorithms in computer science.
Common Mistakes
Mistake: Treating "or" (∨) as exclusive, meaning exactly one but not both.
Correction: In mathematics, disjunction (∨) is inclusive: p ∨ q is true when p is true, q is true, or both are true. Exclusive or is a separate connective (⊕).