Back to the index. Or to the chambers

This article has 41 links. View as Cloud or List.

1	Binary Operation
1	Variable
1	Absolute Convergence
1	Boolean Valued Function
1	Product
1	Operation
1	Logical Connective
1	Equivalent
1	Terms And Formulas
1	Truth Table
1	Sign Relation
1	Logic
1	Relation Theory
1	Language
1	Necessary And Sufficient
1	Number
1	Implication
1	Equation
2	Scheme
2	Area
2	Deck Transformation
2	Equational Class
2	Variation
2	Open Question
2	Sentence
2	Classes Of Ordinals And Enumerating Functions
2	Discrete Valuation Ring
2	Word
3	Infix Notation
3	Boolean
3	An Outline Of Hilberts Programme
3	Intuitionistic Logic
3	Approximation
4	Hypostatic Abstraction
4	Fibre
4	Flow
5	Prefix Set
6	Propositional Calculus
6	Triadic Relation
7	Score Function
7	Standard Enumeration Of Lbrace

Loading ...

Planetmath Browser (2008—2009)

BSD licence | A django site

All articles taken from PlanetMath.org snapshot under CC-BY-SA licence.

→ The original article on PlanetMath.org

Other Formats: LaTeX

New! You can click on formulas to copy the LaTeX source to your clipboard. | Math Videos

Logical Implication

Short version

Logical implication is an operation on two logical values, typically the values of two propositions, that produces a value of false just in case the first operand is true and the second operand is false.

The truth table for the logical implication operation that is written as $p \Rightarrow q$ and read as $\lq\lq p\ \operatorname{implies}\ q'',$ also written as $p \rightarrow q$ and read as $\lq\lq \operatorname{if}\ p\ \operatorname{then}\ q'',$ is as follows:

Logical Implication

$p \Rightarrow q$

F F T

F T T

T F F

T T T

Long version

The mathematical objects that inform our capacity for logical reasoning are easier to describe in a straightforward way than it is to reconcile their traditional accounts. Still, some discussion of the language that occurs in the literature cannot be avoided.

The concept of logical implication encompasses a specific logical function, a specific logical relation, and the various symbols that are used to denote this function and this relation. In order to define the specific function, relation, and symbols in question it is first necessary to establish a few ideas about the connections among them.

Close approximations to the concept of logical implication are expressed in ordinary language by means of linguistic forms like the following:

implies .
If then .

Here and are propositional variables that stand for any propositions in a given language. In a statement of the form “if then ", the first term, , is called the antecedent and the second term, , is called the consequent, while the statement as a whole is called either the conditional or the consequence. Assuming that the conditional statement is true, then the truth of the antecedent is a sufficient condition for the truth of the consequent, while the truth of the consequent is a necessary condition for the truth of the antecedent.

Many writers draw a technical distinction between the form “ implies " and the form “if then ". In this view, writing “ implies " asserts the existence of a certain relation between the logical value of and the logical value of while writing “if then " simply forms a compound sentence whose logical value is a function of the logical values of and . Notice that a relation is a mathematical object while a sentence, whether open or closed, is a syntactic form that exists in the domain of signs.

Two factors enter at cross-purposes to our understanding at this point, and they have historically been the source of many divergent thinkers talking skew to each other on this score.

There is the contrast between “object" and “sign". Objects include among their number abstract, formal, and mathematical objects. Signs include the full variety of syntactic forms in general. For some thinkers, objects are the primary concerns and language merely accessory to them. For other thinkers, signs are the primary business and objects always mediated by them, with formal objects being perhaps the mere illusions that are produced in our minds by forms of words.
There is the contrast between the relational aspect and the functional aspect of the mathematical objects in question. This issue is less problematic within mathematics itself, it being axiomatic that a binary operation is a ternary relation and because there are standard ways of relating characteristic functions with the sets and relations that are their fibers.

Definition

The concept of logical implication is associated with an operation on two logical values, typically the values of two propositions, that produces a value of false just in case the first operand is true and the second operand is false.

In the interpretation where $0 = \mathrm{false}$ and $1 = \mathrm{true}$ , the truth table associated with the statement “ implies ", symbolized as $p \Rightarrow q$ , is as follows:

Logical Implication

$p \Rightarrow q$

0 0 1

0 1 1

1 0 0

1 1 1

Discussion

The usage of the terms logical implication and material conditional varies from field to field and even across different contexts of discussion. One way to minimize the potential confusion is to begin with a focus on the various types of formal objects that are being discussed, of which there are only a few, taking up the variations in language as a secondary matter.

The main formal object under discussion is a logical operation on two logical values, typically the values of two propositions, that produces a value of false just in case the first operand is true and the second operand is false. By way of a temporary name, the logical operation in question may be written as $\operatorname{cond}(p, q)$ , where and are logical values. The truth table associated with this operation is as follows:

$\operatorname{cond} : \mathbb{B} \times \mathbb{B} \to \mathbb{B}$

$\operatorname{cond}(p, q)$

0 0 1

0 1 1

1 0 0

1 1 1

Some writers draw a firm distinction between the conditional connective (the syntactic sign $\lq\lq \rightarrow''$ ) and the implication relation (the formal object denoted by the sign $\lq\lq \Rightarrow''$ ). These writers use the phrase “if-then" for the conditional connective and the term “implies" for the implication relation. The difference is sometimes explained by saying that the conditional is the “contemplated" relation while the implication is the “asserted" relation. In most areas of mathematics, the distinction is treated as a variation in the usage of the single sign $\lq\lq \Rightarrow''$ , not requiring two separate signs. Not all of those who use the sign $\lq\lq \rightarrow''$ for the conditional connective regard it as a sign that denotes any kind of formal object, but treat it as a so-called syncategorematic sign, that is, a sign with a purely syntactic function. For the sake of clarity and simplicity in the present introduction, it is convenient to use the two-sign notation, but allow the sign $\lq\lq \rightarrow''$ to denote the boolean function that is associated with the truth table of the material conditional. These considerations result in the following scheme of notation.

$\begin{matrix} p \rightarrow q & \quad & \quad & p \Rightarrow q \\ \mathrm{if}\ p\ \mathrm{then}\ q & \quad & \quad & p\ \mathrm{implies}\ q \\ \end{matrix}$

Let $\mathbb{B} = \{ 0, 1 \}$ , where 0 is interpreted as the logical value $\mathrm{false}$ and 1 is interpreted as the logical value $\mathrm{true}$ . The truth table shows the ordered triples of a triadic relation $L \subseteq \mathbb{B} \times \mathbb{B} \times \mathbb{B}$ that is defined as follows:

$L = \{ (p, q, r) \in \mathbb{B} \times \mathbb{B} \times \mathbb{B} : \operatorname{cond}(p, q) = r \}$ .

Regarded as a set, this triadic relation is the same thing as the binary operation:

$\operatorname{cond} : \mathbb{B} \times \mathbb{B} \to \mathbb{B}$ .

The relationship between $\operatorname{cond}$ and exemplifies the standard association that exists between any binary operation and its corresponding triadic relation.

The conditional sign $\lq\lq \rightarrow''$ denotes the same formal object as the function name $\operatorname{cond}$ , the only difference being that the first is written infix while the second is written prefix. Thus we have the following equation:

$(p \rightarrow q) = \operatorname{cond}(p, q)$ .

Consider once again the triadic relation $L \subseteq \mathbb{B} \times \mathbb{B} \times \mathbb{B}$ that is defined in the following equivalent fashion:

$L = \{ (p, q, \operatorname{cond}(p, q)) : (p, q) \in \mathbb{B} \times \mathbb{B} \}$ .

Associated with the 3-adic relation is a 2-adic relation $L_{..1} \subseteq \mathbb{B} \times \mathbb{B}$ that is called the fiber of with 1 in the third place. This object is defined as follows:

$L_{..1} := \{ (p, q) \in \mathbb{B} \times \mathbb{B} : (p, q, 1) \in L \}$ .

The same object is achieved in the following way. Begin with the 2-adic operation:

$\operatorname{cond} : \mathbb{B} \times \mathbb{B} \to \mathbb{B}$ .

Form the 2-adic relation that is called the fiber of $\operatorname{cond}$ at 1, notated as follows:

$\operatorname{cond}^{-1}(1) \subseteq \mathbb{B} \times \mathbb{B}$ .

This object is defined as follows:

$\operatorname{cond}^{-1}(1) = \{ (p, q) \in \mathbb{B} \times \mathbb{B} : \operatorname{cond}(p, q) = 1 \}$ .

The implication sign $\lq\lq \Rightarrow''$ denotes the same formal object as the relation names $\lq\lq L_{..1}''$ and $\lq\lq \operatorname{cond}^{-1}(1)''$ , the only differences being purely syntactic. Thus we have the following logical equivalence:

$(p \Rightarrow q) \iff (p, q) \in L_{..1} \iff (p, q) \in \operatorname{cond}^{-1}(1)$ .

This completes the derivation of the mathematical objects that are denoted by the signs $\lq\lq \rightarrow''$ and $\lq\lq \Rightarrow''$ in this discussion. It needs to be remembered, though, that not all writers observe this distinction in every context. Especially in mathematics, where the sign $\lq\lq \rightarrow''$ is reserved for function notation, it is common to see the sign $\lq\lq \Rightarrow''$ being used for both concepts.

Bibliography

Brown, Frank Markham (2003), Boolean Reasoning : The Logic of Boolean Equations, 1st edition, Kluwer Academic Publishers, Norwell, MA, 1990. 2nd edition, Dover Publications, Mineola, NY.
Church, Alonzo (1962), “Logic, formal", pp. 170-181 in Runes (1962).
Church, Alonzo (1996), Introduction to Mathematical Logic. Originally published, Annals of Mathemtics Studies, 1944. Revised and enlarged edition, Princeton Mathematical Series, 1956. 10th printing, Princeton Landmarks in Mathematics and Physics, Princeton University Press, Princeton, NJ.
van Heijenoort, Jean (1967, ed.), From Frege To Gödel : A Source Book in Mathematical Logic, 1879-1931, Harvard University Press, Cambridge, MA.
Quine, Willard Van Orman (1982), Methods of Logic, 1st ed. 1950, 2nd ed. 1959, 3rd ed. 1972. 4th edition, Harvard University Press, Cambridge, MA.
Runes, Dagobert D. (1962, ed.), Dictionary of Philosophy, Littlefield, Adams, and Company, Totowa, NJ.
Styazhkin, N.I. (1969), History of Mathematical Logic from Leibniz to Peano, MIT Press, Cambridge, MA.
Tarski, Alfred (1983), Logic, Semantics, Metamathematics : Papers from 1923 to 1938, J.H. Woodger (trans.), Oxford University Press, Oxford, UK, 1956. 2nd edition, John Corcoran (ed.), Hackett Publishing, Indianapolis, IN, 1983.

Document history

Portions of the above article are adapted from the following sources under the GNU Free Documentation License, under other applicable licenses, or by permission of the copyright holders.

$\operatorname{cond} : \mathbb{B} \times \mathbb{B} \to \mathbb{B}$
		$\operatorname{cond}(p, q)$
0	0	1
0	1	1
1	0	0
1	1	1