Definition
A logical connective (also called a logical operator or sentential connective) is a symbol or word used in formal logic to combine one or more propositions (or statements) into a new proposition, the truth value of which is determined by the truth values of its constituent parts according to a specific rule.
Overview
Logical connectives are fundamental components of propositional and predicate logic. They enable the construction of complex logical formulas from simpler ones and are essential for expressing logical relationships such as conjunction, disjunction, negation, conditionality, and biconditionality. In truth-functional logics, the truth value of a compound sentence formed with a connective depends solely on the truth values of its immediate components, independent of any external context. Non‑truth‑functional connectives (e.g., modal operators) exist but are usually treated separately.
Etymology / Origin
The term combines “logic,” derived from the Greek logikē (the art of reasoning), and “connective,” from the Latin connectere meaning “to bind together.” The phrase began to appear in the early 20th century as the formal study of symbolic logic was codified, particularly in the works of Bertrand Russell, Gottlob Frege, and later logicians such as Jan Łukasiewicz.
Characteristics
| Property | Description |
|---|---|
| Arity | The number of propositions a connective takes as arguments. Unary connectives (e.g., negation ¬) have arity 1; binary connectives (e.g., conjunction ∧, disjunction ∨, implication →) have arity 2; n‑ary connectives accept n arguments. |
| Truth‑functional | In classical propositional logic, the truth value of the resulting proposition is a deterministic function of the truth values of its inputs, as captured by truth tables. |
| Standard Set | The most commonly used connectives in classical logic are:
|
| Expressive Adequacy | Certain subsets of connectives are functionally complete, meaning any propositional formula can be expressed using only those connectives (e.g., {¬, ∧} or the single NAND operator). |
| Notation | Connectives may be represented symbolically (∧, ∨, ¬, →, ↔) or verbally (and, or, not, if…then, if and only if). Formal languages often adopt a prefix (Polish) or infix notation for readability. |
| Semantic Role | They define the logical relation among component propositions, enabling inference rules such as modus ponens (from P and P → Q, infer Q) and conjunction introduction (from P and Q, infer P ∧ Q). |
| Variations Across Logics | In intuitionistic, many‑valued, or fuzzy logics, the behavior of connectives may differ from classical truth tables, reflecting alternative notions of truth. |
Related Topics
- Propositional logic – the branch of logic that studies formulas built from propositional variables and logical connectives.
- Predicate logic – extends propositional logic with quantifiers and predicates; logical connectives remain central to its syntax.
- Truth table – a tabular method for specifying the output truth value of a connective for every combination of input truth values.
- Functional completeness – the property of a set of connectives that can express any truth‑functional operation.
- Modal operators – non‑truth‑functional operators such as □ (necessity) and ◇ (possibility) that augment standard logical connectives.
- Algebraic logic – studies algebraic structures (e.g., Boolean algebras) that model the behavior of logical connectives.
This entry summarizes the widely recognized concept of logical connectives as used in formal logical systems.