Logical connective

This article is about connectives in logical systems. For connectors in natural languages, see discourse connective. For other logical symbols, see List of logic symbols.

In logic, a logical connective (also called a logical operator) is a symbol or word used to connect two or more sentences (of either a formal or a natural language) in a grammatically valid way, such that the sense of the compound sentence produced depends only on the original sentences.

The most common logical connectives are binary connectives (also called dyadic connectives) which join two sentences which can be thought of as the function's operands. Also commonly, negation is considered to be a unary connective.

Logical connectives along with quantifiers are the two main types of logical constants used in formal systems such as propositional logic and predicate logic. Semantics of a logical connective is often, but not always, presented as a truth function.

A logical connective is similar to but not equivalent to a conditional operator. ^[1]

In language

Natural language

In the grammar of natural languages two sentences may be joined by a grammatical conjunction to form a grammatically compound sentence. Some but not all such grammatical conjunctions are truth functions. For example, consider the following sentences:

A: Jack went up the hill.

B: Jill went up the hill.

C: Jack went up the hill and Jill went up the hill.

D: Jack went up the hill so Jill went up the hill.

The words and and so are grammatical conjunctions joining the sentences (A) and (B) to form the compound sentences (C) and (D). The and in (C) is a logical connective, since the truth of (C) is completely determined by (A) and (B): it would make no sense to affirm (A) and (B) but deny (C). However, so in (D) is not a logical connective, since it would be quite reasonable to affirm (A) and (B) but deny (D): perhaps, after all, Jill went up the hill to fetch a pail of water, not because Jack had gone up the hill at all.

Various English words and word pairs express logical connectives, and some of them are synonymous. Examples (with the name of the relationship in parentheses) are:

"and" (conjunction)
"and then" (conjunction)
"and then within" (conjunction)
"or" (disjunction)
"either...or" (exclusive disjunction)
"implies" (implication)
"if...then" (implication)
"if and only if" (equivalence)
"only if" (implication)
"just in case" (biconditional)
"but" (conjunction)
"however" (conjunction)
"not both" (alternative denial)
"neither...nor" (joint denial)

The word "not" (negation) and the phrases "it is false that" (negation) and "it is not the case that" (negation) also express a logical connective – even though they are applied to a single statement, and do not connect two statements.

Formal languages

In formal languages, truth functions are represented by unambiguous symbols. These symbols are called "logical connectives", "logical operators", "propositional operators", or, in classical logic, "truth-functional connectives". See well-formed formula for the rules which allow new well-formed formulas to be constructed by joining other well-formed formulas using truth-functional connectives.

Logical connectives can be used to link more than two statements, so one can speak about "n-ary logical connective".

Common logical connectives

Name / Symbol		Truth table					Venn diagram
Name / Symbol		$P$ =	0		1		Venn diagram
Truth/Tautology	⊤		1		1
Proposition $P$			0		1
False/Contradiction	⊥		0		0
Negation	¬		1		0
Binary connectives		$P$ =	0	0	1	1
		$Q$ =	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
Exclusive or	$\nleftrightarrow$		0	1	1	0
Biconditional	↔		1	0	0	1
Converse implication	←		1	0	1	1
Proposition $P$			0	0	1	1
Proposition $Q$			0	1	0	1
More information

List of common logical connectives

Commonly used logical connectives include

Negation (not): ¬ , N (prefix), ~
Conjunction (and): $\wedge$ , K (prefix), & , ∙
Disjunction (or): $\or$ , A (prefix)
Material implication (if...then): $\rightarrow$ , C (prefix), $\Rightarrow$ , $\supset$
Biconditional (if and only if): $\leftrightarrow$ , E (prefix), $\equiv$ , $=$

Alternative names for biconditional are "iff", "xnor" and "bi-implication".

For example, the meaning of the statements it is raining and I am indoors is transformed when the two are combined with logical connectives. For statement P = It is raining and Q = I am indoors:

It is not raining (¬P)
It is raining and I am indoors (P $\wedge$ Q)
It is raining or I am indoors (P $\or$ Q)
If it is raining, then I am indoors (P $\rightarrow$ Q)
If I am indoors, then it is raining (Q $\rightarrow$ P)
I am indoors if and only if it is raining (P $\leftrightarrow$ Q)

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

True formula (⊤, 1, V [prefix], or T)
False formula (⊥, 0, O [prefix], or F)

History of notations

Negation: the symbol ¬ appeared in Heyting in 1929.^[2]^[3] (compare to Frege's symbol in his Begriffsschrift); the symbol ~ appeared in Russell in 1908;^[4] an alternative notation is to add an horizontal line on top of the formula, as in $\overline{P}$ ; another alternative notation is to use a prime symbol as in P'.
Conjunction: the symbol ∧ appeared in Heyting in 1929^[2] (compare to Peano's use of the set-theoretic notation of intersection ∩^[5]); & appeared at least in Schönfinkel in 1924;^[6] . comes from Boole's interpretation of logic as an elementary algebra.
Disjunction: the symbol ∨ appeared in Russell in 1908^[4] (compare to Peano's use of the set-theoretic notation of union ∪); the symbol + is also used, in spite of the ambiguity coming from the fact that the + of ordinary elementary algebra is an exclusive or when interpreted logically in a two-element ring; punctually in the history a + together with a dot in the lower right corner has been used by Peirce,^[7]
Implication: the symbol → can be seen in Hilbert in 1917;^[8] ⊃ was used by Russell in 1908^[4] (compare to Peano's inverted C notation); $\Rightarrow$ was used in Vax.^[9]
Biconditional: the symbol ≡ was used at least by Russell in 1908;^[4] ↔ was used at least by Tarski in 1940;^[10] ⇔ was used in Vax; other symbols appeared punctually in the history such as ⊃⊂ in Gentzen,^[11] ~ in Schönfinkel^[6] or ⊂⊃ in Chazal.^[12]
True: the symbol 1 comes from Boole's interpretation of logic as an elementary algebra over the two-element Boolean algebra; other notations include $\bigwedge$ to be found in Peano.
False: the symbol 0 comes also from Boole's interpretation of logic as a ring; other notations include $\bigvee$ to be found in Peano.

Some authors used letters for connectives at some time of the history: u. for conjunction (German's "und" for "and") and o. for disjunction (German's "oder" for "or") in earlier works by Hilbert (1904); Np for negation, Kpq for conjunction, Dpq for alternative denial, Apq for disjunction, Xpq for joint denial, Cpq for implication, Epq for biconditional in Łukasiewicz (1929);^[13] cf. Polish notation.

Redundancy

Such a logical connective as converse implication "←" 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 $\neg P \lor Q$ and $P \to Q$ . Therefore, a classical-based logical system does not need the conditional operator "→" if "¬" (not) and "∨" (or) are already in use, or may use the "→" only as a syntactic sugar for a compound having one negation and one disjunction.

There are sixteen Boolean functions associating the input truth values $P$ and $Q$ with four-digit binary outputs.^[14] 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: {↑}, {↓}.
Two elements: { $\vee$ , ¬}, { $\wedge$ , ¬}, {→, ¬}, {←, ¬}, {→, $\bot$ }, {←, $\bot$ }, {→, $\nleftrightarrow$ }, {←, $\nleftrightarrow$ }, {→, $\nrightarrow$ }, {→, $\nleftarrow$ }, {←, $\nrightarrow$ }, {←, $\nleftarrow$ }, { $\nrightarrow$ , ¬}, { $\nleftarrow$ , ¬}, { $\nrightarrow$ , $\top$ }, { $\nleftarrow$ , $\top$ }, { $\nrightarrow$ , $\leftrightarrow$ }, { $\nleftarrow$ , $\leftrightarrow$ }.
Three elements: { $\lor$ , $\leftrightarrow$ , $\bot$ }, { $\lor$ , $\leftrightarrow$ , $\nleftrightarrow$ }, { $\lor$ , $\nleftrightarrow$ , $\top$ }, { $\land$ , $\leftrightarrow$ , $\bot$ }, { $\land$ , $\leftrightarrow$ , $\nleftrightarrow$ }, { $\land$ , $\nleftrightarrow$ , $\top$ }.

See more details about functional completeness in classical logic at Functional completeness in truth function.

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 details). Neither conjunction, disjunction, nor material conditional has an equivalent form constructed of the other four logical connectives.

Properties

Some logical connectives possess properties which 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 \cdot (b + c) = (a \cdot b) + (a \cdot 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 $\land$ , $\lor$ satisfies the absorption law if $a\land(a\lor b)=a$ 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., $\vee$ , $\wedge$ , $\top$ , $\bot$ .
Affinity: Each variable always makes a difference in the truth-value of the operation or it never makes a difference. E.g., $\neg$ , $\leftrightarrow$ , $\nleftrightarrow$ , $\top$ , $\bot$ .
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 ̃ (\neg a 1, ..., \neg a n) = \neg g (a 1, ..., a n)$ . E.g., $\neg$ .
Truth-preserving: The compound all those argument are tautologies is a tautology itself. E.g., $\vee$ , $\wedge$ , $\top$ , $\rightarrow$ , $\leftrightarrow$ , ⊂. (see validity)
Falsehood-preserving: The compound all those argument are contradictions is a contradiction itself. E.g., $\vee$ , $\wedge$ , $\nleftrightarrow$ , $\bot$ , ⊄, ⊅. (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: $\neg$ has higher precedence than $\wedge$ , $\wedge$ higher than $\vee$ , and $\vee$ higher than $\rightarrow$ . So for example, $P \vee Q \wedge{\neg R} \rightarrow S$ is short for $(P \vee (Q \wedge (\neg R))) \rightarrow S$ .

Here is a table that shows a commonly used precedence of logical operators.^[15]

Operator	Precedence
$\neg$	1
$\wedge$	2
$\vee$	3
$\rightarrow$	4
$\leftrightarrow$	5

However, not all authors use the same order; for instance, an ordering in which disjunction is lower precedence than implication or bi-implication has also been used.^[16] 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 \land Q$ and $P \lor Q$ , so these connectives are not commutative if some of expressions $P$ , $Q$ has 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 ones.

Notes

↑ Cogwheel. "What is the difference between logical and conditional /operator/". Stack Overflow. Retrieved 9 April 2015.
1 2 Heyting (1929) Die formalen Regeln der intuitionistischen Logik.
↑ Denis Roegel (2002), Petit panorama des notations logiques du 20e siècle (see chart on page 2).
1 2 3 4 Russell (1908) Mathematical logic as based on the theory of types (American Journal of Mathematics 30, p222–262, also in From Frege to Gödel edited by van Heijenoort).
↑ Peano (1889) Arithmetices principia, nova methodo exposita.
1 2 Schönfinkel (1924) Über die Bausteine der mathematischen Logik, translated as On the building blocks of mathematical logic in From Frege to Gödel edited by van Heijenoort.
↑ Peirce (1867) On an improvement in Boole's calculus of logic.
↑ Hilbert (1917/1918) Prinzipien der Mathematik (Bernays' course notes).
↑ Vax (1982) Lexique logique, Presses Universitaires de France.
↑ Tarski (1940) Introduction to logic and to the methodology of deductive sciences.
↑ Gentzen (1934) Untersuchungen über das logische Schließen.
↑ Chazal (1996) : Éléments de logique formelle.
↑ See Roegel
↑ Bocheński (1959), A Précis of Mathematical Logic, passim.
↑ O'Donnell, John; Hall, Cordelia; Page, Rex (2007), Discrete Mathematics Using a Computer, Springer, p. 120, ISBN 9781846285981 .
↑ Jackson, Daniel (2012), Software Abstractions: Logic, Language, and Analysis, MIT Press, p. 263, ISBN 9780262017152 .

References

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.
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: Springer Science+Business Media, doi:10.1007/978-1-4419-1221-3, ISBN 978-1-4419-1220-6 .

External links

Hazewinkel, Michiel, ed. (2001), "Propositional connective", Encyclopedia of Mathematics, Springer, ISBN 978-1-55608-010-4
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.

Logical connectives

Tautology $\top$

NAND $\uparrow$ Converse implication $\leftarrow$ Implication $\rightarrow$ OR $\or$

Negation $\neg$ XOR $\oplus$ Biconditional $\leftrightarrow$ Statement

NOR $\downarrow$ Nonimplication $\nrightarrow$ Converse nonimplication $\nleftarrow$ AND $\and$

Contradiction $\bot$

Mathematical logic

General	Formal language Formation rule Formal system Deductive system Formal proof Formal semantics Well-formed formula Set Element Class Classical logic Axiom Natural deduction Rule of inference Relation Theorem Logical consequence Axiomatic system Type theory Symbol Syntax Theory

Traditional logic	Proposition Inference Argument Validity Cogency Syllogism Square of opposition Venn diagram

Propositional calculus Boolean logic	Boolean functions Propositional calculus Propositional formula Logical connectives Truth tables

Predicate logic	First-order Quantifiers Predicate Second-order Monadic predicate calculus

Naive set theory	Set Empty set Enumeration Extensionality Finite set Infinite set Subset Power set Countable set Uncountable set Recursive set Domain Range Map Function Relation Ordered pair

Set theory	Foundations of mathematics Zermelo–Fraenkel set theory Axiom of choice General set theory Kripke–Platek set theory Von Neumann–Bernays–Gödel set theory Morse–Kelley set theory Tarski–Grothendieck set theory

Model theory	Model Interpretation Non-standard model Finite model theory Truth value Validity

Proof theory	Formal proof Deductive system Formal system Theorem Logical consequence Rule of inference Syntax

Computability theory	Recursion Recursive set Recursively enumerable set Decision problem Church–Turing thesis Computable function Primitive recursive function

This article is issued from Wikipedia - version of the Tuesday, November 10, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.