{"id":202,"date":"2020-07-13T18:42:12","date_gmt":"2020-07-13T18:42:12","guid":{"rendered":"https:\/\/integrations.pressbooks.network\/testclone\/?post_type=chapter&p=202"},"modified":"2023-08-14T17:34:21","modified_gmt":"2023-08-14T17:34:21","slug":"footnotes-with-block-elements","status":"publish","type":"chapter","link":"https:\/\/integrations.pressbooks.network\/test-clone\/chapter\/footnotes-with-block-elements\/","title":{"raw":"footnotes with block elements","rendered":"footnotes with block elements"},"content":{"raw":"This chapter discusses some philosophical issues concerning the nature of formal logic. Particular attention will be given to the concept of logical form, the goal of formal logic in capturing logical form, and the explanation of validity in terms of logical form. We shall see how this understanding of the notion of validity allows us to identify what we call formal fallacies, which are mistakes in an argument due to its logical form. We shall also discuss some philosophical problems about the nature of logical forms. For the sake of simplicity, our focus will be on [pb_glossary id=\"113\"]propositional logic[\/pb_glossary]. But many of the results to be discussed do not depend on this choice, and are applicable to more advanced logical systems.\r\n

Logic, Validity, and Logical Forms<\/h2>\r\nDifferent sciences have different subject matters: physics tries to discover the properties of matter, history aims to discover what happened in the past, biology studies the development and evolution of living organisms, mathematics is, or at least seems to be, about numbers, sets, geometrical spaces, and the like. But what is it that logic investigates? What, indeed, is logic?\r\n\r\nThis is an essentially philosophical question, but its answer requires reflection on the status and behavior of logical rules and inferences. Textbooks typically present logic as the science of the relation of consequence<\/em> that holds between the premises and the conclusion of a [pb_glossary id=\"121\"]valid argument[\/pb_glossary]<\/strong>, where an argument is valid if it is not possible for its premises to be true and the conclusion false. If logic is the science of the relation of consequence that holds between the premises and the conclusion of a valid argument, we can say that logicians will be concerned with whether a conclusion of an argument is or is not a consequence of its premises.\r\n\r\nLet us examine the notion of validity with more care. For example, consider the following argument:\r\n
    \r\n \t
  1. If Alex is a sea bream, then Alex is not a rose.<\/li>\r\n \t
  2. Alex is a rose.<\/li>\r\n \t
  3. $latex \/ \\therefore$ Alex is not a sea bream.<\/li>\r\n<\/ol>\r\nIt can be shown that it is not possible for (1) and (2) to be true yet (3) false. Hence, the whole argument is valid. For convenience, let us represent each sentence of the argument into the standard propositional logic, which aims to analyze the structure and meaning of various propositions. To do this, we must first introduce the language of our logic.\r\n\r\nThe alphabet of propositional logic contains letters standing for sentences: A<\/em>, B<\/em>, C<\/em>, and so on. For example, we can translate \u201cAlex is a rose\u201d by just using B<\/em>. Similarly, we can use S<\/em> to translate \u201cI would love to smell it.\u201d The alphabet of propositional logic contains other symbols known as [pb_glossary id=\"99\"]logical connectives<\/strong>[\/pb_glossary]. One is a symbol for \u201cnot\u201d or negation<\/em> $latex (\\neg )$.\u00a0 When we say that Alex is not<\/em> a rose, we, in effect, say that it is not the case that Alex is a rose. If we translate \u201cAlex is a rose\u201d by B<\/em>, we translate \u201cAlex is not a rose\u201d as \u201c$latex \\neg B$.\u201d\u00a0 Another is a symbol $latex (\\rightarrow)$ for conditional sentences of the form \u201cif \u2026 then \u2026.\u201d For example, we can translate \u201cIf Alex is a rose, then I would love to smell it\u201d as \u201c$latex B \\rightarrow A$.\u201d When we say that if Alex is a rose, then I would love to smell it, we say something conditional: on the condition that Alex is a rose, I would love to smell it. In general, a conditional sentence has two components. We call the first component the antecedent<\/em>, the second component the consequent<\/em>, and the whole proposition a [pb_glossary id=\"77\"]conditional[\/pb_glossary]<\/strong>. The language of our logic also includes \u201cand\u201d $latex (\\wedge)$, otherwise known as conjunction<\/em>, and \u201cor\u201d $latex (\\vee)$, otherwise known as disjunction<\/em>. But in this chapter, we shall only deal with negation and conditional.\r\n\r\nThus, if we use A<\/em> for \u201cAlex is a sea bream,\u201d we can represent (1) with $latex A \\rightarrow \\neg B$, and represent our above argument (1)-(3) as follows:\r\n
      \r\n \t
    1. $latex A \\rightarrow \\neg B$<\/li>\r\n \t
    2. $latex B$<\/li>\r\n \t
    3. $latex \/ \\therefore \\neg A$<\/li>\r\n<\/ol>\r\nBut, recall, our aim was to examine why this argument, if at all, is valid. The mere representation of \u201cnot\u201d by \u201c$latex \\neg$\u201d and \u201cif \u2026 then\u201d by \u201c$latex \\rightarrow$\u201d will not be sufficient to verify the validity or invalidity of a given argument: we also need to know what these symbols and the propositions they express mean<\/em>.\u00a0 But how can we specify the meaning<\/em> of \u201c$latex neg$ \u201d and \u201c$latex \\rightarrow$\u201d?\r\n\r\nIt is plausible to say that if A<\/em> is true, then its negation is false, and vice versa. For example, if \u201cAlex is a rose\u201d is true, then \u201cAlex is not a rose\u201d is false. This gives us the meaning of \u201c$latex \\neg$\u201d. We can represent this information about the meaning of negation in terms of a truth-table<\/em> in the following way (with T symbolising true<\/em>, and F false<\/em>):\r\n\r\n \r\n
      \r\n\r\n\r\n\r\n\r\n
      Truth table for negation<\/caption>\r\n
      $latex A$<\/strong><\/th>\r\n$latex \\neg A$<\/strong><\/th>\r\n<\/tr>\r\n
      T<\/td>\r\nF<\/td>\r\n<\/tr>\r\n
      F<\/td>\r\nT<\/td>\r\n<\/tr>\r\n<\/tbody>\r\n<\/table>\r\n<\/div>\r\nHere, we can read each row of the truth-table as a way the world could be. That is, in situations or possible worlds where A<\/em> is true (for example, where Alex is indeed a sea bream), $latex \\neg \\textit{A}$ is false (it is false that Alex is a sea bream); and vice versa. Thus construed, a truth-table gives us the situations in which a proposition such as A<\/em> is true, and those in which it is false. In addition, it tells us in what situations $latex \\neg \\textit{A}$ is true, and in what situations it is false.\r\n\r\nIn a similar way, we can specify the meaning of \u201c$latex \\rightarrow$\u201d by specifying the situations in which conditional propositions of the form \u201c$latex \\textit{A} \\rightarrow \\textit{B}$\u201d are true or false. Here is the standard truth-table for \u201c$latex \\rightarrow$\u201d:\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n
      Truth table for material conditional<\/caption>\r\n
      $latex A$<\/strong><\/th>\r\n\u00a0$latex B$<\/strong><\/th>\r\n$latex A \\rightarrow B$<\/strong><\/th>\r\n<\/tr>\r\n
      T<\/td>\r\nT<\/td>\r\nT<\/td>\r\n<\/tr>\r\n
      T<\/td>\r\nF<\/td>\r\nF<\/td>\r\n<\/tr>\r\n
      F<\/td>\r\nT<\/td>\r\nT<\/td>\r\n<\/tr>\r\n
      F<\/td>\r\nF<\/td>\r\nT<\/td>\r\n<\/tr>\r\n<\/tbody>\r\n<\/table>\r\nAs can be seen, there is only one row in which $latex \\textit{A} \\rightarrow \\textit{B}$ is false; i.e. the second row in which the consequent is false, but the antecedent is true. As the first row tells us, if both A<\/em> and B<\/em> are true, then so is $latex \\textit{A} \\rightarrow \\textit{B}$. Further, the third and fourth rows tell us that if the antecedent is false, then the whole conditional is true, regardless of whether the consequent is true or false. Hence, all conditionals with false antecedents are true.\r\n\r\nBut how is it possible for a conditional to be true if its antecedent is false? Here is one suggestion to answer this question: if your assumption is false, then you can legitimately conclude whatever you would like to. For example, if you assume that Amsterdam is the capital of England, you can legitimately conclude anything whatsoever; it does not matter whether it\u2019s true or false. Thus, from the assumption that Amsterdam is the capital of England, you can conclude that Paris is the capital of France. You can also conclude that Paris is the capital of Brazil.\r\n\r\nWe can see that one important piece of information that truth-tables convey concerns how the truth or falsity of complex sentences such as $latex \\textit{A} \\rightarrow \\textit{B}$ and $latex \\neg \\textit{A}$ depends on the truth or falsity of the propositional letters they contain: the truth or falsity of\u00a0$latex \\textit{A} \\rightarrow \\textit{B}$ depends solely on the truth or falsity of A<\/em> and of B<\/em>. Similarly, the truth or falsity of $latex \\neg \\textit{A}$ depends solely on that of A<\/em>.\r\n\r\nNow we are in a position to verify whether our argument (1)-(3) is valid or not. And, as we shall see in a moment, the validity or invalidity of an argument depends on the meaning of the logical connectives (such as \u201c$latex \\rightarrow$\u201d and \u201c$latex \\neg$\u201d) which is specified by the corresponding truth-tables. In other words, if the truth-tables of these connectives were different to what they actually are, we would have a different collection of valid arguments.\r\n\r\nWe defined an argument as valid if it is not possible for its premises to be true and the conclusion false. By designing a truth-table, we can see under what conditions the premises $latex (\\textit{A} \\rightarrow \\neg \\textit{B}, \\textit{B})$ and the conclusion $latex (\\neg \\textit{A})$ of our argument (1)-(3) are true or false:\r\n\r\n \r\n
      \r\n\r\n\r\n\r\n\r\n\r\n\r\n
      Truth table for argument (1)-(3)<\/caption>\r\n
      $latex A$<\/strong><\/th>\r\n$latex A$<\/strong><\/th>\r\n$latex A \\rightarrow \\neg B$<\/strong><\/span><\/th>\r\n$latex B$<\/strong><\/span><\/th>\r\n$latex \\neg A$<\/strong><\/span><\/th>\r\n<\/tr>\r\n
      T<\/td>\r\nT<\/td>\r\nF<\/span><\/td>\r\nT<\/span><\/td>\r\nF<\/span><\/td>\r\n<\/tr>\r\n
      T<\/td>\r\nF<\/td>\r\nF<\/span><\/td>\r\nF<\/span><\/td>\r\nT<\/span><\/td>\r\n<\/tr>\r\n
      F<\/td>\r\nT<\/td>\r\nT<\/span><\/td>\r\nT<\/span><\/td>\r\nT<\/span><\/td>\r\n<\/tr>\r\n
      F<\/td>\r\nF<\/td>\r\nT<\/span><\/td>\r\nF<\/span><\/td>\r\nT<\/span><\/td>\r\n<\/tr>\r\n<\/tbody>\r\n<\/table>\r\n<\/div>\r\nSince in the above truth-table, there is no row in which the premises\u00a0$latex (\\textit{A} \\rightarrow \\neg \\textit{B}, \\textit{B})$ are true and the conclusion $latex (\\neg A)$ false, the argument is valid. The only row in which the premises are both true is the third row, and in that row the conclusion is also true. In other words, there is no world or situation in which (1) and (2) are true, but (3) is not. This just means that the argument is valid.\r\n\r\nNow, consider the following argument:\r\n
        \r\n \t
      1. If Alex is a tiger, then Alex is an animal.<\/li>\r\n \t
      2. Alex is not a tiger.<\/li>\r\n \t
      3. $latex \/ \\therefore$ Alex is not an animal.<\/li>\r\n<\/ol>\r\nThere are situations in which the argument works perfectly well. For example, suppose that Alex is not a tiger but is, in fact, a table. In this case, Alex would not be an animal, either. And thus, the sentences (4), (5), and (6) would be true. But this is not always<\/em> the case, for we can imagine a situation in which the premises are true but the conclusion false, such as where Alex is not a tiger but is, in fact, a dog. Thus, by imagining the situation just described, we would have produced a counterexample: in this situation, (6) would be false, and hence it would not be a consequence of (4) and (5). The argument is invalid.\r\n\r\nThat the argument is invalid can also be verified by the method of truth-tables. For we can find a situation in which (4) and (5) are both true and yet (6) false. That is, in the truth-table, if we represent (4) as $latex \\textit{C} \\rightarrow \\textit{D}$, (5) as $latex \\neg \\textit{C}$, and (6) as $latex \\neg \\textit{D}$, there will be at least one row in which the premises are true and the conclusion false (which row is that?):\r\n\r\n \r\n
        \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n
        Truth table for argument (4)-(6)<\/caption>\r\n
        $latex C$<\/strong><\/th>\r\n$latex D$<\/strong><\/th>\r\n$latex C\\rightarrow D$<\/span><\/th>\r\n$latex \\neg C$<\/strong><\/span><\/th>\r\n$latex \\neg D$<\/strong><\/span><\/th>\r\n<\/tr>\r\n<\/thead>\r\n
        T<\/td>\r\nT<\/td>\r\nT<\/span><\/td>\r\nF<\/span><\/td>\r\nF<\/span><\/td>\r\n<\/tr>\r\n
        T<\/td>\r\nF<\/td>\r\nF<\/span><\/td>\r\nF<\/span><\/td>\r\nT<\/span><\/td>\r\n<\/tr>\r\n
        F<\/td>\r\nT<\/td>\r\nT<\/span><\/td>\r\nT<\/span><\/td>\r\nF<\/span><\/td>\r\n<\/tr>\r\n
        F<\/td>\r\nF<\/td>\r\nT<\/span><\/td>\r\nT<\/span><\/td>\r\nT<\/span><\/td>\r\n<\/tr>\r\n<\/tbody>\r\n<\/table>\r\n<\/div>\r\nWe said that logicians are concerned with validity or invalidity of arguments, and we proposed the method of truth-tables for undertaking this task. But which arguments are valid, and which are not? It is here that the notion of [pb_glossary id=\"101\"]logical form[\/pb_glossary]<\/strong> emerges. Suppose that a logician embarks on the ridiculous task of recording each and every valid argument. In this case, she would surely record that (1)-(3) is valid. Now, suppose she faces the following argument:\r\n
          \r\n \t
        1. If Alice is reading Hegel, she is not frustrated.<\/li>\r\n \t
        2. Alice is frustrated.<\/li>\r\n \t
        3. $latex \/ \\therefore$ Alice is not reading Hegel.<\/li>\r\n<\/ol>\r\nTo see whether this argument is valid or not, she can rewrite each sentence of the argument in her logical language: Alice is reading Hegel $latex (\\textit{P})$; Alice is frustrated $latex (\\textit{Q})$; and, if Alice is reading Hegel, then Alice is not frustrated) $latex (\\textit{P} \\rightarrow \\neg \\textit{Q})$. She can then design a suitable truth-table, and check whether there is any row or situation in which the premises are both true and the conclusion false. Since there is no such row (why?), she will correctly announce that the argument is valid.\r\n\r\nBut it is obvious that in order to check the validity of (7)-(9), our logician did not need to go to this effort. It would suffice if she just noted that the two arguments (1)-(3) and (7)-(9), and their respective truth-tables, are to a great extent similar<\/em>; they have the same form<\/em>. In fact, their only difference is that in the first, the letters A<\/em> and B<\/em> have been used, and in the second they have been substituted for P<\/em> and Q<\/em>, respectively. The logical connectives $latex \\rightarrow$ and $latex \\neg$ have not changed.\r\n\r\nTo see the point, let us translate each argument into the language of propositional logic we introduced above:\r\n
            \r\n \t
          1. $latex \\textit{A} \\rightarrow \\neg \\textit{B}$<\/li>\r\n \t
          2. $latex \\textit{B}$<\/li>\r\n \t
          3. $latex \/ \\therefore \\neg \\textit{A}$<\/li>\r\n<\/ol>\r\n
              \r\n \t
            1. $latex \\textit{P} \\rightarrow \\neg \\textit{Q}$<\/li>\r\n \t
            2. $latex \\textit{Q}$<\/li>\r\n \t
            3. $latex \/ \\therefore \\neg \\textit{P}$<\/li>\r\n<\/ol>\r\nThe two arguments have something in common<\/em>. Let us say that what they have in common is their logical form<\/em>. As you can see, the logical connectives of the arguments have not changed. Since the two arguments have the same form, if one is valid, then the other must be valid, too. More generally, all arguments of this same form are valid. The liberating news is that our logician does not need to embark on the exasperating task of checking the validity of each and every argument separately. For if she already knows that a given argument is valid, and if she can also show that another argument has the same form as the first one, then she can be sure that the second argument is valid without having to design its truth-table.\r\n\r\nWe said that an argument is valid if it is not possible for the premises to be true and the conclusion false. Now, we can say that every argument which shares its form with a valid argument is also valid, and consequently, every argument which shares its form with an invalid argument is also invalid.[footnote]It is more accurate to say that every argument which shares its form with an invalid argument is also invalid within that logic,<\/em> but not necessarily for every logic. For example, in propositional logic,\r\n
                \r\n \t
              1. All men are mortal<\/li>\r\n \t
              2. Socrates is a man<\/li>\r\n \t
              3. $latex \/ \\therefore$ Socrates is mortal<\/li>\r\n<\/ol>\r\nis of the same logical form as:\r\n
                  \r\n \t
                1. All men are immortal<\/li>\r\n \t
                2. Socrates is a man<\/li>\r\n \t
                3. $latex \/ \\therefore$ Socrates is mortal<\/li>\r\n<\/ol>\r\nBoth of these arguments can be translated as follows:\r\n
                    \r\n \t
                  1. P<\/li>\r\n \t
                  2. Q<\/li>\r\n \t
                  3. $latex \/ \\therefore$ R<\/li>\r\n<\/ol>\r\nBut (4)-(6), as opposed to (1)-(3), is invalid, for if all men are immortal and Socrates is a man, then Socrates is immortal. Thus, in propositional logic, both of these arguments have the same logical form, even though, from the perspective of a more expressive logic, such as first-order logic, which explains the role that quantifiers such as \u201call\u201d and \u201csome\u201d play within arguments, only the first is valid. Thus, every argument which shares its form with a valid argument is valid within that logic, but not necessarily across the board.[\/footnote]It is in this sense that the idea of logical form can be used to establish the (in)validity of arguments. For example, suppose that we want to check the validity of the following argument:\r\n
                      \r\n \t
                    1. If Alice is reading Russell, then Alice is thinking of logic.<\/li>\r\n \t
                    2. Alice is not reading Russell.<\/li>\r\n \t
                    3. $latex \/ \\therefore$ Alice is not thinking of logic.<\/li>\r\n<\/ol>\r\nAs soon as we see that (10)-(12) has the same form as (4)-(6), which we already know to be invalid, we can be assured that the former is also invalid without having to construct its truth-table.\r\n\r\nThus, we can see that understanding the notion of validity in terms of logical form allows us to identify various formal fallacies<\/em>. For example, the argument (10)-(12) is an instance of the fallacy of denying the antecedent<\/em>. Thus, every argument which shares its form with (10)-(12) is also invalid.\r\n\r\nThere are three further questions we may ask about logical forms: (i) How can we \u201cextract\u201d the logical form from arguments which they share? That is, how can we show that various arguments are instances of a common logical form? (ii) What is the nature of a logical form? Is a logical form a thing<\/em>, and if so, what sort of thing is it? (iii) Does each argument have only one logical form? In the following three sections, we shall talk about these three questions, respectively.\r\n

                      Extracting Logical Forms<\/h2>\r\nLet us, again, consider the arguments (1)-(3) and (7)-(9) which seem to share one and the same logical form. How can we show<\/em> that they have a common logical form? First, we should represent them in logical symbols:\r\n
                        \r\n \t
                      1. $latex \\textit{A} \\rightarrow \\neg \\textit{B}$<\/li>\r\n \t
                      2. $latex \\textit{B}$<\/li>\r\n \t
                      3. $latex \/ \\therefore \\neg \\textit{A}$<\/li>\r\n<\/ol>\r\n
                          \r\n \t
                        1. $latex \\textit{P} \\rightarrow \\neg \\textit{Q}$<\/li>\r\n \t
                        2. $latex \\textit{Q}$<\/li>\r\n \t
                        3. $latex \/ \\therefore \\neg \\textit{P}$<\/li>\r\n<\/ol>\r\nTo see what these two arguments have in common, we must abstract away from (or ignore or leave aside) the specific contents of their particular premises and conclusions, and thereby reveal a general form that is common to these arguments. For example, we must ignore whether Alex is or is not a rose; all that matters is to replace \u201cAlex is a rose\u201d with B<\/em>. In this sense, to obtain or extract the logical form of an argument, we must abstract from the content of the premises and the conclusion by regarding them as mere place-holders in the form that the argument exhibits. As you may have noted, we do not<\/em> extract away the content of the logical connectives<\/em>. It is an important question as to why we do not abstract away from the logical connectives. The basic thought is that their meaning constitutes an important part of the logical form of an argument, and thereby in determining its (in)validity.\r\n\r\nTo talk about logical forms, we shall use the lowercase Greek letters such as $latex \\alpha, \\beta, \\gamma,$ and $latex \\delta$. For example, we can represent the logical form that (1)-(3) and (7)-(9) share as follows:\r\n
                            \r\n \t
                          1. $latex \\alpha \\rightarrow \\neg \\beta$<\/li>\r\n \t
                          2. $latex \\beta$<\/li>\r\n \t
                          3. $latex \/ \\therefore \\neg \\alpha$<\/li>\r\n<\/ol>\r\nAn analogy may help here: In mathematics, we think about particular<\/em> arithmetical propositions such as \u201c$latex 1 + 2 = 2 + 1$\u201d and \u201c$latex 0 + 2 = 2 + 0$.\u201d But when we want to generalize<\/em>, we use formulas that contain variables<\/em>, and not specific<\/em> numbers. For example, \u201c$latex x + y = y + x$\u201d expresses something general about the behaviour of the natural numbers. Whatever natural numbers x<\/em> and y<\/em> stand for, \u201c$latex x + y = y + x$\u201d remains true. The same goes with the variables $latex \\alpha, \\beta, \\gamma,$ and $latex \\delta$, which enable us to talk in a general way about the premises and conclusion of arguments. Whatever meaning $latex \\alpha$ and $latex \\beta$ are given, that is, whatever propositions they express, (i)-(iii) remains valid, and so do all of its instances, such as (1)-(3) and (7)-(9).\r\n\r\nAs mentioned above, extracting a certain logical form allows us to talk, in a general way, about premises and conclusions of arguments. It does not matter what specific objects and properties\u2014what specific subject matter\u2014they talk about. And this leads us, again, to our initial concern about the real subject matter of logic:\r\n
                            \r\n

                            Form can thus be studied independently of subject-matter, and it is mainly in virtue of their form, as it turns out, rather than their subject-matter that arguments are valid or invalid. Hence it is the forms of argument, rather than actual arguments themselves, that logic investigates. (Lemmon 1971, 4)<\/p>\r\n<\/blockquote>\r\nAccording to this conception of logic, logicians are in a position to evaluate the validity of an argument, even if they do not strictly understand the content of the claims within the argument, nor under what conditions they would be true. Whether or not the claims within arguments are true, therefore, is not a matter for logic. Instead, what logic does is to explore the logical forms<\/em> of arguments, and thereby establish their (in)validity.\r\n

                            The Nature of Logical Forms<\/h2>\r\nIn this and the next section, we will look into more philosophical matters. In this section, we shall discuss our second question: what is the nature of a logical form? The question about the nature of logical form is reminiscent of the ancient question about the nature of universals. All red roses have something in common; they all share or instantiate something. But what is that thing, if it is a thing at all? Is the property of being red<\/em> akin to a Platonic universal that exists independently of the red roses that instantiate it? Or is it like an Aristotelian universal whose existence depends on the existence of the particular roses? Perhaps, it does not have any existence at all; it is nothing more than a name or a label that we use to talk about red roses. We can ask exactly the parallel questions about logical forms: What is it that all valid arguments of the same form share or instantiate? Is it an entity in the world, or a symbol in language, or a mental construction formed and created by us?\r\n\r\nAssuming that logical forms exist, what are they? There are, generally speaking, two lines of thought here. According to the first, logical forms are schemata<\/em>, and hence, are linguistic entities. According to the second, logical forms are properties<\/em>: they are extra-linguistic entities, akin to universals. They are what schemata express or represent. (An analogy may help here: The expression \u201cis happy\u201d is a predicate; it is a linguistic item. But it expresses an extra-linguistic entity, such as the property of being happy<\/em>.)\r\n\r\nIdentifying logical forms with schemata appears to be quite intuitive. But it leads to a fallacy. As Timothy Smiley points out, the fallacy lies in \u201ctreating the medium as the message\u201d (Smiley 1982, 3). Consider the logical form of (1)-(3):\r\n
                              \r\n \t
                            1. $latex \\alpha \\rightarrow \\neg \\beta$<\/li>\r\n \t
                            2. $latex \\beta$<\/li>\r\n \t
                            3. $latex \/ \\therefore \\neg \\alpha$<\/li>\r\n<\/ol>\r\nYou may like, with equal right, to identify the logical form of (1)-(3) with:\r\n
                                \r\n \t
                              1. $latex \\gamma \\rightarrow \\neg \\eta$<\/li>\r\n \t
                              2. $latex \\eta$<\/li>\r\n \t
                              3. $latex \/ \\therefore \\neg \\gamma$<\/li>\r\n<\/ol>\r\nAnd yet another logician may prefer to capture its logical form with a distinct set of variables:\r\n
                                  \r\n \t
                                1. $latex \\chi \\rightarrow \\neg \\delta$<\/li>\r\n \t
                                2. $latex \\delta$<\/li>\r\n \t
                                3. $latex \/ \\therefore \\neg \\chi$<\/li>\r\n<\/ol>\r\nWhich of these are the<\/em> logical form of (1)-(3)? There are many different ways to capture its logical form. Which one of them has the right to be qualified as the<\/em> logical form of (1)-(3)? This question is pressing if logical forms are taken to be schemata, and hence to be linguistic entities. If a logical form is just a string of symbols, then it varies by using a distinct set of variables. There will be no non-arbitrary way to choose one as opposed to any other as the<\/em> logical form of a given argument. In other words, there will be nothing to choose between these linguistically distinct entities and, hence, none of them could be identified with the<\/em> logical form of the original argument.\r\n\r\nThis may encourage us to identify logical forms as language-independent or language-invariant entities. On this view, logical forms are identified not with schemata, but with what schemata express or represent. They are worldly, rather than linguistic, entities. This view does not succumb to the above problem. Since, on this view, logical forms are worldly entities, none of the above candidates\u2013i.e. (i)-(iii), (iv)-(vi), and (vii)-(ix)\u2013is the logical form of (1)-(3). Rather, each of them expresses<\/em> or represents<\/em> its logical form.\r\n

                                  One Logical Form or Many?<\/h2>\r\nIt seems then that we will be in a better position if we assume that logical forms are worldly entities. But this does not leave us completely home and dry, either. So far, we have assumed that logical forms are unique<\/em> entities. That is, we assumed that arguments such as (1)-(3) and (7)-(9) have one and the same<\/em> logical form. But is that the case?\r\n\r\nIn general, objects can take many<\/em> forms. For example, a particular sonnet can be both Petrarchan and Miltonic, and a vase can be both a cuboid and a cube.[footnote]See Oliver (2010, 172), where he disagrees with Strawson (195, 54).[\/footnote]\u00a0 Also, it seems that a single sentence can take many (at least, more than one) forms. Consider $latex \\neg(\\textit{P} \\rightarrow \\neg \\textit{Q})$. What is its logical form? It seems that each of the following options works perfectly well as an answer to our question: it is a negation; it is a negation of a conditional; and it is a negation of a conditional whose consequent is a negation.[footnote]This way of putting the point is due to Smith (2012, 81).[\/footnote]\r\n\r\nNow, suppose that each of these logical forms is a logical form of a given argument. In virtue of what is each of them a logical form of one and the same argument? That is, what explains the fact that different logical forms are forms of one and the same argument? What unifies them in this respect? One answer is to say that all of these forms have a common logical form. But then you can ask the same question about this common logical form, since this very form has further different forms. In virtue of what are these logical forms forms of one and the same form? And this process can go endlessly. You have a logical form which itself has other logical forms, and so on. But this is not compatible with the thesis that logical forms are unique entities.[footnote]This is reminiscent of the Aristotelian Third Man argument against Plato\u2019s theory of Forms.[\/footnote]\r\n
                                  \r\n

                                  Question for Reflection<\/strong><\/p>\r\n\r\n<\/header>\r\n

                                  It seems that we cannot always talk of the<\/em> logical form that an argument or various arguments share. If this view is correct, then what are its philosophical implications? Can we still understand the notion of validity in terms of the notion of logical form?<\/div>\r\n<\/div>\r\n

                                  Summary<\/h2>\r\nThis chapter started with a question about the subject matter of formal logic: what is it that formal logic studies? We discussed the thesis that formal logic studies logical consequence through the form<\/em> of arguments. We then explicated the notion of validity in terms of truth-tables, which specify the conditions under which a proposition is true or false\u2013for example, a conditional proposition is false only when its antecedent is true and its consequence false; otherwise, it is true. Thus, as we discussed above, truth-tables can be employed to determine whether arguments formulated in the language of propositional logic are valid.\r\n\r\nWe then dug further into what it means for arguments to have a logical form, and how their logical form impacts their (in)validity. The chief idea is that every argument which shares its logical form with a valid argument is also valid, and consequently, every argument which shares its logical form with an invalid argument is also invalid. We saw how this understanding of the notion of validity enables us to identify formal fallacies, such as the fallacy of affirming the consequent. We ended this chapter by asking three philosophical questions about the nature, existence, and uniqueness of logical forms.\r\n
                                  \r\n

                                  EXERCISES<\/strong><\/span><\/h2>\r\n<\/header>\r\n
                                  \r\n

                                  Exercise One<\/strong><\/h3>\r\n

                                  Using a truth-table, show that the following argument, which is known as the fallacy of affirming the consequent<\/em>, is invalid:\u00a0 $latex A \\rightarrow B,\u00a0 B; \/ \\therefore A$.<\/p>\r\n\r\n

                                  Exercise Two<\/strong><\/h3>\r\n

                                  Using a truth-table, how that the following argument, which is known as the hypothetical syllogism<\/em>, is valid: $latex A \\rightarrow B}, B \\rightarrow C; \/ \\therefore A \\rightarrow C$.\u00a0 [Hint: Your truth-table should have eight rows, as there are three propositional variables (A, B and C) that you need to include within it.]<\/em><\/p>\r\n\r\n

                                  Exercise Three<\/strong><\/h3>\r\n

                                  Use the truth-tables already given to you for the conditional $latex (\\rightarrow)$ and negation $latex (\\neg)$, and the two new truth-tables for conjunction $latex (\\wedge)$ and disjunction $latex (\\vee)$ below, which are used to logically express common uses of the vernacular \u2018and\u2019 and \u2018or\u2019, respectively:<\/p>\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n
                                  Truth table for conjunction<\/caption>\r\n
                                  $latex A$<\/th>\r\n$latex B$<\/th>\r\n$latex A \\wedge B$<\/th>\r\n<\/tr>\r\n
                                  T<\/td>\r\nT<\/td>\r\nT<\/td>\r\n<\/tr>\r\n
                                  T<\/td>\r\nF<\/td>\r\nF<\/td>\r\n<\/tr>\r\n
                                  F<\/td>\r\nT<\/td>\r\nF<\/td>\r\n<\/tr>\r\n
                                  F<\/td>\r\nF<\/td>\r\nF<\/td>\r\n<\/tr>\r\n<\/tbody>\r\n<\/table>\r\n\r\n\r\n\r\n\r\n\r\n\r\n
                                  Truth table for disjunction<\/caption>\r\n
                                  $latex A$<\/th>\r\n$latex B$<\/strong><\/th>\r\n$latex A \\vee B$<\/th>\r\n<\/tr>\r\n
                                  T<\/td>\r\nT<\/td>\r\nT<\/td>\r\n<\/tr>\r\n
                                  T<\/td>\r\nF<\/td>\r\nT<\/td>\r\n<\/tr>\r\n
                                  F<\/td>\r\nT<\/td>\r\nT<\/td>\r\n<\/tr>\r\n
                                  F<\/td>\r\nF<\/td>\r\nF<\/td>\r\n<\/tr>\r\n<\/tbody>\r\n<\/table>\r\n

                                  Evaluate whether the following arguments are valid or invalid. Firstly, identify their logical form, and then use truth-tables to establish their (in)validity.<\/p>\r\n\r\n

                                    \r\n \t
                                  1. We now know the situation. The Yankees either have to beat the Red Sox or they won\u2019t make it to the World Series, and they won\u2019t do the former.<\/li>\r\n<\/ol>\r\n
                                      \r\n \t
                                    1. Sarah will only pass the discrete mathematics exam if she knows her set theory. Fortunately, she does know set theory well, so she will pass the exam.<\/li>\r\n<\/ol>\r\n
                                        \r\n \t
                                      1. It just isn\u2019t the case that you can be a liberal and a Republican, so either you\u2019re not a Republican or you\u2019re not a liberal.<\/li>\r\n<\/ol>\r\n
                                          \r\n \t
                                        1. If Dylan goes to law or medical school then he\u2019ll be OK financially. Fortunately, he\u2019s going to law school.<\/li>\r\n<\/ol>\r\n<\/div>\r\n<\/div>","rendered":"

                                          This chapter discusses some philosophical issues concerning the nature of formal logic. Particular attention will be given to the concept of logical form, the goal of formal logic in capturing logical form, and the explanation of validity in terms of logical form. We shall see how this understanding of the notion of validity allows us to identify what we call formal fallacies, which are mistakes in an argument due to its logical form. We shall also discuss some philosophical problems about the nature of logical forms. For the sake of simplicity, our focus will be on propositional logic<\/a>. But many of the results to be discussed do not depend on this choice, and are applicable to more advanced logical systems.<\/p>\n

                                          Logic, Validity, and Logical Forms<\/h2>\n

                                          Different sciences have different subject matters: physics tries to discover the properties of matter, history aims to discover what happened in the past, biology studies the development and evolution of living organisms, mathematics is, or at least seems to be, about numbers, sets, geometrical spaces, and the like. But what is it that logic investigates? What, indeed, is logic?<\/p>\n

                                          This is an essentially philosophical question, but its answer requires reflection on the status and behavior of logical rules and inferences. Textbooks typically present logic as the science of the relation of consequence<\/em> that holds between the premises and the conclusion of a valid argument<\/a><\/strong>, where an argument is valid if it is not possible for its premises to be true and the conclusion false. If logic is the science of the relation of consequence that holds between the premises and the conclusion of a valid argument, we can say that logicians will be concerned with whether a conclusion of an argument is or is not a consequence of its premises.<\/p>\n

                                          Let us examine the notion of validity with more care. For example, consider the following argument:<\/p>\n

                                            \n
                                          1. If Alex is a sea bream, then Alex is not a rose.<\/li>\n
                                          2. Alex is a rose.<\/li>\n
                                          3. [latex]\/ \\therefore[\/latex] Alex is not a sea bream.<\/li>\n<\/ol>\n

                                            It can be shown that it is not possible for (1) and (2) to be true yet (3) false. Hence, the whole argument is valid. For convenience, let us represent each sentence of the argument into the standard propositional logic, which aims to analyze the structure and meaning of various propositions. To do this, we must first introduce the language of our logic.<\/p>\n

                                            The alphabet of propositional logic contains letters standing for sentences: A<\/em>, B<\/em>, C<\/em>, and so on. For example, we can translate \u201cAlex is a rose\u201d by just using B<\/em>. Similarly, we can use S<\/em> to translate \u201cI would love to smell it.\u201d The alphabet of propositional logic contains other symbols known as logical connectives<\/strong><\/a>. One is a symbol for \u201cnot\u201d or negation<\/em> [latex](\\neg )[\/latex].\u00a0 When we say that Alex is not<\/em> a rose, we, in effect, say that it is not the case that Alex is a rose. If we translate \u201cAlex is a rose\u201d by B<\/em>, we translate \u201cAlex is not a rose\u201d as \u201c[latex]\\neg B[\/latex].\u201d\u00a0 Another is a symbol [latex](\\rightarrow)[\/latex] for conditional sentences of the form \u201cif \u2026 then \u2026.\u201d For example, we can translate \u201cIf Alex is a rose, then I would love to smell it\u201d as \u201c[latex]B \\rightarrow A[\/latex].\u201d When we say that if Alex is a rose, then I would love to smell it, we say something conditional: on the condition that Alex is a rose, I would love to smell it. In general, a conditional sentence has two components. We call the first component the antecedent<\/em>, the second component the consequent<\/em>, and the whole proposition a conditional<\/a><\/strong>. The language of our logic also includes \u201cand\u201d [latex](\\wedge)[\/latex], otherwise known as conjunction<\/em>, and \u201cor\u201d [latex](\\vee)[\/latex], otherwise known as disjunction<\/em>. But in this chapter, we shall only deal with negation and conditional.<\/p>\n

                                            Thus, if we use A<\/em> for \u201cAlex is a sea bream,\u201d we can represent (1) with [latex]A \\rightarrow \\neg B[\/latex], and represent our above argument (1)-(3) as follows:<\/p>\n

                                              \n
                                            1. [latex]A \\rightarrow \\neg B[\/latex]<\/li>\n
                                            2. [latex]B[\/latex]<\/li>\n
                                            3. [latex]\/ \\therefore \\neg A[\/latex]<\/li>\n<\/ol>\n

                                              But, recall, our aim was to examine why this argument, if at all, is valid. The mere representation of \u201cnot\u201d by \u201c[latex]\\neg[\/latex]\u201d and \u201cif \u2026 then\u201d by \u201c[latex]\\rightarrow[\/latex]\u201d will not be sufficient to verify the validity or invalidity of a given argument: we also need to know what these symbols and the propositions they express mean<\/em>.\u00a0 But how can we specify the meaning<\/em> of \u201c[latex]neg[\/latex] \u201d and \u201c[latex]\\rightarrow[\/latex]\u201d?<\/p>\n

                                              It is plausible to say that if A<\/em> is true, then its negation is false, and vice versa. For example, if \u201cAlex is a rose\u201d is true, then \u201cAlex is not a rose\u201d is false. This gives us the meaning of \u201c[latex]\\neg[\/latex]\u201d. We can represent this information about the meaning of negation in terms of a truth-table<\/em> in the following way (with T symbolising true<\/em>, and F false<\/em>):<\/p>\n

                                               <\/p>\n

                                              \n\n\n\n\n\n
                                              Truth table for negation<\/caption>\n
                                              [latex]A[\/latex]<\/strong><\/th>\n[latex]\\neg A[\/latex]<\/strong><\/th>\n<\/tr>\n
                                              T<\/td>\nF<\/td>\n<\/tr>\n
                                              F<\/td>\nT<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

                                              Here, we can read each row of the truth-table as a way the world could be. That is, in situations or possible worlds where A<\/em> is true (for example, where Alex is indeed a sea bream), [latex]\\neg \\textit{A}[\/latex] is false (it is false that Alex is a sea bream); and vice versa. Thus construed, a truth-table gives us the situations in which a proposition such as A<\/em> is true, and those in which it is false. In addition, it tells us in what situations [latex]\\neg \\textit{A}[\/latex] is true, and in what situations it is false.<\/p>\n

                                              In a similar way, we can specify the meaning of \u201c[latex]\\rightarrow[\/latex]\u201d by specifying the situations in which conditional propositions of the form \u201c[latex]\\textit{A} \\rightarrow \\textit{B}[\/latex]\u201d are true or false. Here is the standard truth-table for \u201c[latex]\\rightarrow[\/latex]\u201d:<\/p>\n

                                               <\/p>\n\n\n\n\n\n\n\n
                                              Truth table for material conditional<\/caption>\n
                                              [latex]A[\/latex]<\/strong><\/th>\n\u00a0[latex]B[\/latex]<\/strong><\/th>\n[latex]A \\rightarrow B[\/latex]<\/strong><\/th>\n<\/tr>\n
                                              T<\/td>\nT<\/td>\nT<\/td>\n<\/tr>\n
                                              T<\/td>\nF<\/td>\nF<\/td>\n<\/tr>\n
                                              F<\/td>\nT<\/td>\nT<\/td>\n<\/tr>\n
                                              F<\/td>\nF<\/td>\nT<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

                                              As can be seen, there is only one row in which [latex]\\textit{A} \\rightarrow \\textit{B}[\/latex] is false; i.e. the second row in which the consequent is false, but the antecedent is true. As the first row tells us, if both A<\/em> and B<\/em> are true, then so is [latex]\\textit{A} \\rightarrow \\textit{B}[\/latex]. Further, the third and fourth rows tell us that if the antecedent is false, then the whole conditional is true, regardless of whether the consequent is true or false. Hence, all conditionals with false antecedents are true.<\/p>\n

                                              But how is it possible for a conditional to be true if its antecedent is false? Here is one suggestion to answer this question: if your assumption is false, then you can legitimately conclude whatever you would like to. For example, if you assume that Amsterdam is the capital of England, you can legitimately conclude anything whatsoever; it does not matter whether it\u2019s true or false. Thus, from the assumption that Amsterdam is the capital of England, you can conclude that Paris is the capital of France. You can also conclude that Paris is the capital of Brazil.<\/p>\n

                                              We can see that one important piece of information that truth-tables convey concerns how the truth or falsity of complex sentences such as [latex]\\textit{A} \\rightarrow \\textit{B}[\/latex] and [latex]\\neg \\textit{A}[\/latex] depends on the truth or falsity of the propositional letters they contain: the truth or falsity of\u00a0[latex]\\textit{A} \\rightarrow \\textit{B}[\/latex] depends solely on the truth or falsity of A<\/em> and of B<\/em>. Similarly, the truth or falsity of [latex]\\neg \\textit{A}[\/latex] depends solely on that of A<\/em>.<\/p>\n

                                              Now we are in a position to verify whether our argument (1)-(3) is valid or not. And, as we shall see in a moment, the validity or invalidity of an argument depends on the meaning of the logical connectives (such as \u201c[latex]\\rightarrow[\/latex]\u201d and \u201c[latex]\\neg[\/latex]\u201d) which is specified by the corresponding truth-tables. In other words, if the truth-tables of these connectives were different to what they actually are, we would have a different collection of valid arguments.<\/p>\n

                                              We defined an argument as valid if it is not possible for its premises to be true and the conclusion false. By designing a truth-table, we can see under what conditions the premises [latex](\\textit{A} \\rightarrow \\neg \\textit{B}, \\textit{B})[\/latex] and the conclusion [latex](\\neg \\textit{A})[\/latex] of our argument (1)-(3) are true or false:<\/p>\n

                                               <\/p>\n

                                              \n\n\n\n\n\n\n\n
                                              Truth table for argument (1)-(3)<\/caption>\n
                                              [latex]A[\/latex]<\/strong><\/th>\n[latex]A[\/latex]<\/strong><\/th>\n[latex]A \\rightarrow \\neg B[\/latex]<\/strong><\/span><\/th>\n[latex]B[\/latex]<\/strong><\/span><\/th>\n[latex]\\neg A[\/latex]<\/strong><\/span><\/th>\n<\/tr>\n
                                              T<\/td>\nT<\/td>\nF<\/span><\/td>\nT<\/span><\/td>\nF<\/span><\/td>\n<\/tr>\n
                                              T<\/td>\nF<\/td>\nF<\/span><\/td>\nF<\/span><\/td>\nT<\/span><\/td>\n<\/tr>\n
                                              F<\/td>\nT<\/td>\nT<\/span><\/td>\nT<\/span><\/td>\nT<\/span><\/td>\n<\/tr>\n
                                              F<\/td>\nF<\/td>\nT<\/span><\/td>\nF<\/span><\/td>\nT<\/span><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

                                              Since in the above truth-table, there is no row in which the premises\u00a0[latex](\\textit{A} \\rightarrow \\neg \\textit{B}, \\textit{B})[\/latex] are true and the conclusion [latex](\\neg A)[\/latex] false, the argument is valid. The only row in which the premises are both true is the third row, and in that row the conclusion is also true. In other words, there is no world or situation in which (1) and (2) are true, but (3) is not. This just means that the argument is valid.<\/p>\n

                                              Now, consider the following argument:<\/p>\n

                                                \n
                                              1. If Alex is a tiger, then Alex is an animal.<\/li>\n
                                              2. Alex is not a tiger.<\/li>\n
                                              3. [latex]\/ \\therefore[\/latex] Alex is not an animal.<\/li>\n<\/ol>\n

                                                There are situations in which the argument works perfectly well. For example, suppose that Alex is not a tiger but is, in fact, a table. In this case, Alex would not be an animal, either. And thus, the sentences (4), (5), and (6) would be true. But this is not always<\/em> the case, for we can imagine a situation in which the premises are true but the conclusion false, such as where Alex is not a tiger but is, in fact, a dog. Thus, by imagining the situation just described, we would have produced a counterexample: in this situation, (6) would be false, and hence it would not be a consequence of (4) and (5). The argument is invalid.<\/p>\n

                                                That the argument is invalid can also be verified by the method of truth-tables. For we can find a situation in which (4) and (5) are both true and yet (6) false. That is, in the truth-table, if we represent (4) as [latex]\\textit{C} \\rightarrow \\textit{D}[\/latex], (5) as [latex]\\neg \\textit{C}[\/latex], and (6) as [latex]\\neg \\textit{D}[\/latex], there will be at least one row in which the premises are true and the conclusion false (which row is that?):<\/p>\n

                                                 <\/p>\n

                                                \n\n\n\n\n\n\n\n\n
                                                Truth table for argument (4)-(6)<\/caption>\n
                                                [latex]C[\/latex]<\/strong><\/th>\n[latex]D[\/latex]<\/strong><\/th>\n[latex]C\\rightarrow D[\/latex]<\/span><\/th>\n[latex]\\neg C[\/latex]<\/strong><\/span><\/th>\n[latex]\\neg D[\/latex]<\/strong><\/span><\/th>\n<\/tr>\n<\/thead>\n
                                                T<\/td>\nT<\/td>\nT<\/span><\/td>\nF<\/span><\/td>\nF<\/span><\/td>\n<\/tr>\n
                                                T<\/td>\nF<\/td>\nF<\/span><\/td>\nF<\/span><\/td>\nT<\/span><\/td>\n<\/tr>\n
                                                F<\/td>\nT<\/td>\nT<\/span><\/td>\nT<\/span><\/td>\nF<\/span><\/td>\n<\/tr>\n
                                                F<\/td>\nF<\/td>\nT<\/span><\/td>\nT<\/span><\/td>\nT<\/span><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

                                                We said that logicians are concerned with validity or invalidity of arguments, and we proposed the method of truth-tables for undertaking this task. But which arguments are valid, and which are not? It is here that the notion of logical form<\/a><\/strong> emerges. Suppose that a logician embarks on the ridiculous task of recording each and every valid argument. In this case, she would surely record that (1)-(3) is valid. Now, suppose she faces the following argument:<\/p>\n

                                                  \n
                                                1. If Alice is reading Hegel, she is not frustrated.<\/li>\n
                                                2. Alice is frustrated.<\/li>\n
                                                3. [latex]\/ \\therefore[\/latex] Alice is not reading Hegel.<\/li>\n<\/ol>\n

                                                  To see whether this argument is valid or not, she can rewrite each sentence of the argument in her logical language: Alice is reading Hegel [latex](\\textit{P})[\/latex]; Alice is frustrated [latex](\\textit{Q})[\/latex]; and, if Alice is reading Hegel, then Alice is not frustrated) [latex](\\textit{P} \\rightarrow \\neg \\textit{Q})[\/latex]. She can then design a suitable truth-table, and check whether there is any row or situation in which the premises are both true and the conclusion false. Since there is no such row (why?), she will correctly announce that the argument is valid.<\/p>\n

                                                  But it is obvious that in order to check the validity of (7)-(9), our logician did not need to go to this effort. It would suffice if she just noted that the two arguments (1)-(3) and (7)-(9), and their respective truth-tables, are to a great extent similar<\/em>; they have the same form<\/em>. In fact, their only difference is that in the first, the letters A<\/em> and B<\/em> have been used, and in the second they have been substituted for P<\/em> and Q<\/em>, respectively. The logical connectives [latex]\\rightarrow[\/latex] and [latex]\\neg[\/latex] have not changed.<\/p>\n

                                                  To see the point, let us translate each argument into the language of propositional logic we introduced above:<\/p>\n

                                                    \n
                                                  1. [latex]\\textit{A} \\rightarrow \\neg \\textit{B}[\/latex]<\/li>\n
                                                  2. [latex]\\textit{B}[\/latex]<\/li>\n
                                                  3. [latex]\/ \\therefore \\neg \\textit{A}[\/latex]<\/li>\n<\/ol>\n
                                                      \n
                                                    1. [latex]\\textit{P} \\rightarrow \\neg \\textit{Q}[\/latex]<\/li>\n
                                                    2. [latex]\\textit{Q}[\/latex]<\/li>\n
                                                    3. [latex]\/ \\therefore \\neg \\textit{P}[\/latex]<\/li>\n<\/ol>\n

                                                      The two arguments have something in common<\/em>. Let us say that what they have in common is their logical form<\/em>. As you can see, the logical connectives of the arguments have not changed. Since the two arguments have the same form, if one is valid, then the other must be valid, too. More generally, all arguments of this same form are valid. The liberating news is that our logician does not need to embark on the exasperating task of checking the validity of each and every argument separately. For if she already knows that a given argument is valid, and if she can also show that another argument has the same form as the first one, then she can be sure that the second argument is valid without having to design its truth-table.<\/p>\n

                                                      We said that an argument is valid if it is not possible for the premises to be true and the conclusion false. Now, we can say that every argument which shares its form with a valid argument is also valid, and consequently, every argument which shares its form with an invalid argument is also invalid.[1]<\/sup><\/a>It is in this sense that the idea of logical form can be used to establish the (in)validity of arguments. For example, suppose that we want to check the validity of the following argument:<\/p>\n

                                                        \n
                                                      1. If Alice is reading Russell, then Alice is thinking of logic.<\/li>\n
                                                      2. Alice is not reading Russell.<\/li>\n
                                                      3. [latex]\/ \\therefore[\/latex] Alice is not thinking of logic.<\/li>\n<\/ol>\n

                                                        As soon as we see that (10)-(12) has the same form as (4)-(6), which we already know to be invalid, we can be assured that the former is also invalid without having to construct its truth-table.<\/p>\n

                                                        Thus, we can see that understanding the notion of validity in terms of logical form allows us to identify various formal fallacies<\/em>. For example, the argument (10)-(12) is an instance of the fallacy of denying the antecedent<\/em>. Thus, every argument which shares its form with (10)-(12) is also invalid.<\/p>\n

                                                        There are three further questions we may ask about logical forms: (i) How can we \u201cextract\u201d the logical form from arguments which they share? That is, how can we show that various arguments are instances of a common logical form? (ii) What is the nature of a logical form? Is a logical form a thing<\/em>, and if so, what sort of thing is it? (iii) Does each argument have only one logical form? In the following three sections, we shall talk about these three questions, respectively.<\/p>\n

                                                        Extracting Logical Forms<\/h2>\n

                                                        Let us, again, consider the arguments (1)-(3) and (7)-(9) which seem to share one and the same logical form. How can we show<\/em> that they have a common logical form? First, we should represent them in logical symbols:<\/p>\n

                                                          \n
                                                        1. [latex]\\textit{A} \\rightarrow \\neg \\textit{B}[\/latex]<\/li>\n
                                                        2. [latex]\\textit{B}[\/latex]<\/li>\n
                                                        3. [latex]\/ \\therefore \\neg \\textit{A}[\/latex]<\/li>\n<\/ol>\n
                                                            \n
                                                          1. [latex]\\textit{P} \\rightarrow \\neg \\textit{Q}[\/latex]<\/li>\n
                                                          2. [latex]\\textit{Q}[\/latex]<\/li>\n
                                                          3. [latex]\/ \\therefore \\neg \\textit{P}[\/latex]<\/li>\n<\/ol>\n

                                                            To see what these two arguments have in common, we must abstract away from (or ignore or leave aside) the specific contents of their particular premises and conclusions, and thereby reveal a general form that is common to these arguments. For example, we must ignore whether Alex is or is not a rose; all that matters is to replace \u201cAlex is a rose\u201d with B<\/em>. In this sense, to obtain or extract the logical form of an argument, we must abstract from the content of the premises and the conclusion by regarding them as mere place-holders in the form that the argument exhibits. As you may have noted, we do not<\/em> extract away the content of the logical connectives<\/em>. It is an important question as to why we do not abstract away from the logical connectives. The basic thought is that their meaning constitutes an important part of the logical form of an argument, and thereby in determining its (in)validity.<\/p>\n

                                                            To talk about logical forms, we shall use the lowercase Greek letters such as [latex]\\alpha, \\beta, \\gamma,[\/latex] and [latex]\\delta[\/latex]. For example, we can represent the logical form that (1)-(3) and (7)-(9) share as follows:<\/p>\n

                                                              \n
                                                            1. [latex]\\alpha \\rightarrow \\neg \\beta[\/latex]<\/li>\n
                                                            2. [latex]\\beta[\/latex]<\/li>\n
                                                            3. [latex]\/ \\therefore \\neg \\alpha[\/latex]<\/li>\n<\/ol>\n

                                                              An analogy may help here: In mathematics, we think about particular<\/em> arithmetical propositions such as \u201c[latex]1 + 2 = 2 + 1[\/latex]\u201d and \u201c[latex]0 + 2 = 2 + 0[\/latex].\u201d But when we want to generalize<\/em>, we use formulas that contain variables<\/em>, and not specific<\/em> numbers. For example, \u201c[latex]x + y = y + x[\/latex]\u201d expresses something general about the behaviour of the natural numbers. Whatever natural numbers x<\/em> and y<\/em> stand for, \u201c[latex]x + y = y + x[\/latex]\u201d remains true. The same goes with the variables [latex]\\alpha, \\beta, \\gamma,[\/latex] and [latex]\\delta[\/latex], which enable us to talk in a general way about the premises and conclusion of arguments. Whatever meaning [latex]\\alpha[\/latex] and [latex]\\beta[\/latex] are given, that is, whatever propositions they express, (i)-(iii) remains valid, and so do all of its instances, such as (1)-(3) and (7)-(9).<\/p>\n

                                                              As mentioned above, extracting a certain logical form allows us to talk, in a general way, about premises and conclusions of arguments. It does not matter what specific objects and properties\u2014what specific subject matter\u2014they talk about. And this leads us, again, to our initial concern about the real subject matter of logic:<\/p>\n

                                                              \n

                                                              Form can thus be studied independently of subject-matter, and it is mainly in virtue of their form, as it turns out, rather than their subject-matter that arguments are valid or invalid. Hence it is the forms of argument, rather than actual arguments themselves, that logic investigates. (Lemmon 1971, 4)<\/p>\n<\/blockquote>\n

                                                              According to this conception of logic, logicians are in a position to evaluate the validity of an argument, even if they do not strictly understand the content of the claims within the argument, nor under what conditions they would be true. Whether or not the claims within arguments are true, therefore, is not a matter for logic. Instead, what logic does is to explore the logical forms<\/em> of arguments, and thereby establish their (in)validity.<\/p>\n

                                                              The Nature of Logical Forms<\/h2>\n

                                                              In this and the next section, we will look into more philosophical matters. In this section, we shall discuss our second question: what is the nature of a logical form? The question about the nature of logical form is reminiscent of the ancient question about the nature of universals. All red roses have something in common; they all share or instantiate something. But what is that thing, if it is a thing at all? Is the property of being red<\/em> akin to a Platonic universal that exists independently of the red roses that instantiate it? Or is it like an Aristotelian universal whose existence depends on the existence of the particular roses? Perhaps, it does not have any existence at all; it is nothing more than a name or a label that we use to talk about red roses. We can ask exactly the parallel questions about logical forms: What is it that all valid arguments of the same form share or instantiate? Is it an entity in the world, or a symbol in language, or a mental construction formed and created by us?<\/p>\n

                                                              Assuming that logical forms exist, what are they? There are, generally speaking, two lines of thought here. According to the first, logical forms are schemata<\/em>, and hence, are linguistic entities. According to the second, logical forms are properties<\/em>: they are extra-linguistic entities, akin to universals. They are what schemata express or represent. (An analogy may help here: The expression \u201cis happy\u201d is a predicate; it is a linguistic item. But it expresses an extra-linguistic entity, such as the property of being happy<\/em>.)<\/p>\n

                                                              Identifying logical forms with schemata appears to be quite intuitive. But it leads to a fallacy. As Timothy Smiley points out, the fallacy lies in \u201ctreating the medium as the message\u201d (Smiley 1982, 3). Consider the logical form of (1)-(3):<\/p>\n

                                                                \n
                                                              1. [latex]\\alpha \\rightarrow \\neg \\beta[\/latex]<\/li>\n
                                                              2. [latex]\\beta[\/latex]<\/li>\n
                                                              3. [latex]\/ \\therefore \\neg \\alpha[\/latex]<\/li>\n<\/ol>\n

                                                                You may like, with equal right, to identify the logical form of (1)-(3) with:<\/p>\n

                                                                  \n
                                                                1. [latex]\\gamma \\rightarrow \\neg \\eta[\/latex]<\/li>\n
                                                                2. [latex]\\eta[\/latex]<\/li>\n
                                                                3. [latex]\/ \\therefore \\neg \\gamma[\/latex]<\/li>\n<\/ol>\n

                                                                  And yet another logician may prefer to capture its logical form with a distinct set of variables:<\/p>\n

                                                                    \n
                                                                  1. [latex]\\chi \\rightarrow \\neg \\delta[\/latex]<\/li>\n
                                                                  2. [latex]\\delta[\/latex]<\/li>\n
                                                                  3. [latex]\/ \\therefore \\neg \\chi[\/latex]<\/li>\n<\/ol>\n

                                                                    Which of these are the<\/em> logical form of (1)-(3)? There are many different ways to capture its logical form. Which one of them has the right to be qualified as the<\/em> logical form of (1)-(3)? This question is pressing if logical forms are taken to be schemata, and hence to be linguistic entities. If a logical form is just a string of symbols, then it varies by using a distinct set of variables. There will be no non-arbitrary way to choose one as opposed to any other as the<\/em> logical form of a given argument. In other words, there will be nothing to choose between these linguistically distinct entities and, hence, none of them could be identified with the<\/em> logical form of the original argument.<\/p>\n

                                                                    This may encourage us to identify logical forms as language-independent or language-invariant entities. On this view, logical forms are identified not with schemata, but with what schemata express or represent. They are worldly, rather than linguistic, entities. This view does not succumb to the above problem. Since, on this view, logical forms are worldly entities, none of the above candidates\u2013i.e. (i)-(iii), (iv)-(vi), and (vii)-(ix)\u2013is the logical form of (1)-(3). Rather, each of them expresses<\/em> or represents<\/em> its logical form.<\/p>\n

                                                                    One Logical Form or Many?<\/h2>\n

                                                                    It seems then that we will be in a better position if we assume that logical forms are worldly entities. But this does not leave us completely home and dry, either. So far, we have assumed that logical forms are unique<\/em> entities. That is, we assumed that arguments such as (1)-(3) and (7)-(9) have one and the same<\/em> logical form. But is that the case?<\/p>\n

                                                                    In general, objects can take many<\/em> forms. For example, a particular sonnet can be both Petrarchan and Miltonic, and a vase can be both a cuboid and a cube.[2]<\/sup><\/a>\u00a0 Also, it seems that a single sentence can take many (at least, more than one) forms. Consider [latex]\\neg(\\textit{P} \\rightarrow \\neg \\textit{Q})[\/latex]. What is its logical form? It seems that each of the following options works perfectly well as an answer to our question: it is a negation; it is a negation of a conditional; and it is a negation of a conditional whose consequent is a negation.[3]<\/sup><\/a><\/p>\n

                                                                    Now, suppose that each of these logical forms is a logical form of a given argument. In virtue of what is each of them a logical form of one and the same argument? That is, what explains the fact that different logical forms are forms of one and the same argument? What unifies them in this respect? One answer is to say that all of these forms have a common logical form. But then you can ask the same question about this common logical form, since this very form has further different forms. In virtue of what are these logical forms forms of one and the same form? And this process can go endlessly. You have a logical form which itself has other logical forms, and so on. But this is not compatible with the thesis that logical forms are unique entities.[4]<\/sup><\/a><\/p>\n

                                                                    \n
                                                                    \n

                                                                    Question for Reflection<\/strong><\/p>\n<\/header>\n

                                                                    It seems that we cannot always talk of the<\/em> logical form that an argument or various arguments share. If this view is correct, then what are its philosophical implications? Can we still understand the notion of validity in terms of the notion of logical form?<\/div>\n<\/div>\n

                                                                    Summary<\/h2>\n

                                                                    This chapter started with a question about the subject matter of formal logic: what is it that formal logic studies? We discussed the thesis that formal logic studies logical consequence through the form<\/em> of arguments. We then explicated the notion of validity in terms of truth-tables, which specify the conditions under which a proposition is true or false\u2013for example, a conditional proposition is false only when its antecedent is true and its consequence false; otherwise, it is true. Thus, as we discussed above, truth-tables can be employed to determine whether arguments formulated in the language of propositional logic are valid.<\/p>\n

                                                                    We then dug further into what it means for arguments to have a logical form, and how their logical form impacts their (in)validity. The chief idea is that every argument which shares its logical form with a valid argument is also valid, and consequently, every argument which shares its logical form with an invalid argument is also invalid. We saw how this understanding of the notion of validity enables us to identify formal fallacies, such as the fallacy of affirming the consequent. We ended this chapter by asking three philosophical questions about the nature, existence, and uniqueness of logical forms.<\/p>\n

                                                                    \n
                                                                    \n

                                                                    EXERCISES<\/strong><\/span><\/h2>\n<\/header>\n
                                                                    \n

                                                                    Exercise One<\/strong><\/h3>\n

                                                                    Using a truth-table, show that the following argument, which is known as the fallacy of affirming the consequent<\/em>, is invalid:\u00a0 [latex]A \\rightarrow B,\u00a0 B; \/ \\therefore A[\/latex].<\/p>\n

                                                                    Exercise Two<\/strong><\/h3>\n

                                                                    Using a truth-table, how that the following argument, which is known as the hypothetical syllogism<\/em>, is valid: [latex]A \\rightarrow B}, B \\rightarrow C; \/ \\therefore A \\rightarrow C[\/latex].\u00a0 [Hint: Your truth-table should have eight rows, as there are three propositional variables (A, B and C) that you need to include within it.]<\/em><\/p>\n

                                                                    Exercise Three<\/strong><\/h3>\n

                                                                    Use the truth-tables already given to you for the conditional [latex](\\rightarrow)[\/latex] and negation [latex](\\neg)[\/latex], and the two new truth-tables for conjunction [latex](\\wedge)[\/latex] and disjunction [latex](\\vee)[\/latex] below, which are used to logically express common uses of the vernacular \u2018and\u2019 and \u2018or\u2019, respectively:<\/p>\n\n\n\n\n\n\n\n
                                                                    Truth table for conjunction<\/caption>\n
                                                                    [latex]A[\/latex]<\/th>\n[latex]B[\/latex]<\/th>\n[latex]A \\wedge B[\/latex]<\/th>\n<\/tr>\n
                                                                    T<\/td>\nT<\/td>\nT<\/td>\n<\/tr>\n
                                                                    T<\/td>\nF<\/td>\nF<\/td>\n<\/tr>\n
                                                                    F<\/td>\nT<\/td>\nF<\/td>\n<\/tr>\n
                                                                    F<\/td>\nF<\/td>\nF<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n\n\n\n\n\n\n\n
                                                                    Truth table for disjunction<\/caption>\n
                                                                    [latex]A[\/latex]<\/th>\n[latex]B[\/latex]<\/strong><\/th>\n[latex]A \\vee B[\/latex]<\/th>\n<\/tr>\n
                                                                    T<\/td>\nT<\/td>\nT<\/td>\n<\/tr>\n
                                                                    T<\/td>\nF<\/td>\nT<\/td>\n<\/tr>\n
                                                                    F<\/td>\nT<\/td>\nT<\/td>\n<\/tr>\n
                                                                    F<\/td>\nF<\/td>\nF<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

                                                                    Evaluate whether the following arguments are valid or invalid. Firstly, identify their logical form, and then use truth-tables to establish their (in)validity.<\/p>\n

                                                                      \n
                                                                    1. We now know the situation. The Yankees either have to beat the Red Sox or they won\u2019t make it to the World Series, and they won\u2019t do the former.<\/li>\n<\/ol>\n
                                                                        \n
                                                                      1. Sarah will only pass the discrete mathematics exam if she knows her set theory. Fortunately, she does know set theory well, so she will pass the exam.<\/li>\n<\/ol>\n
                                                                          \n
                                                                        1. It just isn\u2019t the case that you can be a liberal and a Republican, so either you\u2019re not a Republican or you\u2019re not a liberal.<\/li>\n<\/ol>\n
                                                                            \n
                                                                          1. If Dylan goes to law or medical school then he\u2019ll be OK financially. Fortunately, he\u2019s going to law school.<\/li>\n<\/ol>\n<\/div>\n<\/div>\n
                                                                            1. It is more accurate to say that every argument which shares its form with an invalid argument is also invalid within that logic,<\/em> but not necessarily for every logic. For example, in propositional logic,\r\n
                                                                                \r\n \t
                                                                              1. All men are mortal<\/li>\r\n \t
                                                                              2. Socrates is a man<\/li>\r\n \t
                                                                              3. [latex]\/ \\therefore[\/latex] Socrates is mortal<\/li>\r\n<\/ol>\r\nis of the same logical form as:\r\n
                                                                                  \r\n \t
                                                                                1. All men are immortal<\/li>\r\n \t
                                                                                2. Socrates is a man<\/li>\r\n \t
                                                                                3. [latex]\/ \\therefore[\/latex] Socrates is mortal<\/li>\r\n<\/ol>\r\nBoth of these arguments can be translated as follows:\r\n
                                                                                    \r\n \t
                                                                                  1. P<\/li>\r\n \t
                                                                                  2. Q<\/li>\r\n \t
                                                                                  3. [latex]\/ \\therefore[\/latex] R<\/li>\r\n<\/ol>\r\nBut (4)-(6), as opposed to (1)-(3), is invalid, for if all men are immortal and Socrates is a man, then Socrates is immortal. Thus, in propositional logic, both of these arguments have the same logical form, even though, from the perspective of a more expressive logic, such as first-order logic, which explains the role that quantifiers such as \u201call\u201d and \u201csome\u201d play within arguments, only the first is valid. Thus, every argument which shares its form with a valid argument is valid within that logic, but not necessarily across the board. ↵<\/a><\/li>
                                                                                  4. See Oliver (2010, 172), where he disagrees with Strawson (195, 54). ↵<\/a><\/li>
                                                                                  5. This way of putting the point is due to Smith (2012, 81). ↵<\/a><\/li>
                                                                                  6. This is reminiscent of the Aristotelian Third Man argument against Plato\u2019s theory of Forms. ↵<\/a><\/li><\/ol><\/div>
                                                                                    definition<\/span>