Logical connective

Short description: Symbol connecting sentential formulas in logic

Hasse diagram of logical connectives.

In logic, a logical connective (also called a logical operator, sentential connective, or sentential operator) is a logical constant. Connectives can be used to connect logical formulas. For instance in the syntax of propositional logic, the binary connective [math]\displaystyle{ \lor }[/math] can be used to join the two atomic formulas [math]\displaystyle{ P }[/math] and [math]\displaystyle{ Q }[/math], rendering the complex formula [math]\displaystyle{ P \lor Q }[/math].

Common connectives include negation, disjunction, conjunction, implication, and equivalence. In standard systems of classical logic, these connectives are interpreted as truth functions, though they receive a variety of alternative interpretations in nonclassical logics. Their classical interpretations are similar to the meanings of natural language expressions such as English "not", "or", "and", and "if", but not identical. Discrepancies between natural language connectives and those of classical logic have motivated nonclassical approaches to natural language meaning as well as approaches which pair a classical compositional semantics with a robust pragmatics.

A logical connective is similar to, but not equivalent to, a syntax commonly used in programming languages called a conditional operator.

Overview

In formal languages, truth functions are represented by unambiguous symbols. This allows logical statements to not be understood in an ambiguous way. These symbols are called logical connectives, logical operators, propositional operators, or, in classical logic, truth-functional connectives. For the rules which allow new well-formed formulas to be constructed by joining other well-formed formulas using truth-functional connectives, see well-formed formula.

Logical connectives can be used to link zero or more statements, so one can speak about n-ary logical connectives. The boolean constants True and False can be thought of as zero-ary operators. Negation is a 1-ary connective, and so on.

Symbol, name		Truth table					Venn diagram
Zeroary connectives (constants)
⊤	Truth/tautology				1
⊥	Falsity/contradiction				0
Unary connectives
		[math]\displaystyle{ p }[/math] =	0		1
	Proposition [math]\displaystyle{ p }[/math]		0		1
¬	Negation		1		0
Binary connectives
		[math]\displaystyle{ p }[/math] =	0		1
		[math]\displaystyle{ q }[/math] =	0	1	0	1
	Proposition [math]\displaystyle{ p }[/math]		0	0	1	1
	Proposition [math]\displaystyle{ q }[/math]		0	1	0	1
∧	Conjunction		0	0	0	1
↑	Alternative denial		1	1	1	0
∨	Disjunction		0	1	1	1
↓	Joint denial		1	0	0	0
→	Material conditional		1	1	0	1
[math]\displaystyle{ \nleftrightarrow }[/math]	Exclusive or		0	1	1	0
↔	Biconditional		1	0	0	1
←	Converse implication		1	0	1	1
More information

List of common logical connectives

Commonly used logical connectives include the following ones.

• Negation (not): [math]\displaystyle{ \neg }[/math], [math]\displaystyle{ \sim }[/math], [math]\displaystyle{ N }[/math] (prefix) in which [math]\displaystyle{ \neg }[/math] is the most modern and widely used, and [math]\displaystyle{ \sim }[/math] is used by many people too;
• Conjunction (and): [math]\displaystyle{ \wedge }[/math], [math]\displaystyle{ \& }[/math], [math]\displaystyle{ K }[/math] (prefix) in which [math]\displaystyle{ \wedge }[/math] is the most modern and widely used;
• Disjunction (or): [math]\displaystyle{ \vee }[/math], [math]\displaystyle{ A }[/math] (prefix) in which [math]\displaystyle{ \vee }[/math] is the most modern and widely used;
• Implication (if...then): [math]\displaystyle{ \to }[/math], [math]\displaystyle{ \supset }[/math], [math]\displaystyle{ \Rightarrow }[/math], [math]\displaystyle{ C }[/math] (prefix) in which [math]\displaystyle{ \to }[/math] is the most modern and widely used, and [math]\displaystyle{ \supset }[/math] is used by many people too;
• Equivalence (if and only if): [math]\displaystyle{ \leftrightarrow }[/math], [math]\displaystyle{ \subset\!\!\!\supset }[/math], [math]\displaystyle{ \Leftrightarrow }[/math], [math]\displaystyle{ \equiv }[/math], [math]\displaystyle{ E }[/math] (prefix) in which [math]\displaystyle{ \leftrightarrow }[/math] is the most modern and widely used, and [math]\displaystyle{ \subset\!\!\!\supset }[/math] may be also a good choice compared to [math]\displaystyle{ \supset }[/math] denoting implication just like [math]\displaystyle{ \leftrightarrow }[/math] to [math]\displaystyle{ \to }[/math].

For example, the meaning of the statements it is raining (denoted by [math]\displaystyle{ p }[/math]) and I am indoors (denoted by [math]\displaystyle{ q }[/math]) is transformed, when the two are combined with logical connectives:

• It is not raining ([math]\displaystyle{ \neg p }[/math]);
• It is raining and I am indoors ([math]\displaystyle{ p \wedge q }[/math]);
• It is raining or I am indoors ([math]\displaystyle{ p \lor q }[/math]);
• If it is raining, then I am indoors ([math]\displaystyle{ p \rightarrow q }[/math]);
• If I am indoors, then it is raining ([math]\displaystyle{ q \rightarrow p }[/math]);
• I am indoors if and only if it is raining ([math]\displaystyle{ p \leftrightarrow q }[/math]).

It is also common to consider the always true formula and the always false formula to be connective.

• True formula: [math]\displaystyle{ \top }[/math], [math]\displaystyle{ 1 }[/math], [math]\displaystyle{ V }[/math] (prefix), or [math]\displaystyle{ \mathrm{T} }[/math];
• False formula: [math]\displaystyle{ \bot }[/math], [math]\displaystyle{ 0 }[/math], [math]\displaystyle{ O }[/math] (prefix), or [math]\displaystyle{ \mathrm{F} }[/math].

History of notations

• Negation: the symbol [math]\displaystyle{ \neg }[/math] appeared in Heyting in 1930 (compare to Frege's symbol ⫟ in his Begriffsschrift); the symbol [math]\displaystyle{ \sim }[/math] appeared in Russell in 1908; an alternative notation is to add a horizontal line on top of the formula, as in [math]\displaystyle{ \overline{p} }[/math]; another alternative notation is to use a prime symbol as in [math]\displaystyle{ p' }[/math].
• Conjunction: the symbol [math]\displaystyle{ \wedge }[/math] appeared in Heyting in 1930 (compare to Peano's use of the set-theoretic notation of intersection [math]\displaystyle{ \cap }[/math]); the symbol [math]\displaystyle{ \& }[/math] appeared at least in Schönfinkel in 1924; the symbol [math]\displaystyle{ \cdot }[/math] comes from Boole's interpretation of logic as an elementary algebra.
• Disjunction: the symbol [math]\displaystyle{ \vee }[/math] appeared in Russell in 1908 (compare to Peano's use of the set-theoretic notation of union [math]\displaystyle{ \cup }[/math]); the symbol [math]\displaystyle{ + }[/math] is also used, in spite of the ambiguity coming from the fact that the [math]\displaystyle{ + }[/math] of ordinary elementary algebra is an exclusive or when interpreted logically in a two-element ring; punctually in the history a [math]\displaystyle{ + }[/math] together with a dot in the lower right corner has been used by Peirce.
• Implication: the symbol [math]\displaystyle{ \to }[/math] appeared in Hilbert in 1918; [math]\displaystyle{ \supset }[/math] was used by Russell in 1908 (compare to Peano's Ɔ the inverted C); [math]\displaystyle{ \Rightarrow }[/math] appeared in Bourbaki in 1954.
• Equivalence: the symbol [math]\displaystyle{ \equiv }[/math] in Frege in 1879; [math]\displaystyle{ \leftrightarrow }[/math] in Becker in 1933 (not the first time and for this see the following); [math]\displaystyle{ \Leftrightarrow }[/math] appeared in Bourbaki in 1954; other symbols appeared punctually in the history, such as [math]\displaystyle{ \supset\subset }[/math] in Gentzen, [math]\displaystyle{ \sim }[/math] in Schönfinkel or [math]\displaystyle{ \subset\supset }[/math] in Chazal,
• True: the symbol [math]\displaystyle{ 1 }[/math] comes from Boole's interpretation of logic as an elementary algebra over the two-element Boolean algebra; other notations include [math]\displaystyle{ \mathrm{V} }[/math] (abbreviation for the Latin word "verum") to be found in Peano in 1889.
• False: the symbol [math]\displaystyle{ 0 }[/math] comes also from Boole's interpretation of logic as a ring; other notations include [math]\displaystyle{ \Lambda }[/math] (rotated [math]\displaystyle{ \mathrm{V} }[/math]) to be found in Peano in 1889.

Some authors used letters for connectives: [math]\displaystyle{ \operatorname{u.} }[/math] for conjunction (German's "und" for "and") and [math]\displaystyle{ \operatorname{o.} }[/math] for disjunction (German's "oder" for "or") in early works by Hilbert (1904); [math]\displaystyle{ Np }[/math] for negation, [math]\displaystyle{ Kpq }[/math] for conjunction, [math]\displaystyle{ Dpq }[/math] for alternative denial, [math]\displaystyle{ Apq }[/math] for disjunction, [math]\displaystyle{ Cpq }[/math] for implication, [math]\displaystyle{ Epq }[/math] for biconditional in Łukasiewicz in 1929.

Redundancy

Such a logical connective as converse implication "[math]\displaystyle{ \leftarrow }[/math]" is actually the same as material conditional with swapped arguments; thus, the symbol for converse implication is redundant. In some logical calculi (notably, in classical logic), certain essentially different compound statements are logically equivalent. A less trivial example of a redundancy is the classical equivalence between [math]\displaystyle{ \neg p\vee q }[/math] and [math]\displaystyle{ p\to q }[/math]. Therefore, a classical-based logical system does not need the conditional operator "[math]\displaystyle{ \to }[/math]" if "[math]\displaystyle{ \neg }[/math]" (not) and "[math]\displaystyle{ \vee }[/math]" (or) are already in use, or may use the "[math]\displaystyle{ \to }[/math]" only as a syntactic sugar for a compound having one negation and one disjunction.

There are sixteen Boolean functions associating the input truth values [math]\displaystyle{ p }[/math] and [math]\displaystyle{ q }[/math] with four-digit binary outputs. These correspond to possible choices of binary logical connectives for classical logic. Different implementations of classical logic can choose different functionally complete subsets of connectives.

One approach is to choose a minimal set, and define other connectives by some logical form, as in the example with the material conditional above. The following are the minimal functionally complete sets of operators in classical logic whose arities do not exceed 2:

One element

[math]\displaystyle{ \{\uparrow\} }[/math], [math]\displaystyle{ \{\downarrow\} }[/math].

Two elements

[math]\displaystyle{ \{\vee, \neg\} }[/math], [math]\displaystyle{ \{\wedge, \neg\} }[/math], [math]\displaystyle{ \{\to, \neg\} }[/math], [math]\displaystyle{ \{\gets, \neg\} }[/math], [math]\displaystyle{ \{\to, \bot\} }[/math], [math]\displaystyle{ \{\gets, \bot\} }[/math], [math]\displaystyle{ \{\to, \nleftrightarrow\} }[/math], [math]\displaystyle{ \{\gets, \nleftrightarrow\} }[/math], [math]\displaystyle{ \{\to, \nrightarrow\} }[/math], [math]\displaystyle{ \{\to, \nleftarrow\} }[/math], [math]\displaystyle{ \{\gets, \nrightarrow\} }[/math], [math]\displaystyle{ \{\gets, \nleftarrow\} }[/math], [math]\displaystyle{ \{\nrightarrow, \neg\} }[/math], [math]\displaystyle{ \{\nleftarrow, \neg\} }[/math], [math]\displaystyle{ \{\nrightarrow, \top\} }[/math], [math]\displaystyle{ \{\nleftarrow, \top\} }[/math], [math]\displaystyle{ \{\nrightarrow, \leftrightarrow\} }[/math], [math]\displaystyle{ \{\nleftarrow, \leftrightarrow\} }[/math].

Three elements

[math]\displaystyle{ \{\lor, \leftrightarrow, \bot\} }[/math], [math]\displaystyle{ \{\lor, \leftrightarrow, \nleftrightarrow\} }[/math], [math]\displaystyle{ \{\lor, \nleftrightarrow, \top\} }[/math], [math]\displaystyle{ \{\land, \leftrightarrow, \bot\} }[/math], [math]\displaystyle{ \{\land, \leftrightarrow, \nleftrightarrow\} }[/math], [math]\displaystyle{ \{\land, \nleftrightarrow, \top\} }[/math].

Another approach is to use with equal rights connectives of a certain convenient and functionally complete, but not minimal set. This approach requires more propositional axioms, and each equivalence between logical forms must be either an axiom or provable as a theorem.

The situation, however, is more complicated in intuitionistic logic. Of its five connectives, {∧, ∨, →, ¬, ⊥}, only negation "¬" can be reduced to other connectives (see False (logic) § False, negation and contradiction for more). Neither conjunction, disjunction, nor material conditional has an equivalent form constructed from the other four logical connectives.

Natural language

The standard logical connectives of classical logic have rough equivalents in the grammars of natural languages. In English, as in many languages, such expressions are typically grammatical conjunctions. However, they can also take the form of complementizers, verb suffixes, and particles. The denotations of natural language connectives is a major topic of research in formal semantics, a field that studies the logical structure of natural languages.

The meanings of natural language connectives are not precisely identical to their nearest equivalents in classical logic. In particular, disjunction can receive an exclusive interpretation in many languages. Some researchers have taken this fact as evidence that natural language semantics is nonclassical. However, others maintain classical semantics by positing pragmatic accounts of exclusivity which create the illusion of nonclassicality. In such accounts, exclusivity is typically treated as a scalar implicature. Related puzzles involving disjunction include free choice inferences, Hurford's Constraint, and the contribution of disjunction in alternative questions.

Other apparent discrepancies between natural language and classical logic include the paradoxes of material implication, donkey anaphora and the problem of counterfactual conditionals. These phenomena have been taken as motivation for identifying the denotations of natural language conditionals with logical operators including the strict conditional, the variably strict conditional, as well as various dynamic operators.

The following table shows the standard classically definable approximations for the English connectives.

English word	Connective	Symbol	Logical gate
not	negation	[math]\displaystyle{ \neg }[/math]	NOT
and	conjunction	[math]\displaystyle{ \wedge }[/math]	AND
or	disjunction	[math]\displaystyle{ \vee }[/math]	OR
if...then	material implication	[math]\displaystyle{ \to }[/math]	IMPLY
...if	converse implication	[math]\displaystyle{ \leftarrow }[/math]
either...or	exclusive disjunction	[math]\displaystyle{ \oplus }[/math]	XOR
if and only if	biconditional	[math]\displaystyle{ \leftrightarrow }[/math]	XNOR
not both	alternative denial	[math]\displaystyle{ \uparrow }[/math]	NAND
neither...nor	joint denial	[math]\displaystyle{ \downarrow }[/math]	NOR
but not	material nonimplication	[math]\displaystyle{ \not\to }[/math]	NIMPLY

Properties

Some logical connectives possess properties that may be expressed in the theorems containing the connective. Some of those properties that a logical connective may have are:

Associativity

Within an expression containing two or more of the same associative connectives in a row, the order of the operations does not matter as long as the sequence of the operands is not changed.

Commutativity

The operands of the connective may be swapped, preserving logical equivalence to the original expression.

Distributivity

A connective denoted by · distributes over another connective denoted by +, if a · (b + c) = (a · b) + (a · c) for all operands a, b, c.

Idempotence

Whenever the operands of the operation are the same, the compound is logically equivalent to the operand.

Absorption

A pair of connectives ∧, ∨ satisfies the absorption law if [math]\displaystyle{ a\land(a\lor b)=a }[/math] for all operands a, b.

Monotonicity

If f(a₁, ..., a_n) ≤ f(b₁, ..., b_n) for all a₁, ..., a_n, b₁, ..., b_n ∈ {0,1} such that a₁ ≤ b₁, a₂ ≤ b₂, ..., a_n ≤ b_n. E.g., ∨, ∧, ⊤, ⊥.

Affinity

Each variable always makes a difference in the truth-value of the operation or it never makes a difference. E.g., ¬, ↔, [math]\displaystyle{ \nleftrightarrow }[/math], ⊤, ⊥.

Duality

To read the truth-value assignments for the operation from top to bottom on its truth table is the same as taking the complement of reading the table of the same or another connective from bottom to top. Without resorting to truth tables it may be formulated as g̃(¬a₁, ..., ¬a_n) = ¬g(a₁, ..., a_n). E.g., ¬.

Truth-preserving

The compound all those arguments are tautologies is a tautology itself. E.g., ∨, ∧, ⊤, →, ↔, ⊂ (see validity).

Falsehood-preserving

The compound all those argument are contradictions is a contradiction itself. E.g., ∨, ∧, [math]\displaystyle{ \nleftrightarrow }[/math], ⊥, ⊄, ⊅ (see validity).

Involutivity (for unary connectives)

f(f(a)) = a. E.g. negation in classical logic.

For classical and intuitionistic logic, the "=" symbol means that corresponding implications "...→..." and "...←..." for logical compounds can be both proved as theorems, and the "≤" symbol means that "...→..." for logical compounds is a consequence of corresponding "...→..." connectives for propositional variables. Some many-valued logics may have incompatible definitions of equivalence and order (entailment).

Both conjunction and disjunction are associative, commutative and idempotent in classical logic, most varieties of many-valued logic and intuitionistic logic. The same is true about distributivity of conjunction over disjunction and disjunction over conjunction, as well as for the absorption law.

In classical logic and some varieties of many-valued logic, conjunction and disjunction are dual, and negation is self-dual, the latter is also self-dual in intuitionistic logic.

Order of precedence

As a way of reducing the number of necessary parentheses, one may introduce precedence rules: ¬ has higher precedence than ∧, ∧ higher than ∨, and ∨ higher than →. So for example, [math]\displaystyle{ P \vee Q \wedge{\neg R} \rightarrow S }[/math] is short for [math]\displaystyle{ (P \vee (Q \wedge (\neg R))) \rightarrow S }[/math].

Here is a table that shows a commonly used precedence of logical operators.

Operator	Precedence
[math]\displaystyle{ \neg }[/math]	1
[math]\displaystyle{ \land }[/math]	2
[math]\displaystyle{ \lor }[/math]	3
[math]\displaystyle{ \to }[/math]	4
[math]\displaystyle{ \leftrightarrow }[/math]	5

However, not all compilers use the same order; for instance, an ordering in which disjunction is lower precedence than implication or bi-implication has also been used. Sometimes precedence between conjunction and disjunction is unspecified requiring to provide it explicitly in given formula with parentheses. The order of precedence determines which connective is the "main connective" when interpreting a non-atomic formula.

Computer science

A truth-functional approach to logical operators is implemented as logic gates in digital circuits. Practically all digital circuits (the major exception is DRAM) are built up from NAND, NOR, NOT, and transmission gates; see more details in Truth function in computer science. Logical operators over bit vectors (corresponding to finite Boolean algebras) are bitwise operations.

But not every usage of a logical connective in computer programming has a Boolean semantic. For example, lazy evaluation is sometimes implemented for P ∧ Q and P ∨ Q, so these connectives are not commutative if either or both of the expressions P, Q have side effects. Also, a conditional, which in some sense corresponds to the material conditional connective, is essentially non-Boolean because for if (P) then Q;, the consequent Q is not executed if the antecedent P is false (although a compound as a whole is successful ≈ "true" in such case). This is closer to intuitionist and constructivist views on the material conditional— rather than to classical logic's views.

Table and Hasse diagram

The 16 logical connectives can be partially ordered to produce the following Hasse diagram. The partial order is defined by declaring that [math]\displaystyle{ x \leq y }[/math] if and only if whenever [math]\displaystyle{ x }[/math] holds then so does [math]\displaystyle{ y. }[/math]

See also

• Boolean domain
• Boolean function
• Boolean logic
• Boolean-valued function
• Four-valued logic
• List of Boolean algebra topics
• Logical constant
• Modal operator
• Propositional calculus
• Truth function
• Truth table
• Truth values

Sources

• Bocheński, Józef Maria (1959), A Précis of Mathematical Logic, translated from the French and German editions by Otto Bird, D. Reidel, Dordrecht, South Holland.
• Chao, C. (2023) (in Chinese). 数理逻辑：形式化方法的应用. Beijing: Preprint.. pp. 15–28. 
• Enderton, Herbert (2001), A Mathematical Introduction to Logic (2nd ed.), Boston, MA: Academic Press, ISBN 978-0-12-238452-3 
• Gamut, L.T.F (1991), "Chapter 2", Logic, Language and Meaning, 1, University of Chicago Press, pp. 54–64, OCLC 21372380 
• Rautenberg, W. (2010), A Concise Introduction to Mathematical Logic (3rd ed.), New York City: Springer Science+Business Media, doi:10.1007/978-1-4419-1221-3, ISBN 978-1-4419-1220-6 .
• Humberstone, Lloyd (2011). The Connectives. MIT Press. ISBN 978-0-262-01654-4. 

External links

• Hazewinkel, Michiel, ed. (2001), "Propositional connective", Encyclopedia of Mathematics, Springer Science+Business Media B.V. / Kluwer Academic Publishers, ISBN 978-1-55608-010-4, https://www.encyclopediaofmath.org/index.php?title=p/p075490 
• Lloyd Humberstone (2010), "Sentence Connectives in Formal Logic", Stanford Encyclopedia of Philosophy (An abstract algebraic logic approach to connectives.)
• John MacFarlane (2005), "Logical constants", Stanford Encyclopedia of Philosophy.

da:Logisk konnektiv