Taming the impossible
Name
1022566232-MIT.pdf
Description
Full printable version
Size
804.5 KB
Format
Adobe PDF
Checksum (MD5)
2a29c8107cd4154a6ad99d6dd24c885c
Author(s)
Jenny, Matthias (Matthias Christian)
Advisor(s)
Vann McGee.
Date Issued
2017
Publisher
Massachusetts Institute of Technology
Abstract
The semantic paradoxes and other statements about impossibilities have proved to be obstacles to a satisfactory theory of conditionals. In my dissertation, which consists of two parts, I propose a new approach to the impossible that yields an improved theory of conditionals. A prominent response to the semantic paradoxes is glut theory. Glut theorists avoid paradox by giving up material modus ponens. But they argue that they can help themselves to this rule in areas where no paradoxes loom. In chapter 1, I argue that this does not work and that giving up modus ponens in paradoxical domains leaves glut theorists with a weak logic everywhere. One option that's available to glut theorists involves pragmatic innovation. In chapter 2, I explore the consequences of giving glut theorists the pragmatic resources that are already available the proponents of gap theory, the dual of glut theory. The resulting hybrid theory, which makes use of two distinct speech acts of assertion, is glap theory. Surprisingly, the logic of glap theory is a quite strong logic that adds to the logics of glut and gap theory two hybrid forms of modus ponens. Turning to counterfactual conditionals, the second half of my dissertation concerns the vacuity thesis, which says that all counterpossible conditionals are vacuously true. In chapter 3, I argue that the strongest case against the vacuity thesis comes from counterpossibles as they appear in relative computability theory. I show that relative computability theorists crucially invoke counterpossibles when they define the central notions of their theory. I also provide a model theory for a quantified language that can express such counterpossibles. The logical properties of counterfactuals about relative computability deserve closer attention. In chapter 4, I provide an axiomatization of a propositional fragment of the model theory developed in chapter 3 and prove that the axiomatization is complete and that the resulting conditional logic is decidable. This logic display some surprising features. While validating modus ponens, it also contains a restricted form of the import-export law.
Description
Thesis: Ph. D. in Philosophy, Massachusetts Institute of Technology, Department of Linguistics and Philosophy, 2017.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 147-157).
Subjects
Linguistics and Philosophy.
MIT Department
Massachusetts Institute of Technology. Department of Linguistics and Philosophy
Terms of Use
MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission.
Persistent DSpace Link
