Deduction: Difference between revisions

From docs.reasonspace.com
Jump to navigation Jump to search
No edit summary
No edit summary
 
(52 intermediate revisions by the same user not shown)
Line 1: Line 1:
[https://plato.stanford.edu/entries/aristotle/ Aristotle], the first logician, defined deduction as follows:


A deduction is an inference in which the premises ''necessitate'' the conclusion—that is, there is no way for the conclusion to be false if the premises are true. Deduction is the type of argument that has been most studied by logicians. All deductive arguments follow one of a number of ''forms'', which one can learn and train oneself to recognize. Here are two examples of such forms:
<blockquote>A deduction is an argument in which, certain things being laid down, something other than these necessarily comes about through them. (''Topics'' I.1 100a25-27)</blockquote>


{| class="wikitable"
The premises are the "things laid down" and the conclusion is what comes about necessarily through them, so another way to put Aristotle's definition is to say that ''a deduction is an [[inference]] in which the premises necessitate the conclusion''. That means that the premises' being true would make the conclusion ''have to be'' true. It will be easier to see what's meant by "necessitate" or "have to be" if we look at some examples.
||{{Map|https://app.reasonspace.com/maps/6fb07cfb-d63f-49e9-b4a7-b9ea21477119}}
|{{Map|https://app.reasonspace.com/arguments/eb7e93c1-6222-4e24-beab-ffb67dafb29c}}
|-
|Barbara
|Modus Tollens
|}
 
The argument form on the left was first identified by [[Aristotle]] and was named [[Barbara]] by Medieval Philosophers who studied his logic. You can replace the capital letters S, M, and P with any terms you like, and you'll get a deductive argument.<ref>Notice that happens if you replace S with "Murderer of Carl," M with "Person with access to Carl's rose garden at midnight," and P with "Natalie,"  you get a very awkward way of rephrasing our now familiar argument that Natalie murdered Carl.</ref> The argument form on the right is called [[Modus Tollens]]. You can replace the lowercase letters "p" and "q" with any propositions you like, and (again) you'll get a deductive argument.


=Example 1: "Barbara"=


Even without knowing the forms of deductive argument explicitly, one can often tell simply by asking oneself whether the premises and conclusion of an argument are related in such a manner as to preclude any scenario under which the premises would be true and the conclusion false.
{{Map|https://app.reasonspace.com/arguments/916b58e1-07e7-484c-adf9-2cb8897c1eb7}}
 
Since every deduction is as strong as an inference can be, no deduction can be stronger than any other. Thus, on a scale representing the strength of inferences, we must represent deduction, not as a range, but as a point on the far right.


Let’s focus on the first of these examples, Argument U. Proposition 1 tells us that all birds are animals, and Proposition 2, adds that all parrots are birds, so if we were to deny Proposition 3, it would amount to our saying "All birds are animals, and here's a type of bird that isn't." We'd be caught in a contradiction. This is the sense in which Inference U necessitates Proposition 3.


[[file:deduction.png|thumb|center|600px]]
Notice that it is not because of anything special about the subject matter that the premises necessitate the conclusion. If we changed the argument to be about Volkswagens, cars, and Jettas, rather than birds, animals, and parrots, the premises would still necessitate the conclusion in exactly the same way. The same holds if we changed the argument to make it about musicians, matadors, and marriage counselors. In this last case, both premises would be false, but if they were true (that is, if all musicians were matadors and all matadors were marriage counselors), then the conclusion would have to be true: all musicians would ''have to'' be marriage counselors. What makes the deduction work doesn’t have to do with the subject matter of the propositions involved, but with their structure and interrelation. This is called the ''form'' of the argument.  


Argument V (in the map above) has the same form as Argument U. If you don’t see this immediately, try rewriting the phrase “need food” with “are things that need food” or “are food-needers”.


Deduction is the strongest type of inference—the type in which it is impossible for the conclusion to be false when the premises are true. This is sometimes expressed by saying that, in a deduction, the premises ''necessitate'' the conclusion or that the conclusion ''follows necessarily'' from them. It is this feature of necessitation that Aristotle, the first logician, focused on when defining deduction.<ref>Aristotle, the first logician, defined deduction as follows: “A deduction is an argument in which, certain things being laid down, something other than these necessarily comes about through them.” (Topics I.1 100a25-27)</ref>
In order to focus on the forms of deductive arguments rather than their content, Aristotle introduced the practice of using letters to stand for the subjects and predicates of the propositions, leaving behind only words like “some”, “all”, “no”, “is” and “not” (and their variants). Argument W (in the map above) uses letters in this way to display the Form of argument shared by Arguments U and V. It is one of the [[Aristotelian_Syllogisms |forms identified by Aristotle]], and it was named [[Aristotelian_Syllogisms#Barbara|Barbara]] by Medieval Philosophers who studied his logic. You can replace the capital letters S, M, and P with any terms you like, and you'll get a deductive argument.
We will discuss shortly what it is about the premises of deductive arguments that makes the conclusions follow necessarily, but first let’s make a few observations and introduce a few terms. Unlike the sorts of inferences that will be discussed in the remaining sections, deductive inferences do not differ from one another in strength. Either an inference is deductive, or it is not. However, there are some arguments that may seem like deductions when they are not. To differentiate between the genuine deductions and the imposters, logicians call the genuine ones ''valid'' deductions and the imposters ''invalid''. (We will turn soon to examples of each.) All valid deductive arguments have equally strong inferences, but this doesn’t mean that the arguments as a whole are equally strong, since their premises may still differ in epistemic status. Thus, the two things to do in evaluating a deductive argument are to determine whether it is valid and to assess the premises. 
If the deduction is valid and the premises are certain then the argument will make the conclusion certain. If it is valid and all but one of the premises are certain, then it will elevate the conclusion to the epistemic status of the remaining premise. If more than one of the premises is uncertain, then the argument will give us less reason to believe the conclusion than we have to believe the least certain of its premises.
Now let’s consider how the premises of deductive arguments necessitate their conclusions, by looking at some examples. (For the time being ignore the symbolic representation.)


{| class="wikitable"
=Example 2: "Modus Tollens"=
| Maps 16-18:
|-
|[https://app.reasonspace.com/maps/1478?token=41804760-1661-42e4-9c4c-c0628a7f964e https://app.reasonspace.com/arguments/1039/export?token=916b58e1-07e7-484c-adf9-2cb8897c1eb7&target=active&dpi=100&view=true&format=.png]
|}


Here are three maps that illustrate another form of argument, called [[Deductions_Involving_Complex_Propositions#Modus_Tollens|modus tollens]]:


{| class="wikitable"
{{Map|https://app.reasonspace.com/arguments/9df82f8daf9f49c5b32f9a2b19a0d373}}
|-
|All birds are animals.                  All parrots are birds.                  All parrots are animals.
|All animals need food.                  All men are animals.                   All men need food.  


|All B are C                            All A are B                            All A are C
Arguments X and Y share the same form, which is described in Argument Z. The letters "p" and "q" (in Argument Z) stand for whole propositions in the other two arguments, as shown in the table below.
|}


Let’s focus on the first of these examples. Notice that it is not because of anything special about the subject matter that the premises necessitate the conclusion. If we changed the argument to be about Volkswagens, cars, and Jettas, rather than birds, animals, and parrots, the premises would still necessitate the conclusion. The same holds if we changed the argument to make it about musicians, matadors, and marriage counselors. In this last case, both premises would be false, but if they were true (that is, if all musicians were matadors and all matadors, marriage counselors), then the conclusion would have to be true: all musicians would have to be marriage counselors. What makes the deduction work doesn’t have to do with the subject matter of the propositions involved, but with their structure and interrelation. This is called the ''form'' of the argument.
Notice now that the argument immediately to the right of the one we have been considering has the same logical form. (If you don’t see this immediately, try replacing the phrase “need food” with “are things that need food” or “are food-needers”.) In order to focus on the forms of deductive arguments rather than their content, Aristotle introduced the practice of using letters to stand for the subjects and predicates of the propositions, leaving behind only words like “some”, “all”, “no”, “is” and “not” (and their variants). Thus, we can arrive at the symbolic representation, presented in the right above, of the form of the arguments we’ve been discussing.
Here are some other forms of deductive arguments. (Again, the arguments next two each other share the same form which is represented symbolically on the right.)
{| class="wikitable"
{| class="wikitable"
| Maps 19-21:
|'''Argument X'''
|'''Argument Y'''
|'''Argument Z'''
|-
|-
|[https://app.reasonspace.com/maps/1478?token=41804760-1661-42e4-9c4c-c0628a7f964e https://app.reasonspace.com/arguments/1040/export?token=7ea78494-d796-48fe-bcb0-731f73379afb&target=active&dpi=100&view=true&format=.png]
|It is raining now.
|}
|Daddy likes coffee.
 
|p
{| class="wikitable"
| Maps 22-24:
|-
|-
|[https://app.reasonspace.com/maps/1478?token=41804760-1661-42e4-9c4c-c0628a7f964e https://app.reasonspace.com/arguments/1041/export?token=929a5fec-eb8c-4468-87c6-8a4cb5f82e76&target=active&dpi=100&view=true&format=.png]
|I feel wet.
|I've seen daddy drink coffee.
|q
|}
|}


{| class="wikitable"
(If you just mechanically substitute the relevant words in for the letters p and q, you won't always get grammatical sentences, so you need to edit the wording a bit. But with a little bit of practice, it's easy to see which arguments fall into this form.)
| Maps 25-27:
|-
|[https://app.reasonspace.com/maps/1478?token=41804760-1661-42e4-9c4c-c0628a7f964e https://app.reasonspace.com/arguments/1042/export?token=9ea18ef3-9d6c-4d80-ae4e-7447ea4ee011&target=active&dpi=100&view=true&format=.png]
|}


[[file:Map19-21.png|thumb|center|500px]]
The propositions in a modus tollens argument can be thought of as complex propositions. The first premise is relating two other propositions (p and q) telling you that if the first is true, then the other also is. The second premise is telling you that the second proposition (q) is not true, and the conclusion is that the first one (p) isn't true either. The premises might be false, but if they are true, then the conclusion would have to be.


[[file:Map_22-24.png|thumb|center|500px]]
=The strength of a deduction=


[[file:Map_25-27.png|thumb|center|500px]]
Unlike other sorts of inferences, deductive inferences do not differ from one another in strength. Either an inference is deductive, or it is not. However, there are some forms argument that may seem like deductions but are not. We can call these [[Deductive_Fallacies|deductive fallacies]].  To differentiate between the genuine deductions and the imposters, logicians call the genuine ones ''valid'', and they call any argument that isn't a deduction (but which someone might mistake for one) ''invalid''.


Aristotle went through all possible combinations of two premises and a conclusion that could be made with propositions of the form “All/Some A are/aren’t B” and figured out which were valid deductions. It turned out that all of the valid forms could be restated in terms of the four that we’ve already looked at.
All valid deductive arguments have equally strong inferences, but this doesn’t mean that the arguments are equally strong taken as wholes. The can differ in strength because their premises may differ in epistemic status. Thus, the two things to do in evaluating a deductive argument are to determine whether it is valid and to assess the premises.  
Why, in each of these cases, do the premises necessitate the conclusion? It is because one premise is a universal proposition saying something about everything of a certain sort and the other premise tells us that something else is that sort of thing. The conclusion then applies the universal premise about all things of the sort to the thing that the other premise tells us is a member of that sort. If the universal premise is really true, and the thing in question really belongs to the relevant sort, then the universal premise will, of course, have to apply to that thing. 
[[file:Aristotle_examples.png|thumb|center|500px]]


Though most deductive arguments involve the application of universal propositions to particular cases, not all do. Some, which were focused on by later Greek and Medieval logicians, involve the application of hypothetical statements to actual cases or the application of statements about alternative possibilities to cases in which some of the alternatives have been ruled out. Here are some examples:
Deduction is the most studied form of argument and many valid deductive argument forms have been identified. Even without knowing these forms explicitly, one can often tell simply by asking oneself whether the premises and conclusion of an argument are related in such a manner as to preclude any scenario under which the premises would be true and the conclusion false.
{| class="wikitable"
| Map 28-29:
|-
|[https://app.reasonspace.com/maps/1478?token=41804760-1661-42e4-9c4c-c0628a7f964e https://app.reasonspace.com/arguments/1044/export?token=91c26439-f505-4042-a37c-ac44c9114b34&target=active&dpi=100&view=true&format=.png]
|}


{| class="wikitable"
Since every deduction is as strong as an inference can be, no deduction can be stronger than any other. Thus, on a scale representing the strength of inferences, we must represent deduction, not as a range, but as a point on the far right.
| Map 30-31:
|-
|[https://app.reasonspace.com/maps/1478?token=41804760-1661-42e4-9c4c-c0628a7f964e https://app.reasonspace.com/arguments/1045/export?token=b0eb2c33-db22-4735-b11a-29e06170402e&target=active&dpi=100&view=true&format=.png]
|}
 
{| class="wikitable"
| Map 32-33:
|-
|[https://app.reasonspace.com/maps/1478?token=41804760-1661-42e4-9c4c-c0628a7f964e https://app.reasonspace.com/arguments/1049/export?token=858f60a9-6ede-4af0-8abd-7275bcf8be56&target=active&dpi=100&view=true&format=.png]
|}
 
These argument forms involve complex propositions that are built up from simpler ones. When representing the arguments symbolically, we use lowercase letters to represent the simpler propositions.
 
Thanks to Aristotle and later logicians, the way deductions of different sorts work is well understood, and the various valid and invalid forms have been catalogued. But even among people who have not studied their works it is relatively rare to find sustained disagreement about whether an argument is valid. People are generally quite good at recognizing whether or not the premises follow necessarily from the conclusion. 
 
That said, we do sometimes argue invalidly, particularly when we are not paying attention. Here are the three most common invalid argument forms (or “deductive fallacies”):
 
{| class="wikitable"
| Map 34-35:
|-
|[https://app.reasonspace.com/maps/1478?token=41804760-1661-42e4-9c4c-c0628a7f964e https://app.reasonspace.com/arguments/1046/export?token=12edaa53-06b9-487d-8dd6-1b2d428e57f5&target=active&dpi=100&view=true&format=.png]
|}
 
{| class="wikitable"
| Map 36-37:
|-
|[https://app.reasonspace.com/maps/1478?token=41804760-1661-42e4-9c4c-c0628a7f964e https://app.reasonspace.com/arguments/1047/export?token=83ebaa51-70f4-4a4a-b116-74824b9b8c62&target=active&dpi=100&view=true&format=.png]
|}
 
{| class="wikitable"
| Map 38-39:
|-
|[https://app.reasonspace.com/maps/1478?token=41804760-1661-42e4-9c4c-c0628a7f964e https://app.reasonspace.com/arguments/1048/export?token=89a7c8ca-66a7-4c50-9252-d43c3b163143&target=active&dpi=100&view=true&format=.png]
|}
 
[[file:Tableone.png|thumb|left|500px]]
For the purposes of this course, it is not necessary to memorize the samples of valid and invalid forms of deductive inference discussed in this section. They do not exhaust all the possible deductive forms, nor even all the forms that we will encounter this semester. When dealing with a deductive argument, instead of trying to classify it under one of the forms we’ve discussed, simply ask yourself whether the premises and conclusion are so related that it is impossible for the conclusion to be false, if the premises are true. If the answer isn’t immediately obvious, try to make up an argument of the same form with true premises and a false conclusion.
 
You might have gotten the impression from this section that deductive arguments are better than other kinds of arguments. There’s a respect in which this is true: their inferences are stronger. However, an argument is only as good as its premises, and the premises of deductions are (for the most part, at least) generalizations, all (or nearly all) of which are established by other forms of argument.<ref>Later in the term we will discuss whether there are any general propositions that are known independent of argument.</ref> Given this, is it more accurate to view deduction as the easier and more straightforward part of a process whose more difficult part is the arguments that establish the general propositions used as premises in the deductions. The primary form of argument by which these general propositions are established is ''induction'', which we will go on to discuss. Before turning to it, it will be useful to briefly address another topic.




[[file:deduction.png|thumb|center|600px]]


=Determining whether an inference is a (valid) deduction=


To determine whether an inference is a (valid) deduction, one needs to consider whether it has a (valid) [[deductive form]]. One can memorize the forms, and try to apply them, but even without doing this, you simply ask yourself whether the premises and conclusion are so related that it is impossible for the conclusion to be false, if the premises are true. Sometimes the answer will be immediately obvious. If it's not, try to make up an argument of the same form with true premises and a false conclusion. If you can make one up, then the argument isn't a valid deduction. If you can't, then there's a good chance that it is.


Even when the argument seems to have a valid deductive form like [[Barbara]] or [[Modus Tollens]], one has to check for the fallacy of [[equivocation]], since if a word appears with different meanings in different parts of an argument, the argument may not really have the form it appears to.


=Are deductive arguments better than other arguments?=


You might have gotten the impression from this section that deductive arguments are better than other kinds of arguments. There’s a respect in which this is true: their inferences are stronger. However, an argument is only as good as its premises, and the premises of deductions always either include universal propositions (of the "All S is P" or "No S is P") or complex propositions that asserting something about the relations between other propositions. Premises of both of these types are often difficult to know to be true. So a deduction is usually the easy part of a larger chain of arguments, in which earlier non-deductive arguments establish the premises needed for the deduced conclusion.




----
deductions are (for the most part, at least) generalizations, all (or nearly all) of which are established by other forms of argument. Given this, is it more accurate to view deduction as the easier and more straightforward part of a process whose more difficult part is the arguments that establish the general propositions used as premises in the deductions. The primary form of argument by which these general propositions are established is [[induction]].
;;'''Footnotes:'''

Latest revision as of 13:41, 22 August 2025

Aristotle, the first logician, defined deduction as follows:

A deduction is an argument in which, certain things being laid down, something other than these necessarily comes about through them. (Topics I.1 100a25-27)

The premises are the "things laid down" and the conclusion is what comes about necessarily through them, so another way to put Aristotle's definition is to say that a deduction is an inference in which the premises necessitate the conclusion. That means that the premises' being true would make the conclusion have to be true. It will be easier to see what's meant by "necessitate" or "have to be" if we look at some examples.

Example 1: "Barbara"

export?options%5Bembed%5D=true&options%5Bformat%5D=.png

Let’s focus on the first of these examples, Argument U. Proposition 1 tells us that all birds are animals, and Proposition 2, adds that all parrots are birds, so if we were to deny Proposition 3, it would amount to our saying "All birds are animals, and here's a type of bird that isn't." We'd be caught in a contradiction. This is the sense in which Inference U necessitates Proposition 3.

Notice that it is not because of anything special about the subject matter that the premises necessitate the conclusion. If we changed the argument to be about Volkswagens, cars, and Jettas, rather than birds, animals, and parrots, the premises would still necessitate the conclusion in exactly the same way. The same holds if we changed the argument to make it about musicians, matadors, and marriage counselors. In this last case, both premises would be false, but if they were true (that is, if all musicians were matadors and all matadors were marriage counselors), then the conclusion would have to be true: all musicians would have to be marriage counselors. What makes the deduction work doesn’t have to do with the subject matter of the propositions involved, but with their structure and interrelation. This is called the form of the argument.

Argument V (in the map above) has the same form as Argument U. If you don’t see this immediately, try rewriting the phrase “need food” with “are things that need food” or “are food-needers”.

In order to focus on the forms of deductive arguments rather than their content, Aristotle introduced the practice of using letters to stand for the subjects and predicates of the propositions, leaving behind only words like “some”, “all”, “no”, “is” and “not” (and their variants). Argument W (in the map above) uses letters in this way to display the Form of argument shared by Arguments U and V. It is one of the forms identified by Aristotle, and it was named Barbara by Medieval Philosophers who studied his logic. You can replace the capital letters S, M, and P with any terms you like, and you'll get a deductive argument.

Example 2: "Modus Tollens"

Here are three maps that illustrate another form of argument, called modus tollens:

export?options%5Bembed%5D=true&options%5Bformat%5D=.png

Arguments X and Y share the same form, which is described in Argument Z. The letters "p" and "q" (in Argument Z) stand for whole propositions in the other two arguments, as shown in the table below.

Argument X Argument Y Argument Z
It is raining now. Daddy likes coffee. p
I feel wet. I've seen daddy drink coffee. q

(If you just mechanically substitute the relevant words in for the letters p and q, you won't always get grammatical sentences, so you need to edit the wording a bit. But with a little bit of practice, it's easy to see which arguments fall into this form.)

The propositions in a modus tollens argument can be thought of as complex propositions. The first premise is relating two other propositions (p and q) telling you that if the first is true, then the other also is. The second premise is telling you that the second proposition (q) is not true, and the conclusion is that the first one (p) isn't true either. The premises might be false, but if they are true, then the conclusion would have to be.

The strength of a deduction

Unlike other sorts of inferences, deductive inferences do not differ from one another in strength. Either an inference is deductive, or it is not. However, there are some forms argument that may seem like deductions but are not. We can call these deductive fallacies. To differentiate between the genuine deductions and the imposters, logicians call the genuine ones valid, and they call any argument that isn't a deduction (but which someone might mistake for one) invalid.

All valid deductive arguments have equally strong inferences, but this doesn’t mean that the arguments are equally strong taken as wholes. The can differ in strength because their premises may differ in epistemic status. Thus, the two things to do in evaluating a deductive argument are to determine whether it is valid and to assess the premises.

Deduction is the most studied form of argument and many valid deductive argument forms have been identified. Even without knowing these forms explicitly, one can often tell simply by asking oneself whether the premises and conclusion of an argument are related in such a manner as to preclude any scenario under which the premises would be true and the conclusion false.

Since every deduction is as strong as an inference can be, no deduction can be stronger than any other. Thus, on a scale representing the strength of inferences, we must represent deduction, not as a range, but as a point on the far right.


Deduction.png

Determining whether an inference is a (valid) deduction

To determine whether an inference is a (valid) deduction, one needs to consider whether it has a (valid) deductive form. One can memorize the forms, and try to apply them, but even without doing this, you simply ask yourself whether the premises and conclusion are so related that it is impossible for the conclusion to be false, if the premises are true. Sometimes the answer will be immediately obvious. If it's not, try to make up an argument of the same form with true premises and a false conclusion. If you can make one up, then the argument isn't a valid deduction. If you can't, then there's a good chance that it is.

Even when the argument seems to have a valid deductive form like Barbara or Modus Tollens, one has to check for the fallacy of equivocation, since if a word appears with different meanings in different parts of an argument, the argument may not really have the form it appears to.

Are deductive arguments better than other arguments?

You might have gotten the impression from this section that deductive arguments are better than other kinds of arguments. There’s a respect in which this is true: their inferences are stronger. However, an argument is only as good as its premises, and the premises of deductions always either include universal propositions (of the "All S is P" or "No S is P") or complex propositions that asserting something about the relations between other propositions. Premises of both of these types are often difficult to know to be true. So a deduction is usually the easy part of a larger chain of arguments, in which earlier non-deductive arguments establish the premises needed for the deduced conclusion.


deductions are (for the most part, at least) generalizations, all (or nearly all) of which are established by other forms of argument. Given this, is it more accurate to view deduction as the easier and more straightforward part of a process whose more difficult part is the arguments that establish the general propositions used as premises in the deductions. The primary form of argument by which these general propositions are established is induction.