VAGUENESS and INTUITIONISTIC LOGIC Ian Rumfitt
Total Page:16
File Type:pdf, Size:1020Kb

Load more
Recommended publications
-
Vagueness Susanne Bobzien and Rosanna Keefe
Vagueness Susanne Bobzien and Rosanna Keefe I—SUSANNE BOBZIEN COLUMNAR HIGHER-ORDER VAGUENESS, OR VAGUENESS IS HIGHER-ORDER VAGUENESS Most descriptions of higher-order vagueness in terms of traditional modal logic generate so-called higher-order vagueness paradoxes. The one that doesn’t (Williamson’s) is problematic otherwise. Consequently, the present trend is toward more complex, non-standard theories. However, there is no need for this. In this paper I introduce a theory of higher-order vagueness that is paradox-free and can be expressed in the first-order extension of a normal modal system that is complete with respect to single-domain Kripke-frame semantics. This is the system qs4m+bf+fin. It corresponds to the class of transitive, reflexive and final frames. With borderlineness (unclarity, indeterminacy) defined logically as usual, it then follows that something is borderline precisely when it is higher-order borderline, and that a predicate is vague precisely when it is higher-order vague. Like Williamson’s, the theory proposed here has no clear borderline cas- es in Sorites sequences. I argue that objections that there must be clear bor- derline cases ensue from the confusion of two notions of borderlineness— one associated with genuine higher-order vagueness, the other employed to sort objects into categories—and that the higher-order vagueness para- doxes result from superimposing the second notion onto the first. Lastly, I address some further potential objections. This paper proposes that vagueness is higher-order vagueness. At first blush this may seem a very peculiar suggestion. It is my hope that the following pages will dispel the peculiarity and that the advantages of the proposed theory will speak for themselves. -
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. -
• Today: Language, Ambiguity, Vagueness, Fallacies
6060--207207 • Today: language, ambiguity, vagueness, fallacies LookingLooking atat LanguageLanguage • argument: involves the attempt of rational persuasion of one claim based on the evidence of other claims. • ways in which our uses of language can enhance or degrade the quality of arguments: Part I: types and uses of definitions. Part II: how the improper use of language degrades the "weight" of premises. AmbiguityAmbiguity andand VaguenessVagueness • Ambiguity: a word, term, phrase is ambiguous if it has 2 or more well-defined meaning and it is not clear which of these meanings is to be used. • Vagueness: a word, term, phrase is vague if it has more than one possible and not well-defined meaning and it is not clear which of these meanings is to be used. • [newspaper headline] Defendant Attacked by Dead Man with Knife. • Let's have lunch some time. • [from an ENGLISH dept memo] The secretary is available for reproduction services. • [headline] Father of 10 Shot Dead -- Mistaken for Rabbit • [headline] Woman Hurt While Cooking Her Husband's Dinner in a Horrible Manner • advertisement] Jack's Laundry. Leave your clothes here, ladies, and spend the afternoon having a good time. • [1986 headline] Soviet Bloc Heads Gather for Summit. • He fed her dog biscuits. • ambiguous • vague • ambiguous • ambiguous • ambiguous • ambiguous • ambiguous • ambiguous AndAnd now,now, fallaciesfallacies • What are fallacies or what does it mean to reason fallaciously? • Think in terms of the definition of argument … • Fallacies Involving Irrelevance • or, Fallacies of Diversion • or, Sleight-of-Hand Fallacies • We desperately need a nationalized health care program. Those who oppose it think that the private sector will take care of the needs of the poor. -
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). -
Fuzziness-Vagueness-Generality-Ambiguity. Journal of Pragmatics (Elsevier Science B.V
Fuzziness-vagueness-generality-ambiguity. Journal of Pragmatics (Elsevier Science B.V. in New York & Amsterdam), 1998, 29 (1): pp 13-31. Fuzziness---Vagueness---Generality---Ambiguity1 Qiao Zhang Published by Journal of Pragmatics (Elsevier Science B.V. in New York & Amsterdam), 1998, 29(1): pp 13-31. Contact: Dr Grace Zhang Department of Languages and Intercultural Education Curtin University of Technology GPO Box 1987 Perth, Western Australia 6845 Australia Tel: +61 8 9266 3478 Fax: +61 8 9266 4133 Email: [email protected] Abstract In this paper, I attempt to distinguish four linguistic concepts: fuzziness, vagueness, generality and ambiguity. The distinction between the four concepts is a significant matter, both theoretically and practically. Several tests are discussed from the perspectives of semantics, syntax and pragmatics. It is my contention that fuzziness, vagueness, and generality are licensed by Grice's Co-operative Principle, i.e. they are just as important as precision in language. I conclude that generality, vagueness, and fuzziness are under-determined, and ambiguity is over-determined. Fuzziness differs from generality, vagueness, and ambiguity in that it is not simply a result of a one-to- many relationship between a general meaning and its specifications; nor a list of possible related interpretations derived from a vague expression; nor a list of unrelated meanings denoted by an ambiguous expression. Fuzziness is inherent in the sense that it has no clear-cut referential boundary, and is not resolvable with resort to context, as opposed to generality, vagueness, and ambiguity, which may be contextually eliminated. It is also concluded that fuzziness is closely involved with language users' judgments. -
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. -
Quantifying Aristotle's Fallacies
mathematics Article Quantifying Aristotle’s Fallacies Evangelos Athanassopoulos 1,* and Michael Gr. Voskoglou 2 1 Independent Researcher, Giannakopoulou 39, 27300 Gastouni, Greece 2 Department of Applied Mathematics, Graduate Technological Educational Institute of Western Greece, 22334 Patras, Greece; [email protected] or [email protected] * Correspondence: [email protected] Received: 20 July 2020; Accepted: 18 August 2020; Published: 21 August 2020 Abstract: Fallacies are logically false statements which are often considered to be true. In the “Sophistical Refutations”, the last of his six works on Logic, Aristotle identified the first thirteen of today’s many known fallacies and divided them into linguistic and non-linguistic ones. A serious problem with fallacies is that, due to their bivalent texture, they can under certain conditions disorient the nonexpert. It is, therefore, very useful to quantify each fallacy by determining the “gravity” of its consequences. This is the target of the present work, where for historical and practical reasons—the fallacies are too many to deal with all of them—our attention is restricted to Aristotle’s fallacies only. However, the tools (Probability, Statistics and Fuzzy Logic) and the methods that we use for quantifying Aristotle’s fallacies could be also used for quantifying any other fallacy, which gives the required generality to our study. Keywords: logical fallacies; Aristotle’s fallacies; probability; statistical literacy; critical thinking; fuzzy logic (FL) 1. Introduction Fallacies are logically false statements that are often considered to be true. The first fallacies appeared in the literature simultaneously with the generation of Aristotle’s bivalent Logic. In the “Sophistical Refutations” (Sophistici Elenchi), the last chapter of the collection of his six works on logic—which was named by his followers, the Peripatetics, as “Organon” (Instrument)—the great ancient Greek philosopher identified thirteen fallacies and divided them in two categories, the linguistic and non-linguistic fallacies [1]. -
Why Would You Trust B? Eric Jaeger, Catherine Dubois
Why Would You Trust B? Eric Jaeger, Catherine Dubois To cite this version: Eric Jaeger, Catherine Dubois. Why Would You Trust B?. Logic for Programming, Artificial In- telligence, and Reasoning, Nov 2007, Yerevan, Armenia. pp.288-302, 10.1007/978-3-540-75560-9. hal-00363345 HAL Id: hal-00363345 https://hal.archives-ouvertes.fr/hal-00363345 Submitted on 23 Feb 2009 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Why Would You Trust B? Eric´ Jaeger12 and Catherine Dubois3 1 LIP6, Universit´eParis 6, 4 place Jussieu, 75252 Paris Cedex 05, France 2 LTI, Direction centrale de la s´ecurit´edes syst`emes d’information, 51 boulevard de La Tour-Maubourg, 75700 Paris 07 SP, France 3 CEDRIC, Ecole´ nationale sup´erieure d’informatique pour l’industrie et l’entreprise, 18 all´ee Jean Rostand, 91025 Evry Cedex, France Abstract. The use of formal methods provides confidence in the cor- rectness of developments. Yet one may argue about the actual level of confidence obtained when the method itself – or its implementation – is not formally checked. We address this question for the B, a widely used formal method that allows for the derivation of correct programs from specifications. -
The Boundary Stones of Thought, by Ian Rumfitt. Oxford
The Boundary Stones of Thought,by Ian Rumfitt. Oxford: Oxford University Press, 2015. Pp. xiv + 345.⇤ Peter Fritz Final Draft 1 Introduction In his book The Boundary Stones of Thought, Ian Rumfitt considers five argu- ments in favor of intuitionistic logic over classical logic. Two of these arguments are based on reflections concerning the meaning of statements in general, due to Michael Dummett and John McDowell. The remaining three are more spe- cific, concerning statements about the infinite and the infinitesimal, statements involving vague terms, and statements about sets. Rumfitt is sympathetic to the premises of many of these arguments, and takes some of them to be e↵ective challenges to Bivalence, the following princi- ple: (Bivalence) Each statement is either true or false. However, he argues that counterexamples to Bivalence do not immediately lead to counterexamples to (the Law of) Excluded Middle, and so do not immediately refute classical logic; here, Excluded Middle is taken to be the following principle: (Excluded Middle) For each statement A, A A is true. p _¬ q Much of the book is devoted to developing and assessing the most compelling versions of the five arguments Rumfitt considers. Overall, Rumfitt argues that each of these challenges is ine↵ective against classical logic. As a preliminary to his exploration of the five arguments against classical logic, Rumfitt discusses a general problem for advancing a debate between pro- ponents of competing logics. The problem is this: If in arguing for the logic you favor, you appeal to inferences which you accept but your opponent rejects, you will fail to convince them, even if you succeed in justifying your position. -
Vagueness and Quantification
View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Institutional Research Information System University of Turin Vagueness and Quantification (postprint version) Journal of Philosophical Logic first online, 2015 Andrea Iacona This paper deals with the question of what it is for a quantifier expression to be vague. First it draws a distinction between two senses in which quantifier expressions may be said to be vague, and provides an account of the distinc- tion which rests on independently grounded assumptions. Then it suggests that, if some further assumptions are granted, the difference between the two senses considered can be represented at the formal level. Finally, it out- lines some implications of the account provided which bear on three debated issues concerning quantification. 1 Preliminary clarifications Let us start with some terminology. First of all, the term `quantifier expres- sion' will designate expressions such as `all', `some' or `more than half of', which occurs in noun phrases as determiners. For example, in `all philoso- phers', `all' occurs as a determiner of `philosophers', and the same position can be occupied by `some' or `more than half of'. This paper focuses on simple quantified sentences containing quantifier expressions so understood, such as the following: (1) All philosophers are rich (2) Some philosophers are rich (3) More than half of philosophers are rich Although this is a very restricted class of sentences, it is sufficiently repre- sentative to deserve consideration on its own. In the second place, the term `domain' will designate the totality of things over which a quantifier expression is taken to range. -
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 . -
Unconstitutional Vagueness and Restrictiveness in the Contextual Analysis of the Obscenity Standard: a Critical Reading of the Miller Test Genealogy
COMMENT UNCONSTITUTIONAL VAGUENESS AND RESTRICTIVENESS IN THE CONTEXTUAL ANALYSIS OF THE OBSCENITY STANDARD: A CRITICAL READING OF THE MILLER TEST GENEALOGY JavierRomero INTRODUCTION My taste for women was awakened by the blows of a beautiful and voluptuous creature in a fur jacket who looked like an angry queen. From that day on my aunt became the most desirable woman on God's earth.' My omission of quotation marks uncomfortably decontextualizes the words of Leopold von Sacher-Masoch,S 2a German novelist whose work and life inspired the term masochism. Moreover, the omission threatens to color the perception of the subject at hand, which is not physical abuse, incest, or masochism, but the role of contextual analy- sis in relation to constitutional obscenity doctrine. In isolation, the above quotation can be construed by many as offensive and possibly even obscene, especially if perceived as the sexual musings of a child or if previous lines had been included which describe how the young narrator was tied and bound by the aunt and beaten bloody, all to his delight.3 But, placed in the context of the novel or even of this Com- ment, the offensiveness is mitigated. J.D., 2005, University of Pennsylvania Law School; A.M., 1999, Dartmouth College; B.A., 1996, Cornell University. I wish to thank Professors Edwin Baker and Seth Kreimer for their guidance and the Board and staff of the Journalof ConstitutionalLaw for their patience and assis- tance with the revision of this Comment. LEOPOLD VON SACHER-MASOCH, VENUS IN FURS (1870), reprinted in MASOCHISM 175 (Jean McNeil trans., Zone Books 1991).