DOCSLIB.ORG

An Introduction to Formal Methods for Philosophy Students

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
An Introduction to Formal Methods for Philosophy Students An Introduction to Formal Methods for Philosophy Students Thomas Forster February 20, 2021 2 Contents 1 Introduction 13 1.1 What is Logic? . 13 1.1.1 Exercises for the first week: “Sheet 0” . 13 2 Introduction to Logic 17 2.1 Statements, Commands, Questions, Performatives . 18 2.1.1 Truth-functional connectives . 20 2.1.2 Truth Tables . 21 2.2 The Language of Propositional Logic . 23 2.2.1 Truth-tables for compound expressions . 24 2.2.2 Logical equivalence . 26 2.2.3 Non truth functional connectives . 27 2.3 Intension and Extension . 28 2.3.1 If–then . 31 2.3.2 Logical Form and Valid Argument . 33 2.3.3 The Type-Token Distinction . 33 2.3.4 Copies . 35 2.4 Tautology and Validity . 36 2.4.1 Valid Argument . 36 2.4.2 V and W versus ^ and _ .................... 40 2.4.3 Conjunctive and Disjunctive Normal Form . 41 2.5 Further Useful Logical Gadgetry . 46 2.5.1 The Analytic-Synthetic Distinction . 46 2.5.2 Necessary and Sufficient Conditions . 47 2.5.3 The Use-Mention Distinction . 48 2.5.4 Language-metalanguage distinction . 51 2.5.5 Semantic Optimisation and the Principle of Charity . 52 2.5.6 Inferring A-or-B from A . 54 2.5.7 Fault-tolerant pattern-matching . 54 2.5.8 Overinterpretation . 54 2.5.9 Affirming the consequent . 55 3 4 CONTENTS 3 Proof Systems for Propositional Logic 57 3.1 Arguments by LEGO . 57 3.2 The Rules of Natural Deduction . 57 3.2.1 Worries about reductio and hypothetical reasoning . 60 3.2.2 What do the rules mean?? ................... 62 3.2.3 Goals and Assumptions . 63 3.2.4 The Small Print . 64 3.2.5 Some Exercises . 66 3.3 Soundness of the Natural Deduction Rules . 69 3.4 Harmony and Conservativeness . 72 3.4.1 Conservativeness . 72 3.4.2 Harmony . 72 3.4.3 Maximal Formulæ . 74 3.5 Sequent Calculus . 74 3.5.1 Soundness of the Sequent Rules . 78 3.5.2 The rule of cut . 79 3.5.3 Two tips . 81 3.5.4 Exercises . 82 3.6 Hilbert-style Proofs . 83 3.6.1 The Deduction Theorem . 84 3.7 Interpolation . 86 3.8 Completeness of Propositional Logic . 91 3.8.1 Completeness . 91 3.8.2 Completeness using Sequents . 93 3.9 What is a Completeness Theorem? . 93 3.10 Compactness . 95 3.10.1 Why “compactness”? . 96 3.11 Why do we need proof systems for propositional Logic. ?? . 96 3.12 Some advanced exercises for enthusiasts . 97 3.13 Formal Semantics for Propositional Logic . 97 3.14 Eager and Lazy Evaluation . 99 4 Predicate (first-order) Logic 103 4.1 Towards First-Order Logic . 103 4.1.1 The Syntax of First-order Logic . 106 4.1.2 Warning: Scope ambiguities . 108 4.1.3 First-person and third-person . 109 4.2 Some exercises to get you started . 109 4.3 Comparatives and Superlatives . 114 4.4 Russell’s Theory of Descriptions . 114 4.5 First-order and second-order . 115 4.5.1 Higher-order vs Many-Sorted . 115 4.6 Validity . 116 4.7 Natural Deduction Rules for First-Order Logic . 120 4.8 Sequent Rules for First-Order Logic . 121 4.8.1 Repeat a warning . 122 CONTENTS 5 4.8.2 Some more exercises . 122 4.9 Equality and Substitution . 123 4.9.1 Substitution . 124 4.9.2 Leibniz’s law . 125 4.10 Prenex Normal Form . 125 4.11 Soundness again . 126 4.12 Hilbert-style Systems for First-order Logic . 126 4.13 Semantics for First-order Logic . 126 4.13.1 stuff to fit in . 126 4.13.2 Syntactic types for the various pieces of syntax . 127 4.14 Truth and Satisfaction . 128 4.14.1 Definition of “truth-in-a-structure” . 130 4.14.2 An illustration . 133 4.14.3 Completeness . 135 4.15 Interpolation . 138 4.16 Compactness . 138 4.17 Skolemisation . 138 4.18 What is a Proof? . 138 4.19 Relational Algebra . 139 5 Constructive and Classical truth 143 5.1 A Radical Translation Problem . 149 5.2 Classical Reasoning from a Constructive Point of View . 150 5.2.1 Interpretations, specifically the Negative Interpretation . 153 5.3 Prophecy . 159 6 Possible World Semantics 161 6.0.1 Quantifiers . 163 6.1 Language and Metalanguage again . 163 6.1.1 A Possibly Helpful Illustration . 165 6.2 Some Useful Short Cuts . 165 6.2.1 Double negation . 165 6.2.2 If there is only one world then the logic is classical . 166 6.3 Persistence . 167 6.4 Independence Proofs . 170 6.4.1 Some Worked Examples . 170 6.4.2 Exercises . 173 6.5 Modal Logic . 175 7 Curry-Howard 177 7.1 Decorating Formulæ . 178 7.1.1 The rule of !-elimination . 178 7.1.2 Rules for ^ ........................... 178 7.1.3 Rules for _ ........................... 179 7.2 Propagating Decorations . 180 7.2.1 Rules for ^ ........................... 181 6 CONTENTS 7.2.2 Rules for ! ........................... 181 7.2.3 Rules for _ ........................... 183 7.2.4 Remaining Rules . 183 7.3 Exercises . 184 7.4 Combinators and Hilbert Proofs . 187 8 How Not to Use Logic 189 8.1 Many-Valued Logic is an Error . 192 8.1.1 Many states means many truth-values . ? . 192 8.2 Beware of the concept of logically possible .............. 195 9 Other Logics 197 9.1 Relevance Logic . 198 9.2 Resource Logics . 199 10 Some Applications of Logic 201 10.1 Berkeley’s Master Argument for Idealism . 201 10.1.1 Priest on Berkeley . 202 10.2 Fitch’s Knowability Paradox . 205 10.3 Curry-Howard Unifies Two Riddles . 206 10.3.1 What the Tortoise Said to Achilles . 207 10.3.2 Bradley’s regress . 207 10.4 The Paradoxes . 208 11 Appendices 211 11.1 Notes to Chapter one . 211 11.1.1 The Material Conditional . 211 11.1.2 The Definition of Valid Argument . 213 11.1.3 Valuation and Evaluation . 213 11.2 Notes to Chapter 3 . 215 11.2.1 Hypothetical Reasoning: an Illustration . 215 11.2.2 _-elimination and the ex falso ................. 216 11.2.3 Negation in Sequent Calculus . 217 11.2.4 What is the right way to conceptualise sequents? . 217 11.3 Notes to Chapter 4 . 218 11.3.1 Subtleties in the definition of first-order language . 218 11.3.2 Failure of Completeness of Second-order Logic . 219.
Load more

Recommended publications
  • Chapter 2 Introduction to Classical Propositional
    CHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC 1 Motivation and History The origins of the classical propositional logic, classical propositional calculus, as it was, and still often is called, go back to antiquity and are due to Stoic school of philosophy (3rd century B.C.), whose most eminent representative was Chryssipus. But the real development of this calculus began only in the mid-19th century and was initiated by the research done by the English math- ematician G. Boole, who is sometimes regarded as the founder of mathematical logic. The classical propositional calculus was ¯rst formulated as a formal ax- iomatic system by the eminent German logician G. Frege in 1879. The assumption underlying the formalization of classical propositional calculus are the following. Logical sentences We deal only with sentences that can always be evaluated as true or false. Such sentences are called logical sentences or proposi- tions. Hence the name propositional logic. A statement: 2 + 2 = 4 is a proposition as we assume that it is a well known and agreed upon truth. A statement: 2 + 2 = 5 is also a proposition (false. A statement:] I am pretty is modeled, if needed as a logical sentence (proposi- tion). We assume that it is false, or true. A statement: 2 + n = 5 is not a proposition; it might be true for some n, for example n=3, false for other n, for example n= 2, and moreover, we don't know what n is. Sentences of this kind are called propositional functions. We model propositional functions within propositional logic by treating propositional functions as propositions.
    [Show full text]
  • Logical Fallacies Moorpark College Writing Center
    Logical Fallacies Moorpark College Writing Center Ad hominem (Argument to the person): Attacking the person making the argument rather than the argument itself. We would take her position on child abuse more seriously if she weren’t so rude to the press. Ad populum appeal (appeal to the public): Draws on whatever people value such as nationality, religion, family. A vote for Joe Smith is a vote for the flag. Alleged certainty: Presents something as certain that is open to debate. Everyone knows that… Obviously, It is obvious that… Clearly, It is common knowledge that… Certainly, Ambiguity and equivocation: Statements that can be interpreted in more than one way. Q: Is she doing a good job? A: She is performing as expected. Appeal to fear: Uses scare tactics instead of legitimate evidence. Anyone who stages a protest against the government must be a terrorist; therefore, we must outlaw protests. Appeal to ignorance: Tries to make an incorrect argument based on the claim never having been proven false. Because no one has proven that food X does not cause cancer, we can assume that it is safe. Appeal to pity: Attempts to arouse sympathy rather than persuade with substantial evidence. He embezzled a million dollars, but his wife had just died and his child needed surgery. Begging the question/Circular Logic: Proof simply offers another version of the question itself. Wrestling is dangerous because it is unsafe. Card stacking: Ignores evidence from the one side while mounting evidence in favor of the other side. Users of hearty glue say that it works great! (What is missing: How many users? Great compared to what?) I should be allowed to go to the party because I did my math homework, I have a ride there and back, and it’s at my friend Jim’s house.
    [Show full text]
  • UNIT-I Mathematical Logic Statements and Notations
    UNIT-I Mathematical Logic Statements and notations: A proposition or statement is a declarative sentence that is either true or false (but not both). For instance, the following are propositions: “Paris is in France” (true), “London is in Denmark” (false), “2 < 4” (true), “4 = 7 (false)”. However the following are not propositions: “what is your name?” (this is a question), “do your homework” (this is a command), “this sentence is false” (neither true nor false), “x is an even number” (it depends on what x represents), “Socrates” (it is not even a sentence). The truth or falsehood of a proposition is called its truth value. Connectives: Connectives are used for making compound propositions. The main ones are the following (p and q represent given propositions): Name Represented Meaning Negation ¬p “not p” Conjunction p q “p and q” Disjunction p q “p or q (or both)” Exclusive Or p q “either p or q, but not both” Implication p ⊕ q “if p then q” Biconditional p q “p if and only if q” Truth Tables: Logical identity Logical identity is an operation on one logical value, typically the value of a proposition that produces a value of true if its operand is true and a value of false if its operand is false. The truth table for the logical identity operator is as follows: Logical Identity p p T T F F Logical negation Logical negation is an operation on one logical value, typically the value of a proposition that produces a value of true if its operand is false and a value of false if its operand is true.
    [Show full text]
  • Introduction to Logic
    IntroductionI Introduction to Logic Propositional calculus (or logic) is the study of the logical Christopher M. Bourke relationship between objects called propositions and forms the basis of all mathematical reasoning. Definition A proposition is a statement that is either true or false, but not both (we usually denote a proposition by letters; p, q, r, s, . .). Computer Science & Engineering 235 Introduction to Discrete Mathematics [email protected] IntroductionII ExamplesI Example (Propositions) Definition I 2 + 2 = 4 I The derivative of sin x is cos x. The value of a proposition is called its truth value; denoted by T or I 6 has 2 factors 1 if it is true and F or 0 if it is false. Opinions, interrogative and imperative sentences are not Example (Not Propositions) propositions. I C++ is the best language. I When is the pretest? I Do your homework. ExamplesII Logical Connectives Connectives are used to create a compound proposition from two Example (Propositions?) or more other propositions. I Negation (denoted or !) ¬ I 2 + 2 = 5 I And (denoted ) or Logical Conjunction ∧ I Every integer is divisible by 12. I Or (denoted ) or Logical Disjunction ∨ I Microsoft is an excellent company. I Exclusive Or (XOR, denoted ) ⊕ I Implication (denoted ) → I Biconditional; “if and only if” (denoted ) ↔ Negation Logical And A proposition can be negated. This is also a proposition. We usually denote the negation of a proposition p by p. ¬ The logical connective And is true only if both of the propositions are true. It is also referred to as a conjunction. Example (Negated Propositions) Example (Logical Connective: And) I Today is not Monday.
    [Show full text]
  • Chapter 1 Logic and Set Theory
    Chapter 1 Logic and Set Theory To criticize mathematics for its abstraction is to miss the point entirely. Abstraction is what makes mathematics work. If you concentrate too closely on too limited an application of a mathematical idea, you rob the mathematician of his most important tools: analogy, generality, and simplicity. – Ian Stewart Does God play dice? The mathematics of chaos In mathematics, a proof is a demonstration that, assuming certain axioms, some statement is necessarily true. That is, a proof is a logical argument, not an empir- ical one. One must demonstrate that a proposition is true in all cases before it is considered a theorem of mathematics. An unproven proposition for which there is some sort of empirical evidence is known as a conjecture. Mathematical logic is the framework upon which rigorous proofs are built. It is the study of the principles and criteria of valid inference and demonstrations. Logicians have analyzed set theory in great details, formulating a collection of axioms that affords a broad enough and strong enough foundation to mathematical reasoning. The standard form of axiomatic set theory is denoted ZFC and it consists of the Zermelo-Fraenkel (ZF) axioms combined with the axiom of choice (C). Each of the axioms included in this theory expresses a property of sets that is widely accepted by mathematicians. It is unfortunately true that careless use of set theory can lead to contradictions. Avoiding such contradictions was one of the original motivations for the axiomatization of set theory. 1 2 CHAPTER 1. LOGIC AND SET THEORY A rigorous analysis of set theory belongs to the foundations of mathematics and mathematical logic.
    [Show full text]
  • 12 Propositional Logic
    CHAPTER 12 ✦ ✦ ✦ ✦ Propositional Logic In this chapter, we introduce propositional logic, an algebra whose original purpose, dating back to Aristotle, was to model reasoning. In more recent times, this algebra, like many algebras, has proved useful as a design tool. For example, Chapter 13 shows how propositional logic can be used in computer circuit design. A third use of logic is as a data model for programming languages and systems, such as the language Prolog. Many systems for reasoning by computer, including theorem provers, program verifiers, and applications in the field of artificial intelligence, have been implemented in logic-based programming languages. These languages generally use “predicate logic,” a more powerful form of logic that extends the capabilities of propositional logic. We shall meet predicate logic in Chapter 14. ✦ ✦ ✦ ✦ 12.1 What This Chapter Is About Section 12.2 gives an intuitive explanation of what propositional logic is, and why it is useful. The next section, 12,3, introduces an algebra for logical expressions with Boolean-valued operands and with logical operators such as AND, OR, and NOT that Boolean algebra operate on Boolean (true/false) values. This algebra is often called Boolean algebra after George Boole, the logician who first framed logic as an algebra. We then learn the following ideas. ✦ Truth tables are a useful way to represent the meaning of an expression in logic (Section 12.4). ✦ We can convert a truth table to a logical expression for the same logical function (Section 12.5). ✦ The Karnaugh map is a useful tabular technique for simplifying logical expres- sions (Section 12.6).
    [Show full text]
  • The Strategy of Equivocation in Adorno's "Der Essay Als Form"
    $PELJXLW\,QWHUYHQHV7KH6WUDWHJ\RI(TXLYRFDWLRQ LQ$GRUQR V'HU(VVD\DOV)RUP 6DUDK3RXUFLDX MLN, Volume 122, Number 3, April 2007 (German Issue), pp. 623-646 (Article) 3XEOLVKHGE\-RKQV+RSNLQV8QLYHUVLW\3UHVV DOI: 10.1353/mln.2007.0066 For additional information about this article http://muse.jhu.edu/journals/mln/summary/v122/122.3pourciau.html Access provided by Princeton University (10 Jun 2015 14:40 GMT) Ambiguity Intervenes: The Strategy of Equivocation in Adorno’s “Der Essay als Form” ❦ Sarah Pourciau “Beziehung ist alles. Und willst du sie näher bei Namen nennen, so ist ihr Name ‘Zweideutigkeit.’” Thomas Mann, Doktor Faustus1 I Adorno’s study of the essay form, published in 1958 as the opening piece of the volume Noten zur Literatur, has long been considered one of the classic discussions of the genre.2 Yet to the earlier investigations of the essay form on which his text both builds and plays, Adorno appears to add little that could be considered truly new. His characterization of the essayistic endeavor borrows heavily and self-consciously from an established tradition of genre exploration that reaches back—despite 1 Thomas Mann, Doktor Faustus: das Leben des deutschen Tonsetzers Adrian Leverkühn, erzählt von einem Freunde, Gesammelte Werke VI (Frankfurt a. M.: Suhrkamp, 1974) 63. Mann acknowledges the enormous debt his novel owes to Adorno’s philosophy of music in Die Entstehung des Doktor Faustus; Roman eines Romans (Berlin: Suhrkamp, 1949). Pas- sages stricken by Mann from the published version of the Entstehung are even more explicit on this subject. These passages were later published together with his diaries.
    [Show full text]
  • Logical Vs. Natural Language Conjunctions in Czech: a Comparative Study
    ITAT 2016 Proceedings, CEUR Workshop Proceedings Vol. 1649, pp. 68–73 http://ceur-ws.org/Vol-1649, Series ISSN 1613-0073, c 2016 K. Prikrylová,ˇ V. Kubon,ˇ K. Veselovská Logical vs. Natural Language Conjunctions in Czech: A Comparative Study Katrin Prikrylová,ˇ Vladislav Kubon,ˇ and Katerinaˇ Veselovská Charles University in Prague, Faculty of Mathematics and Physics Czech Republic {prikrylova,vk,veselovska}@ufal.mff.cuni.cz Abstract: This paper studies the relationship between con- ceptions and irregularities which do not abide the rules as junctions in a natural language (Czech) and their logical strictly as it is the case in logic. counterparts. It shows that the process of transformation Primarily due to this difference, the transformation of of a natural language expression into its logical representa- natural language sentences into their logical representation tion is not straightforward. The paper concentrates on the constitutes a complex issue. As we are going to show in most frequently used logical conjunctions, and , and it the subsequent sections, there are no simple rules which analyzes the natural language phenomena which∧ influence∨ would allow automation of the process – the majority of their transformation into logical conjunction and disjunc- problematic cases requires an individual approach. tion. The phenomena discussed in the paper are temporal In the following text we are going to restrict our ob- sequence, expressions describing mutual relationship and servations to the two most frequently used conjunctions, the consequences of using plural. namely a (and) and nebo (or). 1 Introduction and motivation 2 Sentences containing the conjunction a (and) The endeavor to express natural language sentences in the form of logical expressions is probably as old as logic it- The initial assumption about complex sentences contain- self.
    [Show full text]
  • Introduction to Deductive Logic
    Introduction to Deductive Logic Part I: Logic & Language There is no royal road to logic, and really valuable ideas can only be had at the price of close attention. Charles Saunders Peirce INTRODUCTION TO DEDUCTIVE LOGIC PART I: LOGIC AND LANGUAGE I. INTRODUCTION What is Logic? . 4 What is an argument? . 5 Three Criteria for Evaluating Arguments . 6 II. ARGUMENT ANALYSIS – PART 1 Preliminary Issues . 9 Statements and Truth Value Premises and Conclusions . 9 Statements vs Sentences 10 Simple vs Compound Statements 12 Recognizing premises and conclusions . 13 Indicator Language. 15 TWO TYPES OF ARGUMENTS Inductive Reasoning/Argument . 18 Deductive Reasoning/Argument . 19 III. ANALYSIS – PART II FORMALIZING ARGUMENT Preliminary Issue: Formal vs. Informal Argument . 24 Simple and Compound Statements . 25 Types of Compound Statements . 26 Formation Rules for Sentential . 26 DEFINING LOGICAL OPERATORS . 29 Negation . 29 Conjunction . 30 Disjunction . 31 Conditional/ Material Implication . 32 Bi-conditional . 33 APPLICATION: TRANSLATING USING LOGICAL OPERATORS . 35 TRUTH TABLE RULES/SUMMARY OF LOGICAL OPERATORS . 38 TRUTH TABLE APPLICATIONS . 39 Application I: Substitute and Calculate Method . 39 Application II: Calculating with Unknown Values . 41 Application III: Full Truth Table Method . 42 A Short Cut Technique for statements. 44 Truth Table Test for Logical Equivalence . 45 Application IV: Using Truth Tables to Facilitate Reasoning . 47 THE NEED FOR PREDICATE . 50 Using Predicate to Represent Categorical Statements . 52 Preliminary Issues– Grammar . 53 Formation Rules for Predicate . 55 Expressing Quantity . 56 APPLICATION: Symbolizing Categorical Statements using Predicate . 56 Negating Standard Form Categorical Statements. 57 Summary Chart for Standard Form Categorical Statements . 59 Extending Predicate . 61 A Universe of Discourse .
    [Show full text]
  • Propositional Calculus
    CSC 438F/2404F Notes Winter, 2014 S. Cook REFERENCES The first two references have especially influenced these notes and are cited from time to time: [Buss] Samuel Buss: Chapter I: An introduction to proof theory, in Handbook of Proof Theory, Samuel Buss Ed., Elsevier, 1998, pp1-78. [B&M] John Bell and Moshe Machover: A Course in Mathematical Logic. North- Holland, 1977. Other logic texts: The first is more elementary and readable. [Enderton] Herbert Enderton: A Mathematical Introduction to Logic. Academic Press, 1972. [Mendelson] E. Mendelson: Introduction to Mathematical Logic. Wadsworth & Brooks/Cole, 1987. Computability text: [Sipser] Michael Sipser: Introduction to the Theory of Computation. PWS, 1997. [DSW] M. Davis, R. Sigal, and E. Weyuker: Computability, Complexity and Lan- guages: Fundamentals of Theoretical Computer Science. Academic Press, 1994. Propositional Calculus Throughout our treatment of formal logic it is important to distinguish between syntax and semantics. Syntax is concerned with the structure of strings of symbols (e.g. formulas and formal proofs), and rules for manipulating them, without regard to their meaning. Semantics is concerned with their meaning. 1 Syntax Formulas are certain strings of symbols as specified below. In this chapter we use formula to mean propositional formula. Later the meaning of formula will be extended to first-order formula. (Propositional) formulas are built from atoms P1;P2;P3;:::, the unary connective :, the binary connectives ^; _; and parentheses (,). (The symbols :; ^ and _ are read \not", \and" and \or", respectively.) We use P; Q; R; ::: to stand for atoms. Formulas are defined recursively as follows: Definition of Propositional Formula 1) Any atom P is a formula.
    [Show full text]
  • Hardware Abstract the Logic Gates References Results Transistors Through the Years Acknowledgements
    The Practical Applications of Logic Gates in Computer Science Courses Presenters: Arash Mahmoudian, Ashley Moser Sponsored by Prof. Heda Samimi ABSTRACT THE LOGIC GATES Logic gates are binary operators used to simulate electronic gates for design of circuits virtually before building them with-real components. These gates are used as an instrumental foundation for digital computers; They help the user control a computer or similar device by controlling the decision making for the hardware. A gate takes in OR GATE AND GATE NOT GATE an input, then it produces an algorithm as to how The OR gate is a logic gate with at least two An AND gate is a consists of at least two A NOT gate, also known as an inverter, has to handle the output. This process prevents the inputs and only one output that performs what inputs and one output that performs what is just a single input with rather simple behavior. user from having to include a microprocessor for is known as logical disjunction, meaning that known as logical conjunction, meaning that A NOT gate performs what is known as logical negation, which means that if its input is true, decision this making. Six of the logic gates used the output of this gate is true when any of its the output of this gate is false if one or more of inputs are true. If all the inputs are false, the an AND gate's inputs are false. Otherwise, if then the output will be false. Likewise, are: the OR gate, AND gate, NOT gate, XOR gate, output of the gate will also be false.
    [Show full text]
  • 35. Logic: Common Fallacies Steve Miller Kennesaw State University, [email protected]
    Kennesaw State University DigitalCommons@Kennesaw State University Sexy Technical Communications Open Educational Resources 3-1-2016 35. Logic: Common Fallacies Steve Miller Kennesaw State University, [email protected] Cherie Miller Kennesaw State University, [email protected] Follow this and additional works at: http://digitalcommons.kennesaw.edu/oertechcomm Part of the Technical and Professional Writing Commons Recommended Citation Miller, Steve and Miller, Cherie, "35. Logic: Common Fallacies" (2016). Sexy Technical Communications. 35. http://digitalcommons.kennesaw.edu/oertechcomm/35 This Article is brought to you for free and open access by the Open Educational Resources at DigitalCommons@Kennesaw State University. It has been accepted for inclusion in Sexy Technical Communications by an authorized administrator of DigitalCommons@Kennesaw State University. For more information, please contact [email protected]. Logic: Common Fallacies Steve and Cherie Miller Sexy Technical Communication Home Logic and Logical Fallacies Taken with kind permission from the book Why Brilliant People Believe Nonsense by J. Steve Miller and Cherie K. Miller Brilliant People Believe Nonsense [because]... They Fall for Common Fallacies The dull mind, once arriving at an inference that flatters the desire, is rarely able to retain the impression that the notion from which the inference started was purely problematic. ― George Eliot, in Silas Marner In the last chapter we discussed passages where bright individuals with PhDs violated common fallacies. Even the brightest among us fall for them. As a result, we should be ever vigilant to keep our critical guard up, looking for fallacious reasoning in lectures, reading, viewing, and especially in our own writing. None of us are immune to falling for fallacies.
    [Show full text]