Difference between revisions of "Logical implication"

MyWikiBiz, Author Your Legacy — Tuesday April 16, 2024
Jump to navigationJump to search
Line 97: Line 97:
 
|}
 
|}
  
The relationship between <math>Cond\!</math> and <math>L\!</math> exemplifies the standard association that exists between any binary operation and its corresponding triadic relation.
+
The relationship between <math>\operatorname{Cond}</math> and <math>L\!</math> exemplifies the standard association that exists between any binary operation and its corresponding triadic relation.
  
The conditional sign "<math>\rightarrow\!</math>" denotes the same formal object as the function name "<math>Cond\mbox{ }\!</math>", the only difference being that the first is written infix while the second is written prefix.  Thus we have the following equation:
+
The conditional sign "<math>\rightarrow\!</math>" denotes the same formal object as the function name "<math>\operatorname{Cond}\mbox{ }\!</math>", the only difference being that the first is written infix while the second is written prefix.  Thus we have the following equation:
  
 
{| align="center" cellspacing="10" width="90%"
 
{| align="center" cellspacing="10" width="90%"
Line 111: Line 111:
 
|}
 
|}
  
Associated with the triadic relation <math>L\!</math> is a binary relation <math>L_{\underline{~} \underline{~} \operatorname{T}} \subseteq \mathbb{B} \times \mathbb{B}\!</math> that is called the ''[[image (mathematics)|fiber]]'' of <math>L\!</math> with <math>\operatorname{T}</math> in the third place.  This object is defined as follows:
+
Associated with the triadic relation <math>L\!</math> is a binary relation <math>L_{\underline{~} ~ \underline{~} ~ \operatorname{T}} \subseteq \mathbb{B} \times \mathbb{B}</math> that is called the ''fiber'' of <math>L\!</math> with <math>\operatorname{T}</math> in the third place.  This object is defined as follows:
  
 
{| align="center" cellspacing="10" width="90%"
 
{| align="center" cellspacing="10" width="90%"
| <math>L_{..T} = \{ (p, q) \in \mathbb{B} \times \mathbb{B} : (p, q, \operatorname{T}) \in L \}.</math>
+
| <math>L_{\underline{~} ~ \underline{~} ~ \operatorname{T}} = \{ (p, q) \in \mathbb{B} \times \mathbb{B} : (p, q, \operatorname{T}) \in L \}.</math>
 
|}
 
|}
  
 
The same object is achieved in the following way.  Begin with the binary operation:
 
The same object is achieved in the following way.  Begin with the binary operation:
  
: <math>Cond : \mathbb{B} \times \mathbb{B} \to \mathbb{B}\,.\!</math>
+
: <math>\operatorname{Cond} : \mathbb{B} \times \mathbb{B} \to \mathbb{B}\,.\!</math>
  
Form the binary relation that is called the ''fiber'' of <math>Cond\!</math> at <math>T\!</math>, notated as follows:
+
Form the binary relation that is called the ''fiber'' of <math>\operatorname{Cond}</math> at <math>T\!</math>, notated as follows:
  
: <math>Cond^{-1}(T) \subseteq \mathbb{B} \times \mathbb{B}\,.\!</math>
+
: <math>\operatorname{Cond}^{-1}(T) \subseteq \mathbb{B} \times \mathbb{B}\,.\!</math>
  
 
This object is defined as follows:
 
This object is defined as follows:
  
: <math>Cond^{-1}(T) = \{ (p,\ q) \in \mathbb{B} \times \mathbb{B}\ :\ Cond (p,\ q) = T \}\,.\!</math>
+
: <math>\operatorname{Cond}^{-1}(T) = \{ (p,\ q) \in \mathbb{B} \times \mathbb{B}\ :\ \operatorname{Cond} (p,\ q) = T \}\,.\!</math>
  
The implication sign "<math>\Rightarrow\!</math>" denotes the same formal object as the relation names "<math>L_{..T}\mbox{ }\!</math>" and "<math>Cond^{-1}(T)\mbox{ }\!</math>", the only differences being purely syntactic.  Thus we have the following logical equivalence:
+
The implication sign "<math>\Rightarrow\!</math>" denotes the same formal object as the relation names "<math>L_{..T}\mbox{ }\!</math>" and "<math>\operatorname{Cond}^{-1}(T)\mbox{ }\!</math>", the only differences being purely syntactic.  Thus we have the following logical equivalence:
  
: <math>(p \Rightarrow q) \iff (p,\ q) \in L_{..T} \iff (p,\ q) \in Cond^{-1}(T)\,.\!</math>
+
: <math>(p \Rightarrow q) \iff (p,\ q) \in L_{..T} \iff (p,\ q) \in \operatorname{Cond}^{-1}(T)\,.\!</math>
  
 
This completes the derivation of the mathematical objects that are denoted by the signs "<math>\rightarrow\!</math>" and "<math>\Rightarrow\!</math>" in this discussion.  It needs to be remembered, though, that not all writers observe this distinction in every context.  Especially in mathematics, where the single arrow sign "<math>\rightarrow\!</math>" is reserved for function notation, it is common to see the double arrow sign "<math>\Rightarrow\!</math>" being used for both concepts.
 
This completes the derivation of the mathematical objects that are denoted by the signs "<math>\rightarrow\!</math>" and "<math>\Rightarrow\!</math>" in this discussion.  It needs to be remembered, though, that not all writers observe this distinction in every context.  Especially in mathematics, where the single arrow sign "<math>\rightarrow\!</math>" is reserved for function notation, it is common to see the double arrow sign "<math>\Rightarrow\!</math>" being used for both concepts.

Revision as of 20:30, 12 May 2012

This page belongs to resource collections on Logic and Inquiry.

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:

\(\begin{array}{l} p ~\text{implies}~ q. \'"`UNIQ-MathJax1-QINU`"' Form the binary relation that is called the ''fiber'' of \(\operatorname{Cond}\) at \(T\!\), notated as follows:

\[\operatorname{Cond}^{-1}(T) \subseteq \mathbb{B} \times \mathbb{B}\,.\!\]

This object is defined as follows:

\[\operatorname{Cond}^{-1}(T) = \{ (p,\ q) \in \mathbb{B} \times \mathbb{B}\ :\ \operatorname{Cond} (p,\ q) = T \}\,.\!\]

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

\[(p \Rightarrow q) \iff (p,\ q) \in L_{..T} \iff (p,\ q) \in \operatorname{Cond}^{-1}(T)\,.\!\]

This completes the derivation of the mathematical objects that are denoted by the signs "\(\rightarrow\!\)" and "\(\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 single arrow sign "\(\rightarrow\!\)" is reserved for function notation, it is common to see the double arrow sign "\(\Rightarrow\!\)" being used for both concepts.

References

  • Brown, Frank Markham (2003), Boolean Reasoning: The Logic of Boolean Equations, 1st edition, Kluwer Academic Publishers, Norwell, MA. 2nd edition, Dover Publications, Mineola, NY, 2003.
  • Edgington, Dorothy (2001), "Conditionals", in Lou Goble (ed.), The Blackwell Guide to Philosophical Logic, Blackwell.
  • Edgington, Dorothy (2006), "Conditionals", in Edward N. Zalta (ed.), The Stanford Encyclopedia of Philosophy, Eprint.
  • Quine, W.V. (1982), Methods of Logic, (1st ed. 1950), (2nd ed. 1959), (3rd ed. 1972), 4th edition, Harvard University Press, Cambridge, MA.

Syllabus

Focal nodes

Template:Col-breakTemplate:Col-breakTemplate:Col-end

Peer nodes

Template:Col-breakTemplate:Col-breakTemplate:Col-end

Logical operators

Template:Col-breakTemplate:Col-breakTemplate:Col-end

Related topics

Template:Col-breakTemplate:Col-breakTemplate:Col-breakTemplate:Col-end

Relational concepts

Template:Col-breakTemplate:Col-breakTemplate:Col-breakTemplate:Col-end

Information, Inquiry

Template:Col-breakTemplate:Col-breakTemplate:Col-breakTemplate:Col-breakTemplate:Col-end

Related articles

Document history

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

Template:Col-breakTemplate:Col-breakTemplate:Col-breakTemplate:Col-end
<sharethis />