Line 2,178: |
Line 2,178: |
| By way of a very preliminary orientation, let us consider the distinction between ''information reducing inferences'' and ''information preserving inferences''. It is prudent to make make our first acquaintance with this distinction in the medium of some concrete and simple examples. | | By way of a very preliminary orientation, let us consider the distinction between ''information reducing inferences'' and ''information preserving inferences''. It is prudent to make make our first acquaintance with this distinction in the medium of some concrete and simple examples. |
| | | |
− | {| align="center" cellpadding="6" width="90%" | + | {| align="center" cellpadding="8" width="90%" |
| | width="1%" | <big>•</big> | | | width="1%" | <big>•</big> |
| | '''Example 1. Modus Ponens''' | | | '''Example 1. Modus Ponens''' |
Line 2,215: |
Line 2,215: |
| Let us examine these two types of inference in a little more detail. A display of the form: | | Let us examine these two types of inference in a little more detail. A display of the form: |
| | | |
− | : ''Expression''<sub>1</sub>
| + | {| align="center" cellpadding="8" width="90%" |
− | : ''Expression''<sub>2</sub>
| + | | |
− | : ––––––––––––
| + | <math>\begin{array}{l} |
− | : ''Expression''<sub>3</sub>
| + | \textit{Expression~1} |
| + | \\ |
| + | \textit{Expression~2} |
| + | \\ |
| + | \overline{~~~~~~~~~~~~~~~~~~~~} |
| + | \\ |
| + | \textit{Expression~3} |
| + | \end{array}</math> |
| + | |} |
| | | |
− | is used to state a ''rule of inference'' (ROI). The expressions above the line of inference are called ''premisses'' and the expression below the line is called a ''conclusion'', (also ''outcome'', ''result'', or ''upshot''). | + | is used to state a ''rule of inference'' (ROI). The expressions above the line are called ''premisses'' and the expression below the line is called a ''conclusion''. |
| | | |
− | If the ROI in question is succinct enough, one may write it in-line, as ''Premiss''<sub>1</sub>, ''Premiss''<sub>2</sub> |– ''Conclusion'', where the symbol "|–" is called the ''(proof-theoretic) turnstile''. | + | If the rule of inferenced is succinct, the ''proof-theoretic turnstile symbol'' <math>{}^{\backprime\backprime} \vdash {}^{\prime\prime}</math> may be used to write it on a single line, as follows: |
| + | |
| + | {| align="center" cellpadding="8" width="90%" |
| + | | |
| + | <math>\textit{Premiss~1}, \textit{Premiss~2} ~\vdash~ \textit{Conclusion}</math> |
| + | |} |
| | | |
− | Either way, one reads such a ROI in the following manner: "From ''Expression''<sub>1</sub> and ''Expression''<sub>2</sub>, infer ''Expression''<sub>3</sub>". | + | Either way, one reads such a rule in the following manner: "From <math>\textit{Expression~1}</math> and <math>\textit{Expression~2}</math> infer <math>\textit{Expression~3}.</math> |
| | | |
− | Looking to our first Example, the ROI that is classically known as ''modus ponens'' says the following: If one has that ''p'' implies ''q'', and one has that ''p'' is true, then one has a ''way of putting it forward'' that q is true. | + | Looking to our first Example, the rule that is classically known as ''modus ponens'' says the following: If one has that ''p'' implies ''q'', and one has that ''p'' is true, then one has a ''way of putting it forward'' that q is true. |
| | | |
| Modus ponens is an ''illative'' or ''implicational'' rule. Passage through its turnstile incurs the toll of some information loss, and thus from a fact of ''q'' alone one cannot infer with any degree of certainty that ''p'' ⇒ ''q'' and ''p'' are the reasons why ''q'' happens to be true. | | Modus ponens is an ''illative'' or ''implicational'' rule. Passage through its turnstile incurs the toll of some information loss, and thus from a fact of ''q'' alone one cannot infer with any degree of certainty that ''p'' ⇒ ''q'' and ''p'' are the reasons why ''q'' happens to be true. |