Logic for Philosophy

Logic for Philosophy Theodore Sider June 8, 2007 Preface This book is an elementary introduction to the logic that st...

Author: Sider Ted

59 downloads 1192 Views 994KB Size Report

This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
Report copyright / DMCA form

DOWNLOAD PDF

Logic for Philosophy

Theodore Sider June 8, 2007

Preface This book is an elementary introduction to the logic that students of philosophy ought to know. The goal is to familiarize students with i) basic approaches to logic, including proof theory and especially model theory, ii) extensions of standard logic that are important in philosophy, and iii) some elementary philosophy of logic. The goal is to acquaint students with the logic they need to know in order to be philosophers — in order to understand the logically sophisticated articles one encounters in today’s philosophy journals, and in order to avoid being bamboozled by symbol-mongerers. For better or for worse (I think better), the last century-or-so’s developments in logic are part of the shared knowledge base of philosophers, and inform, to varying degrees of directness, work in every area of philosophy. Logic is part of our shared language and inheritance. As a consequence, the standard philosophy curriculum includes a healthy dose of logic. This is a good thing. But the advanced logic that is part of this curriculum is usually a course in “mathematical logic”, which usually means an intensive course in metalogic (for example, a course based on the excellent Boolos and Jeffrey (1989).) I do believe in the value of such a course. But if advanced undergraduate philosophy majors or beginning graduate students are to have one advanced logic course, I think it should not be a course in metalogic. The standard metalogic courses are too mathematically demanding for the average philosophy student, and omit too much material that the average student needs to know. The one standard logic course should rather be a course designed to instill logical literacy. I begin with a sketch of standard propositional and predicate logic. I briefly discuss a few extensions and variations on each (e.g., three-valued logic, definite descriptions). I then discuss modal logic and counterfactual conditionals in detail. I presuppose familiarity with: the meanings of the logical symbols of first-order predicate logic without identity or function symbols, truth tables, translations from English into propositional and predicate logic, and derivations

i

PREFACE

ii

(in some suitable natural deduction system) in propositional and predicate logic. I drew heavily from a number of different sources, which would be good for supplemental reading: • Propositional logic: Mendelson (1987) • Descriptions, multi-valued logic: Gamut (1991a) • Sequents: Lemmon (1965) • Further quantifiers: Glanzberg (2006); Sher (1991, chapter 2); Westerståhl (1989); Boolos and Jeffrey (1989, chapter 18) • Modal logic: Gamut (1991b); Cresswell and Hughes (1996a) • Semantics for intuitionism : Priest (2001) • Counterfactuals: Lewis (1973) • Two-dimensional modal logic: Davies and Humberstone (1980) Another source was Ed Gettier’s 1988 modal logic class at the University of Massachusetts. My notes from that class formed the basis of the first version of this document. Marcello Antosh, Josh Armstrong, Gabe Greenberg, Angela Harris, Alex Morgan, Jeff Russell, Crystal Tychonievich, Jennifer Wang, Brian Weatherson, and Evan Williams: thank you for your helpful comments.

Contents Preface

i

1 Nature of Logic 1.1 Logical consequence, logical correctness, logical truth . 1.2 Form and abstraction . . . . . . . . . . . . . . . . . . . . . . . 1.3 Formal logic . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.4 Correctness and application . . . . . . . . . . . . . . . . . . 1.5 The nature of logical consequence . . . . . . . . . . . . . . 1.6 Extensions, deviations, variations . . . . . . . . . . . . . . . 1.6.1 Extensions . . . . . . . . . . . . . . . . . . . . . . . . . 1.6.2 Deviations . . . . . . . . . . . . . . . . . . . . . . . . . 1.6.3 Variations . . . . . . . . . . . . . . . . . . . . . . . . . 1.7 Metalogic, metalanguages, and formalization . . . . . . . 2 Propositional Logic 2.1 Grammar of PL . . . . . . . . . . . . . . . . . . 2.2 Provability in PL . . . . . . . . . . . . . . . . . . 2.2.1 Examples of axiomatic proofs in PL 2.2.2 The deduction theorem . . . . . . . . 2.3 Semantics of PL . . . . . . . . . . . . . . . . . . 2.4 Soundness and completeness of PL . . . . . 2.5 Natural Deduction in PL . . . . . . . . . . . . 2.5.1 Sequents . . . . . . . . . . . . . . . . . . 2.5.2 Rules . . . . . . . . . . . . . . . . . . . . 2.5.3 Example derivations . . . . . . . . . . 2.5.4 Theoremhood and consequence . .

iii

. . . . . . . . . . .

. . . . . . . . . . .

. . . . . . . . . . .

. . . . . . . . . . .

. . . . . . . . . . .

. . . . . . . . . . .

. . . . . . . . . . .

. . . . . . . . . . .

. . . . . . . . . .

. . . . . . . . . . .

. . . . . . . . . .

. . . . . . . . . . .

. . . . . . . . . .

. . . . . . . . . . .

. . . . . . . . . .

. . . . . . . . . . .

. . . . . . . . . .

1 2 2 6 7 8 10 10 11 11 12

. . . . . . . . . . .

14 14 16 18 22 22 28 31 31 32 34 38

CONTENTS

iv

3 Variations and Deviations from PL 3.1 Alternate connectives . . . . . . . . . . . . . . . . . . . . . . . . . 3.1.1 Symbolizing truth functions in propositional logic 3.1.2 Inadequate connective sets . . . . . . . . . . . . . . . . 3.1.3 Sheffer stroke . . . . . . . . . . . . . . . . . . . . . . . . . 3.2 Polish notation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3.3 Multi-valued logic . . . . . . . . . . . . . . . . . . . . . . . . . . . 3.3.1 Łukasiewicz’s system . . . . . . . . . . . . . . . . . . . . 3.3.2 Kleene’s “strong” tables . . . . . . . . . . . . . . . . . . 3.3.3 Kleene’s “weak” tables (Bochvar’s tables) . . . . . . . 3.3.4 Supervaluationism . . . . . . . . . . . . . . . . . . . . . . 3.4 Intuitionism . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

. . . . . . . . . . .

. . . . . . . . . . .

. . . . . . . . . . .

39 39 39 43 43 44 45 47 48 50 50 54

4 Predicate Logic 4.1 Grammar of predicate logic . . . . 4.2 Set theory . . . . . . . . . . . . . . . . 4.3 Semantics of predicate logic . . . . 4.4 Establishing validity and invalidity

. . . .

. . . .

. . . .

58 58 59 61 66

. . . .

. . . .

. . . .

. . . .

. . . .

. . . .

. . . .

. . . .

. . . .

. . . .

. . . .

. . . .

. . . .

. . . .

. . . .

. . . .

5 Extensions of Predicate Logic 5.1 Identity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5.1.1 Grammar for the identity sign . . . . . . . . . . . . . . . . . 5.1.2 Semantics for the identity sign . . . . . . . . . . . . . . . . 5.1.3 Translations with the identity sign . . . . . . . . . . . . . . 5.2 Function symbols . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5.2.1 Grammar for function symbols . . . . . . . . . . . . . . . . 5.2.2 Semantics for function symbols . . . . . . . . . . . . . . . . 5.2.3 Translations with function symbols: some examples . . 5.3 Definite descriptions . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5.3.1 Grammar for ι . . . . . . . . . . . . . . . . . . . . . . . . . . . 5.3.2 Semantics for ι . . . . . . . . . . . . . . . . . . . . . . . . . . . 5.3.3 Eliminability of function symbols and definite descriptions 5.4 Further quantifiers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5.4.1 Generalized monadic quantifiers . . . . . . . . . . . . . . . 5.4.2 Generalized binary quantifiers . . . . . . . . . . . . . . . . . 5.4.3 Second-order logic . . . . . . . . . . . . . . . . . . . . . . . .

68 68 68 69 69 71 72 73 75 76 77 78 79 83 83 85 87

CONTENTS 6 Propositional Modal Logic 6.1 Grammar of MPL . . . . . . . . . . . . . . . . . . . . 6.2 Translations in MPL . . . . . . . . . . . . . . . . . . 6.3 Axiomatic systems of MPL . . . . . . . . . . . . . . 6.3.1 System K . . . . . . . . . . . . . . . . . . . . . 6.3.2 System D . . . . . . . . . . . . . . . . . . . . . 6.3.3 System T . . . . . . . . . . . . . . . . . . . . . 6.3.4 System B . . . . . . . . . . . . . . . . . . . . . 6.3.5 System S4 . . . . . . . . . . . . . . . . . . . . 6.3.6 System S5 . . . . . . . . . . . . . . . . . . . . 6.4 Semantics for MPL . . . . . . . . . . . . . . . . . . . 6.4.1 Relations . . . . . . . . . . . . . . . . . . . . . 6.4.2 Kripke models for MPL . . . . . . . . . . . 6.4.3 Validity in MPL . . . . . . . . . . . . . . . . 6.4.4 Semantic validity proofs . . . . . . . . . . . 6.4.5 Countermodels in MPL . . . . . . . . . . . 6.5 Soundness in MPL . . . . . . . . . . . . . . . . . . . 6.5.1 Soundness of K . . . . . . . . . . . . . . . . . 6.5.2 Soundness of D . . . . . . . . . . . . . . . . 6.5.3 Soundness of T . . . . . . . . . . . . . . . . . 6.5.4 Soundness of B . . . . . . . . . . . . . . . . . 6.5.5 Soundness of S4 . . . . . . . . . . . . . . . . 6.5.6 Soundness of S5 . . . . . . . . . . . . . . . . 6.6 Completeness of MPL . . . . . . . . . . . . . . . . . 6.6.1 Canonical models . . . . . . . . . . . . . . . 6.6.2 Maximal consistent sets of wffs . . . . . . 6.6.3 Maximal consistent extensions . . . . . . . 6.6.4 Consistent sets of wffs in modal systems 6.6.5 Canonical models . . . . . . . . . . . . . . . 6.6.6 Completeness of systems of MPL . . . .

v

. . . . . . . . . . . . . . . . . . . . . . . . . . . . .

. . . . . . . . . . . . . . . . . . . . . . . . . . . . .

. . . . . . . . . . . . . . . . . . . . . . . . . . . . .

90 91 92 95 96 108 109 110 111 112 113 115 116 118 119 122 138 140 140 141 142 142 142 143 143 144 145 147 149 151

7 Variations on Propositional Modal Logic 7.1 Propositional tense logic . . . . . . . . . . . . . . . . . . . . . . . . 7.1.1 Philosophical introduction . . . . . . . . . . . . . . . . . 7.1.2 Syntax of tense logic . . . . . . . . . . . . . . . . . . . . . 7.1.3 Validity and theoremhood in tense logic . . . . . . . . 7.2 Intuitionist propositional logic . . . . . . . . . . . . . . . . . . . . 7.2.1 Kripke semantics for intuitionist propositional logic

. . . . . .

. . . . . .

153 153 153 155 155 160 160

. . . . . . . . . . . . . . . . . . . . . . . . . . . . .

. . . . . . . . . . . . . . . . . . . . . . . . . . . . .

. . . . . . . . . . . . . . . . . . . . . . . . . . . . .

. . . . . . . . . . . . . . . . . . . . . . . . . . . . .

. . . . . . . . . . . . . . . . . . . . . . . . . . . . .

. . . . . . . . . . . . . . . . . . . . . . . . . . . . .

. . . . . . . . . . . . . . . . . . . . . . . . . . . . .

CONTENTS

vi

7.2.2 7.2.3

Examples . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 162 Soundness and other facts about intuitionist validity . . 166

8 Counterfactuals 8.1 Logical Features of English counterfactuals . . . 8.1.1 Not truth-functional . . . . . . . . . . . . . 8.1.2 Can be contingent . . . . . . . . . . . . . . . 8.1.3 No augmentation . . . . . . . . . . . . . . . 8.1.4 No contraposition . . . . . . . . . . . . . . . 8.1.5 Some validities . . . . . . . . . . . . . . . . . 8.1.6 Context dependence . . . . . . . . . . . . . 8.2 The Lewis/Stalnaker approach . . . . . . . . . . . 8.3 Stalnaker’s system (SC) . . . . . . . . . . . . . . . . . 8.3.1 Syntax of SC . . . . . . . . . . . . . . . . . . 8.3.2 Semantics of SC . . . . . . . . . . . . . . . . 8.4 Validity proofs in SC . . . . . . . . . . . . . . . . . . 8.5 Countermodels in SC . . . . . . . . . . . . . . . . . 8.6 Logical Features of SC . . . . . . . . . . . . . . . . . 8.6.1 Not truth-functional . . . . . . . . . . . . . 8.6.2 Can be contingent . . . . . . . . . . . . . . . 8.6.3 No augmentation . . . . . . . . . . . . . . . 8.6.4 No contraposition . . . . . . . . . . . . . . . 8.6.5 No exportation . . . . . . . . . . . . . . . . . 8.6.6 No importation . . . . . . . . . . . . . . . . 8.6.7 No hypothetical syllogism (transitivity) . 8.6.8 No transposition . . . . . . . . . . . . . . . . 8.6.9 Some validities . . . . . . . . . . . . . . . . . 8.7 Lewis’s criticisms of Stalnaker’s theory . . . . . . 8.8 Lewis’s System . . . . . . . . . . . . . . . . . . . . . . 8.9 The problem of disjunctive antecedents . . . . . 9 Quantified Modal Logic 9.1 Grammar of QML . . . . . . . . . . . . . . . . . . 9.2 Translations in QML . . . . . . . . . . . . . . . . . 9.3 Semantics for QML . . . . . . . . . . . . . . . . . . 9.4 Countermodels and validity proofs in QML . . 9.5 Philosophically interesting formulas of QML . 9.6 Variable domains . . . . . . . . . . . . . . . . . . . .

. . . . . .

. . . . . . . . . . . . . . . . . . . . . . . . . .

. . . . . .

. . . . . . . . . . . . . . . . . . . . . . . . . .

. . . . . .

. . . . . . . . . . . . . . . . . . . . . . . . . .

. . . . . .

. . . . . . . . . . . . . . . . . . . . . . . . . .

. . . . . .

. . . . . . . . . . . . . . . . . . . . . . . . . .

. . . . . .

. . . . . . . . . . . . . . . . . . . . . . . . . .

. . . . . .

. . . . . . . . . . . . . . . . . . . . . . . . . .

. . . . . .

. . . . . . . . . . . . . . . . . . . . . . . . . .

. . . . . .

. . . . . . . . . . . . . . . . . . . . . . . . . .

. . . . . .

. . . . . . . . . . . . . . . . . . . . . . . . . .

170 171 171 171 172 173 173 174 175 176 176 177 180 181 190 190 190 191 191 191 192 193 193 194 194 197 200

. . . . . .

202 202 202 204 206 212 219

CONTENTS

vii

9.6.1 9.6.2 9.6.3

Countermodels to the Barcan and related formulas . . . 220 Expanding, shrinking domains . . . . . . . . . . . . . . . . 222 Properties and nonexistence . . . . . . . . . . . . . . . . . . 224

10 Two-dimensional modal logic 10.1 Actuality . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10.1.1 Kripke models with actual worlds . . . . . . 10.1.2 Semantics for @ . . . . . . . . . . . . . . . . . . 10.1.3 Examples . . . . . . . . . . . . . . . . . . . . . . . 10.2 × . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10.2.1 Two-dimensional semantics for × . . . . . . 10.2.2 Examples . . . . . . . . . . . . . . . . . . . . . . . 10.3 Fixedly . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10.3.1 Examples . . . . . . . . . . . . . . . . . . . . . . . 10.4 A philosophical application: necessity and a priority References

. . . . . . . . . .

. . . . . . . . . .

. . . . . . . . . .

. . . . . . . . . .

. . . . . . . . . .

. . . . . . . . . .

. . . . . . . . . .

. . . . . . . . . .

228 228 229 230 231 232 233 235 236 237 240 246

Chapter 1 Nature of Logic ince you are reading this book, you are probably already familiar with some logic. You probably know how to translate English sentences into symbolic notation — into propositional logic:

S

English Propositional logic If snow is white then grass is green S→G Either snow is white or grass is not green S∨∼G and into predicate logic: English Predicate logic If Jones is happy then someone is happy H j →∃xH x Anyone who is friends with Jones is either ∀x[F x j →(I x ∨ ∀yF xy)] insane or friends with everyone You are also probably familiar with some basic techniques for evaluating arguments written out in symbolic notation. You have probably encountered truth tables, and some form of proof theory (perhaps a “natural deduction” system; perhaps “truth trees”.) You may have even encountered some elementary model theory. In short: you had an introductory course in symbolic logic. What you already have is: literacy in elementary logic. What you will get out of this book is: literacy in the rest of logic that philosophers tend to presuppose, plus a deeper grasp of what logic is all about. So what is logic all about?

1

CHAPTER 1. NATURE OF LOGIC

1.1

2

Logical consequence, logical correctness, logical truth

Logic studies logical consequence. The statement “someone is happy” is a logical consequence of the statement “Ted is happy”. If Ted is happy, then it logically follows that someone is happy. Likewise, the statement “Ted is happy” is a logical consequence of the statements “It’s not the case that John is happy” and “Either John is happy or Ted is happy”; the first statement follows from the latter two statements. If it is true that John is not happy, and also true that either John or Ted is happy, then Ted must be happy. Relatedly, logic studies logical correctness.1 An argument is logically correct when its conclusion is a logical consequence of its premises. Thus, the following argument is logically correct: It’s not the case that John is happy Ted is happy or John is happy Therefore, Ted is happy Relatedly, logic studies logical truth. A logical truth is a sentence that is a logical consequence of any sentence whatsoever — a sentence that is “true purely by virtue of logic”. Examples might include: “it’s not the case that snow is white and also not white”, “All fish are fish”, and “If Ted is happy then someone is happy”.

1.2

Form and abstraction

Logicians focus on the forms of sentences and arguments. Consider the logically correct argument from the last section: Argument A:

It’s not the case that John is happy Ted is happy or John is happy Therefore, Ted is happy

It is customary to say that argument A is logically correct because of its form — because its form is: 1

Logical correctness is sometimes called validity. I’m avoiding this term here because I will use it later on for a different concept: that of a sentence that is “true no matter what”.


3

It’s not the case that φ φ or ψ Therefore ψ Likewise, we say that the conclusion of argument A is a logical consequence of its premises in virtue of the forms of these sentences; and we say that “it’s not the case that snow is white and also not white” is a logical truth because it has the form: it’s not the case that φ and not-φ. We need to think hard about the idea of form. Apparently, we got the alleged form of argument A by replacing some words with Greek letters and leaving other words as they were. We replaced the sentences ‘John is happy’ and ‘Ted is happy’ with φ and ψ, respectively, but left the expressions ‘It’s not the case that’ and ‘or’ as they were, resulting in the schematic form displayed above. Let’s call that form, “Form 1”. What’s so special about Form 1? Couldn’t we make other choices for what to leave and what to replace? For instance, if we replace the predicate ‘is happy’ with the schematic letter α, leaving the rest intact, we get this: Form 2:

It’s not the case that John is α Ted is α or John is α Therefore, Ted is α

And if we replace the ‘or’ with the schematic letter γ and leave the rest intact, then we get this: Form 3:

It’s not the case that John is happy Ted is happy γ John is happy Therefore, Ted is happy

As we saw, if we think of argument A as having form 1, then we can think of it as being logically correct in virtue of its form, since every instance of form 1 is logically correct. Now, if we think of argument A’s form as being form 2, we can continue to think of argument A as being logically correct in virtue of its form, since, like form 1, every instance of form 2 is logically correct. That is: no matter what predicate we change α to, form 2 becomes a logically correct argument. But if we think of argument A’s form as being form 3, then we cannot think of it as being logically correct in virtue of its form, for not every instance of form 3 is a logically correct argument. If we change γ to ‘if and only if’, for example, then we get the following logically incorrect argument:


4

It’s not the case that John is happy Ted is happy if and only if John is happy Therefore, Ted is happy So, what did we mean, when we said that argument A is logically correct in virtue of its form? What is argument A’s form? Is it form 1, form 2, or form 3? There is no such thing as the form of an argument. When we assign an argument a form, what we are doing is focusing on certain words and ignoring others. We leave intact the words we’re focusing on, and we insert schematic letters for the rest. Thus, in assigning argument A form 1, we’re focusing on the words (phrases) ‘it is not the case that’ and ‘or’, and ignoring other words. More generally, in (standard) propositional logic, we focus on the phrases ‘if…then’, ‘if and only if’, ‘and’, ‘or’, and so on, and ignore others. We do this in order to investigate the relations of logical consequence that hold in virtue of these words’ meaning. The fact that argument A is logically correct depends just on the meaning of the phrases ‘it is not the case that’ and ‘or’; it does not depend on the meanings of the sentences ‘John is happy’ and ‘Ted is happy’. We can substitute any sentences we like for ‘φ’ and ‘ψ’ in form 1 and still get a valid argument. In predicate logic, on the other hand, we focus on further words: ‘all’ and ‘some’. Broadening our focus in this way allows us to capture a wider range of correct arguments, logical consequences, and logical truths. For example “If Ted is happy then someone is happy” is a logical truth in virtue of the meaning of ‘someone’, and not merely in virtue of the meanings of the characteristic words of propositional logic. Call the words on which we’re focusing — that is, the words that we leave intact when we construct the forms of sentences and arguments — the logical constants. (We can speak of natural language logical constants — ‘and’, ‘or’, etc. for propositional logic; ‘all’ and ‘some’ in addition for predicate logic — as well as symbolic logical constants: ∧, ∨, etc. for propositional logic; ∀ and ∃ in addition for predicate logic.) What we’ve seen is that the forms we assign depend on what we’re considering to be the logical constants. We call these expressions logical constants because we interpret them in a constant way in logic, in contrast to other terms. For example, ∧ is a logical constant; it always represents the English ‘and’. There are fixed rules governing ∧, in proof systems (the rule that from P ∧Q one can infer P , for example), in the rules for constructing truth tables, and so on. Moreover, these rules are distinctive for ∧: there are different rules for other logical constants, ∨


5

for example. In contrast, the terms in logic that are not logical constants do not have fixed, particular rules governing their meanings. For example, there are no special rules governing what one can do with a P as opposed to a Q in proofs or derivations. That’s because P doesn’t symbolize any sentence in particular; it can stand for any old sentence. There isn’t anything sacred about the choices of logical constants we make in propositional and predicate logic; and therefore, there isn’t anything sacred about the customary forms we assign to sentences. We could treat other words as logical constants. We could, for example, stop taking ‘or’ as a logical constant, and instead take ‘It’s not the case that John is happy’, ‘Ted is happy’, and ‘John is happy’ as logical constants. We would thereby view argument A as having form 3. This would not be a particularly productive choice (since it would not help to explain the correctness of argument A), but it’s not wrong simply by virtue of the concept of form. More interestingly, consider the fact that every argument of the following form is valid: α is a bachelor Therefore, α is unmarried Accordingly, we could treat the predicates ‘is a bachelor’ and ‘is unmarried’ as logical constants, and develop a corresponding logic. We could introduce special symbolic logical constants for these predicates, we could introduce distinctive rules governing these predicates in proofs. (The rule of “bachelorelimination”, for instance, might allow one to infer “α is unmarried” from “α is a bachelor”.) As with the choices of the previous paragraph, this choice of what to treat as a logical constant is also not ruled out by the concept of form. And it would be more productive than the choices of the last paragraph. Still, it would be far less productive than the usual choices of logical constants in predicate and propositional logic. The word ‘bachelor’ doesn’t have as general application as the words commonly treated as logical constants in propositional and predicate logic; the latter are ubiquitous. At least, this remark about “generality” is one idea about what should be considered a “logical constant”, and hence one idea about the scope of what is usually thought of as “logic”. Where to draw the boundaries of logic — and indeed, whether the logic/nonlogic boundary is an important one to draw — is an open philosophical question about logic. At any rate, in this course, one thing we’ll do is study systems that expand the list of logical constants from standard propositional and predicate logic.


1.3

6

Formal logic

Modern logic is “mathematical” or “formal” logic. This means simply that one studies logic using mathematical techniques. More carefully: in order to develop theories of logical consequence, logical correctness, and logical truth, one develops a formal language (see below), one treats the sentences of the formal language as mathematical objects; one uses the tools of mathematics (especially, the tools of very abstract mathematics, such as set theory) to formulate theories about the sentences in the formal language; and one applies mathematical standards of rigor to these theories. Mathematical logic was originally developed to study mathematical reasoning2 , but its techniques are now applied to reasoning of all kinds. Think, for example, of propositional logic (this will be our first topic below). The standard approach to analyzing the logical behavior of ‘and’, ‘or’, and so on, is to develop a certain formal language, the language of propositional logic. The sentences of this language look like this: P (Q→R)∨(Q→∼S) P ↔(P ∧Q) The symbols ∧, ∨, etc., are used to represent the English words ‘and’, ‘or’, and so on (the logical constants for propositional logic), and the sentence letters P, Q, etc., are used to represent declarative English sentences. Why ‘formal’? Because we stipulate, in a mathematically rigorous way, a grammar for the language; that is, we stipulate a mathematically rigorous definition of the idea of a sentence of this language. Moreover, since we are only interested in the logical behavior of the chosen logical constants ‘and’, ‘or’, and so on, we choose special symbols (∧, ∨ . . . ) for these words only; we use P, Q, R, . . . indifferently to represent any English sentence whose internal logical structure we are willing to ignore.3 We go on, then, to study (as always, in a mathematically rigorous way) various concepts that apply to the sentences in formal languages. In propositional 2

Notes Natural languages like English also have a grammar, and the grammar can be studied using mathematical techniques. But the grammar is much more complicated, and is discovered rather than stipulated; and natural languages lack abstractions like the sentence letters. 3


7

logic, for example, one constructs a mathematically rigorous definition of a tautology (“all Trues in the truth table”), and a rigorous definition of a provable formula (e.g., in terms of a system of deduction, using rules of inference, assumptions, and so on). Of course, the real goal is to apply the notions of logical consequence, logical correctness, and logical truth to sentences of English and other natural languages. The formal languages are merely a tool; we need to apply the tool.

1.4

Correctness and application

To apply the tools we develop for formal languages, we need to speak of a formal system as being correct. What does that sort of claim mean? As we saw, logicians use formal languages and formal structures to study logical consequence, logical correctness, and logical truth. And the range of structures that one could in principle study is very wide. For example, I could introduce a new notion of “provability” by saying “in Ted Logic, the following rule may be used when constructing proofs: if you have P on a line, you may infer ∼P . The annotation is ‘T’.” I could then go on to investigate the properties of such a system. Logic can be viewed as a branch of mathematics, and we can mathematically study any system we like, including a system (like Ted logic) in which one can “prove” ∼P from P . Of course, such a system would shed no light on the logical correctness of English arguments. That is, it would be implausible to claim that when we translate an English argument A into symbols, the conclusion of the resulting symbolic argument may be derived in Ted logic from its premises iff the English argument A is logically correct. Thus, the existence of a coherent, specifiable logical system is a completely separate thing from its application. When we say that a logical system is correct, we have in mind some application of that system. Here’s an oversimplified account of one such correctness claim. Suppose we specified some translation scheme from English into the language of propositional logic. In particular, we would want to translate English ‘and’ into the logical ∧ , English ‘or’ into the logical ∨, etc. Then, the claim that standard propositional logic is a correct logic of English ‘and’, ‘or’, etc. is the claim that an English argument is logically correct (i.e., its conclusion is a logical consequence of its premises) in virtue of ‘and’, ‘or’, etc., iff you can derive the translation of its conclusion from the translations of its premises in the standard system of propositional logic.


1.5

8

The nature of logical consequence

The definition of correctness just given employed the notion of logical consequence, as applied to sentences of English. But what is it for a sentence of English to be a logical consequence of other sentences of English? The question here is a philosophical question, as opposed to a mathematical one. Think of it this way. Logicians define various notions concerning sentences of formal languages (e.g., notions of derivability of symbolic formulas; e.g., the notion of a tautology). These notions are good insofar as they correctly model logical consequence, logical truth, and so on; but in what does logical truth consist? This is one of the core questions of philosophical logic. This book is not primarily a book in philosophical logic, so we won’t spend much time on the question. However, I do want to make clear that the question is indeed a question. The question is sometimes obscured by the fact that terms like ‘logical consequence’, ‘logically correct argument’, and ‘logical truth’ are often stipulatively defined in logic books. This can lead to the belief that there are no genuine issues concerning these notions. It is also obscured by the fact that one philosophical theory of these notions — the model-theoretic one — is so dominant that one can forget that it is a nontrivial theory. Stipulative definitions are of course not things whose truth can be questioned; but stipulative definitions of logical notions are good insofar as the stipulated notions accurately model the real notions: logical consequence, logical correctness, and logical truth of natural language arguments. Further, the stipulated definitions generally concern formal languages, whereas the ultimate goal is an understanding of correct reasoning of the sort that we actually do, using natural languages. Let’s focus just on logical consequence. There are various possible views about what logical consequence is; here I will give just a quick survey. Probably the most standard account is the model-theoretic one: φ is a logical consequence of the sentences in set Γ if the formal translation of φ is true in every model in which the formal translations of the members of Γ are true. This account needs to be spelled out in various ways. First, “formal translations” are translations into a formal language; but which formal language? It will be a language that has a logical constant for each English logical expression. But that raises the question of which expressions of English are logical expressions. In addition to ‘and’, ‘or’, ‘all’, and so on, are any of the following logical expressions?


9

necessarily it will be the case that most it is morally wrong that Further, the notion of translation must be defined; further, an appropriate definition of ‘model’ must be chosen. Similar issues of refinement confront a second account, the proof-theoretic account: φ is a logical consequence of the members of Γ iff the translation of φ is provable from the translations of the members of Γ. We must decide what formal language to translate into, and we must decide upon an appropriate definition of provability. A third view is Quine’s: φ is a logical consequence of the members of Γ iff there is no way to (uniformly) substitute new nonlogical expressions for nonlogical expressions in φ and the members of Γ so that the members of Γ become true and φ becomes false. Three other accounts should be mentioned. The first account is a modal one. Say that Γ modally implies φ iff it is not possible for φ to be false while the members of Γ are true. (What does ‘possible’ mean here? There are many kinds of possibility one might have in mind: so-called “metaphysical possibility”, “absolute possibility”, “idealized epistemic possibility”…. Clearly the acceptability of the proposal depends on the legitimacy of these notions. We discuss modality later in the book, beginning in chapter 6.) One might then propose that φ is a logical consequence of the members of Γ iff Γ modally implies φ. (An intermediate proposal: φ is a logical consequence of the members of Γ iff, in virtue of the forms of φ and the members of Γ, Γ modally implies φ. More carefully: φ is a logical consequence of the members of Γ iff Γ modally implies φ, and moreover, whenever Γ0 and φ0 result from Γ and φ by (uniform) substitution of nonlogical expressions, Γ0 modally implies φ0 . This is like Quine’s definition, but with modal implication in place of truth-preservation.) Second, there is a primitivist account, according to which logical consequence is a primitive notion. Third, there is a pluralist account according to which there is no one kind of genuine logical consequence. There are, of course, the various concepts proposed by each account, each of which is trying to capture genuine logical consequence; but in fact there is no further notion of genuine logical consequence at all; there are only the proposed construals.4 4

Notes. Say something about pluralism about consequence as opposed to pluralism about


10

As I say, this is not a book on philosophical logic, and so we will not inquire further into which (if any) of these accounts is correct. We will, rather, focus exclusively on two kinds of formal proposals for modeling logical consequence, logical correctness, and logical truth: model-theoretic and proof-theoretic proposals.

1.6

Extensions, deviations, variations5

“Standard logic” is what is usually studied in introductory logic courses. It includes propositional logic (∧, ∨, ∼, →, ↔), and predicate logic (∀, ∃, variables). In this course we’ll consider various modifications of standard logic:

1.6.1

Extensions

Here we add to standard logic. We add both: • Symbols • things we can prove The reason we add to standard logic is that we want to get a better representation of English arguments. There are more logically correct English arguments than you can show to be logically correct using plain old standard logic. For example, predicate logic is an extension of propositional logic. You can do a lot with propositional logic, but you can’t even show that: Ted is happy Therefore, someone is happy is logically correct using just propositional logic. So we added quantifiers, variables, predicates, etc., to propositional logic (added symbols), and added new rules of derivation to yield more things we could prove. We’ll want to add even more things. For instance, we will add the “=” sign to predicate logic, and we’ll add a sign for “necessarily” when we get to modal logic. truth. E.g., the former is much easier to swallow than the claim that there’s no fact of the matter as to whether ‘Jones is bald or Jones is not bald’ is true. 5 See Gamut (1991a, pp. 156-158).


1.6.2

11

Deviations

Here we change, rather than add. We keep the same symbols, but we change what we are saying about what the symbols mean. Thus, we get different things we can prove. Why do this? Perhaps because we think that standard logicians are wrong about what the right logic for English is. If we want to correctly model logical consequence in English, therefore, we must construct systems that behave differently from standard logic. For example, we’ll talk about multi-valued logic. In standard logic, everything is either true or false. But maybe that’s a mistake; maybe some sentences are neither true nor false. E.g.: The king of the United States is bald Sherlock Holmes weighs more than 178 pounds $100 is a lot of money There will be a sea battle tomorrow Intuitionism is another case. Intuitionists say that, roughly, that something is true if and only if it is provable. This leads them to deny that ∼∼P logically implies P. For it might be provable that there is no proof of ∼P, even if P isn’t provable. Likewise, intuitionists deny that P∨∼P is a logical truth, since it might be that neither P nor ∼P is provable. Accordingly, intuitionists develop a nonstandard version of propositional logic.

1.6.3

Variations

Here we also change standard logic, but we change the notation without changing the content of logic. We study alternate ways of expressing the same thing. For example, in intro logic we show how: ∼(P ∧Q) ∼P ∨∼Q are two different ways of saying the same thing. We will study other ways of saying the same thing as these, including: P |Q ∼∧P Q


12

In the first case, | is a new symbol for “not both”. In the second case (“Polish notation”), the ∼ and the a mean what they mean in standard logic; but instead of going between the P and the Q, the a goes before P and Q. The value of this, as we’ll see, is that we no longer will need parentheses.

1.7

Metalogic, metalanguages, and formalization

In introductory logic, we learned how to use certain logical systems. We learned how to do truth tables, construct derivations, and so on. But logicians do not spend much of their time developing systems only to sit around all day doing derivations in those systems. As soon as a logician develops a new system, he or she will begin to ask questions about that system. For an analogy, imagine people who make up games. They might invent a new version of chess. Now, they might spend some time actually playing the new game. But if they were like logicians, they would soon get bored with this and start asking questions about the game, such as: “is the average length of this new game longer than the average length of a game of chess?”. “Is there any strategy one could pursue which will guarantee a victory?” Logicians might ask, for example, what things can be proved in such and such a system? Can you prove the same things in this system as in system X? Proving things about logical systems is part of “meta-logic”, which is an important part of logic. In metalogic, we turn our focus to the logical languages themselves, and prove results about those languages. Standard textbooks introduce a pair of methods for evaluating symbolic arguments for logical correctness. One is semantic: an argument is semantically correct iff in its complete truth table, there is no case in which the premises are all true while its conclusion is false. Another is proof-theoretic: an argument is proof-theoretically correct iff there exists a derivation of its conclusion from its premise, where a derivation is then appropriately defined. (Think: introduction- and elimination- rules, conditional and indirect proof, and so on.) Now, an interesting meta-logical question is: how do these two methods for evaluating symbolic arguments relate to each other? The question is answered by the following metalogical results, which are proved in standard books on metalogic: Soundness of propositional logic: Any proof-theoretically correct argument is semantically correct


13

Completeness of propositional logic: Any semantically correct argument is proof-theoretically correct These are really interesting claims! They show that the method of truth tables and the method of constructing derivations amount to the same thing, as applied to symbolic arguments of propositional logic. A couple remarks about proving things in metalogic. First: what do we mean by “proving”? We do not mean: constructing a derivation in the logical system we’re investigating. We’re trying to construct a proof about the system. We do this in English, informally. Logicians often distinguish the “object language” from the “metalanguage”. The object language is the language that we’re studying: the language of propositional logic in this case. Sentences of the object language look like this: P ∧Q ∼(P ∨Q)↔R The metalanguage is the language we use to talk about the object language. In this case, the metalanguage is English. Here are some example sentences of the metalanguage: ‘P ∧Q’ is a sentence with three symbols, one of which is a logical constant Every sentence of propositional logic has the same number of left parentheses as right parentheses If an argument’s conclusion can be derived from its premises, then there is no case in its truth table where its premises are all true but its conclusion is false (i.e., soundness) Our proofs in metalogic will take place in the metalanguage, English. Second: to get anywhere in metalogic, we will have to get a lot more careful about certain things than we were in intro logic. Let’s look at soundness, for instance. To be able to prove this, in a mathematically rigorous way, we’ll need to have the terms in it defined very carefully. In particular, we’ll need to say exactly what we mean by ‘sentence of propositional logic’, ‘truth tables’, and ‘derived’. Defining these terms precisely (another thing we’ll do using English, the metalanguage!) is known as formalizing logic. Our first task will be to formalize propositional logic.

Chapter 2 Propositional Logic

W

e begin with the simplest logic commonly studied: propositional logic. Despite its simplicity, it has great power and beauty.

2.1

Grammar of PL

Modern logic has made great strides by treating the language of logic as a mathematical object. To do so, grammar needs to be developed rigorously. (Our study of a new logical system will always begin with grammar.) If all you want to do is understand the language of logic informally, and be able to use it effectively, you don’t really need to get so careful about grammar. For even if you haven’t ever seen the grammar of propositional logic formalized, you can recognize that things like this make sense: P →Q R∧(∼S↔P ) Whereas things like this do not: →P QR∼ (P ∼Q∼(∨ But to make any headway in metalogic, we will need more than an intuitive understanding of what makes sense and what does not; we will need a precise definition that has the consequence that only the strings of symbols in the first group “make sense”. 14

CHAPTER 2. PROPOSITIONAL LOGIC

15

Grammatical formulas (i.e., ones that “make sense”) are called well-formed formulas, or “wffs” for short. We define these by first carefully defining exactly which symbols are allowed to occur in wffs (the “primitive vocabulary”), and second, carefully defining exactly which strings of these symbols counts as a wff: Primitive vocabulary: Sentence letters: P, Q, R . . . , with or without numerical subscripts Connectives: →, ∼ Parentheses: (,) Definition of wff: i) Sentence letters are wffs ii) If φ, ψ are wffs then φ→ψ and ∼φ are wffs iii) Only strings than can be shown to be wffs using i) and ii) are wffs What happened to ∧, ∨, and ↔? We included only → and ∼. Answer: if we have → and ∼, we don’t need the others; we can define them: φ∧ψ =df φ∨ψ =df φ↔ψ =df

∼(φ→∼ψ) ∼φ→ψ (φ→ψ)∧(ψ→φ)

Note that the choice to begin with → and ∼ as our primitive connectives was arbitrary. We could have started with ∼ and ∧, and defined the others as follows: φ∨ψ =df φ→ψ =df φ↔ψ =df

∼(∼φ∧∼ψ) ∼(φ∧∼ψ) (φ→ψ)∧(ψ→φ)

And other alternate choices are possible. We’ll talk about this later. So: → and ∼ are our primitive connectives; the others are defined. Why do we choose only a small number of primitive connectives? Because, as we will see, it makes meta-proofs easier.


2.2

16

Provability in PL

After grammar, a common step in the study of a language is to give some syntactic definition of ‘theorem’. The intuitive notion of a theorem is something one can prove. One method of characterizing theoremhood is called the method of natural deduction. Any system in which one has assumptions for “conditional proof”, assumptions for “indirect derivation”, etc. is a system of natural deduction. That was our method in intro logic. We will investigate a version of this method below. Natural deduction systems are prized because they are easy to use. That is, it is relatively easy to construct derivations. They are called “natural” deduction systems because the techniques used in constructing derivations are supposed to mirror techniques of actual reasoning. But as easy as they are to use, natural deduction systems are not as useful for metalogic. This is because it is hard to prove things about natural deduction systems. For metalogic, many logicians prefer a different method for defining ‘theorem’: the axiomatic method. To apply the axiomatic method, we must choose i) a set of rules, and ii) a set of axioms. An axiom is simply any chosen sentence. The idea is to choose axioms that are obvious logical truths. E.g., “P →P ” would be a good axiom — it’s obviously a logical truth. (As it happens, we won’t choose this particular axiom; we’ll instead choose other axioms from which this one may be proved.) A rule is simply a permission to infer one sort of sentence from other sentences. For example, modus ponens. It can be stated thus: “From φ→ψ and φ you may infer ψ”, and pictured as follows: MP φ→ψ φ ψ After the axioms and rules have been chosen, we may offer the following definitions: A proof is a finite sequence of wffs, in which each member either i) is an axiom, or ii) follows from earlier members via a rule A theorem is the last member of any proof (we write “` φ” for “φ is a theorem”).


17

One wff φ is provable from another set of wffs Γ (“Γ ` φ”), if there is a sequence of wffs, in which the last is φ, and in which each member is either an axiom, a member of Γ, or follows from earlier wffs in the sequence via a rule. Here are the axioms and rules for PL:1 PL (propositional logic) Rules: MP Axioms: Where φ, ψ, and χ are wffs, anything that comes from the following schemas are axioms (A1) φ→(ψ→φ) (A2) (φ→(ψ→χ ))→((φ→ψ)→(φ→χ )) (A3) (∼ψ→∼φ)→((∼ψ→φ)→ψ) The axiom schemas A1-A3 are called schemas because they aren’t in fact axioms; they’re rather “recipes” for constructing axioms. They aren’t axioms themselves because they aren’t wffs. The Greek letters ‘φ’ and ‘ψ’ and ‘χ ’ aren’t in the primitive vocabulary of the grammar of propositional logic, and so no string of symbols containing these Greek letters is a wff. Rather, the idea is that what you get when you fill in φ and ψ andχ in these schemas with wffs, is an axiom. Let me clarify this. Take the first axiom schema, φ→(ψ→φ). This means: “for any wff that you stick in for φ and any wff that you stick in for ψ, the result φ→(ψ→φ) is an axiom.” First point of clarification: you can stick in the same thing for φ as for ψ if you want. Thus, P →(P →P ) is an axiom. Second point: you don’t have to stick in the same thing for φ as for ψ. Thus, P →(Q→P ) is an axiom. Third point: you can stick in complex formulas for φ and ψ if you want. Thus, (P →Q)→(∼(R→S)→(P →Q)) is an axiom. Fourth point: within a single axiom, you must substitute the same thing for each Greek letter wherever it occurs. For example, P →(Q→R) is not an axiom; you can’t let the first φ be P and the second φ be R. Finally, even though you can’t make φ be different things within a single axiom, you can make φ be different things when making new axioms. That is, you can make one set of substitutions for φ and ψ, generate 1

See Mendelson (1987, p. 29).


18

an axiom, then choose a different set of substitutions, and generate a further axiom, and use each of these axioms in the same axiomatic proof. For instance, you could use each of the following instances of A1 within a single axiomatic proof: P →(Q→P ) ∼P →((Q→R)→∼P ) In the first case, I made φ be P and ψ be Q; in the second case I made φ be ∼P and ψ be Q→R. This is fine because I kept φ and ψ constant within each axiom. A theorem is, in essence, a wff that is provable from no assumptions at all. We also introduced the notion of φ’s being provable from some assumptions. Where Γ is any set of wffs, we said that φ is provable from Γ iff there exists some sequence of wffs, each member of which is either i) an axiom, ii) a member of Γ, or iii) follows from earlier lines in the proof via a rule. Such a proof is called a “proof from Γ”. Proofs from Γ are just like plain old proofs, except that in addition to axioms you can write down a member of Γ at any time. Example: To show that {(P →Q)} ` (P →P ), we construct a proof of P →P from {(P →Q)}: 1. P →(Q→P ) 2. (P →(Q→P ))→((P →Q)→(P →P )) 3. (P →Q)→(P →P ) 4. P →Q 5. P →P

(A1) (A2) 1,2 MP member of {(P →Q)} 3, 4 MP

This notion of provability-from is the proof-theoretic way of making sense of logical consequence (which, remember, is the main goal of logic). An argument is a good one, in this sense, if its conclusion is provable from the set of its premises.

2.2.1

Examples of axiomatic proofs in PL

I said that doing derivations in natural deduction systems is easy. I meant: easy relative to doing proofs in axiomatic systems, which is extremely hard. Some, of course, are easy, for instance (P →Q)→(P →P ):


19

1. P →(Q→P ) (A1) 2. P →(Q→P ))→((P →Q)→(P →P )) (A2) 3. (P →Q)→(P →P ) 1,2 MP The next example is a little harder: (R→P )→(R→(Q→P )) 1. [R→(P →(Q→P ))]→[(R→P )→(R→(Q→P ))] 2. P →(Q→P ) 3. [P →(Q→P )]→[R→(P →(Q→P ))] 4. R→(P →(Q→P )) 5. (R→P )→(R→(Q→P ))

A2 A1 A1 2,3 MP 1,4 MP

Here’s how I approached this problem. What I was trying to prove, namely (R→P )→(R→(Q→P )), is a conditional whose antecedent and consequent both begin: (R→. That looks like the consequent of A2. So I wrote out an instance of A2 whose consequent was the formula I was trying to prove; that gave me line 1 of the proof. Then I tried to figure out a way to get the antecedent of line 1; namely, R→(P →(Q→P )). And that turned out to be pretty easy. The consequent of this formula, P →(Q→P ) is an axiom (line 2 of the proof). And if you can get a formula φ, then you choose anything you like — say, R, — and then get R→φ, by using A1 and modus ponens; that’s what I did in lines 3 and 4. In fact, we’ll want to make a move like this in many proofs, whenever we have φ on its own, and we want to move to ψ→φ. Let’s call this move “adding an antecedent”; this is how it is done: 1. φ (from earlier lines) 2. φ→(ψ→φ) A1 3. ψ→φ 1, 2 MP In future proofs, instead of repeating such steps, let’s just move directly from φ to ψ→φ, with the justification “adding an antecedent”. Think of the theorem we just proved, (R→P )→(R→(Q→P )), as “weakening the consequent”: Q→P is weaker than P , so if R implies P , it also implies Q→P . Next I will prove a theorem that intuitively corresponds to “strengthening the antecedent”: [(P →Q)→R]→(Q→R). The intuitive idea is that if P →Q leads to R, then Q ought to lead to R, since Q is stronger than P →Q. This proof will be harder still. I’ll start with a sketch of a new technique, which I’ll call the “MP technique”. Here’s what the technique will let us do. Suppose we can separately prove φ→ψ and φ→(ψ→χ ). The technique then shows us how to construct a proof of


20

φ→χ . I call this the MP technique because its effect is that you can do modus ponens “within the consequent of the conditional φ→”. Here’s how the MP technique works: 1. 2. 3. 4. 5.

φ→ψ φ→(ψ→χ ) (φ→(ψ→χ ))→((φ→ψ)→(φ→χ )) (φ→ψ)→(φ→χ ) φ→χ

from earlier lines from earlier lines A2 2,3 MP 1,4 MP

The MP technique can now be used to prove [(P →Q)→R]→(Q→R), letting φ = (P →Q)→R, ψ = Q→(P →Q) and χ = Q→R. a. [(P →Q)→R]→[Q→(P →Q)] b. [(P →Q)→R]→[(Q→(P →Q))→(Q→R)] c. [(P →Q)→R]→[Q→R]

see below see below a,b MP method

All that remains is to supply separate proofs of lines a and b. Step a is pretty easy. Its consequent, Q→(P →Q) is an instance of A1, so we can prove it in one line, then use “adding an antecedent” to get a. Line b is a bit harder. It has the form: (α→β)→[(γ →α)→(γ →β)]. Call this theorem (*). The following proof of (*) uses the MP technique again! 1. [γ →(α→β)]→[(γ →α)→(γ →β)] A2 2. (α→β)→[γ →(α→β)] A1 3. (α→β)→[γ →(α→β)]→[(γ →α)→(γ →β)] adding an antecedent to line 1. 4. (α→β)→[(γ →α)→(γ →β)] 2, 3, MP method For this use of the MP method, φ = α→β, ψ = γ →(α→β), and χ =(γ →α)→(γ →β). That’s it! ` [(P →Q)→R]→(Q→R) has been established. Notice that once the proofs get longer, it gets impractical to actually write out the entire proof. It’s easier to do proof sketches. If you wanted to write out the entire proof, you’d need to take each of the bits, fill in the details, and assemble the results into one proof. We can use the techniques we’ve developed so far to prove some further theorems. For instance, let’s show that in a nested conditional, one can swap the antecedents: ` [P →(Q→R)]→[Q→(P →R)]:


21

a. [P →(Q→R)]→[(P →Q)→(P →R)] b. [P →(Q→R)]→{[(P →Q)→(P →R)]→[Q→(P →R)]} c. [P →(Q→R)]→[Q→(P →R)]

A2 see below a,b MP technique

(In this case of the MP technique, φ = P →(Q→R), ψ = (P →Q)→(P →R), and χ = [Q→(P →R)].) All that remains is to prove [P →(Q→R)]→{[(P →Q)→(P →R)]→[Q→(P →R)]}. But that’s pretty easy, given the techniques we’ve already amassed; here’s the sketch: 1. [(P →Q)→(P →R)]→[Q→(P →R)] 2. [P →(Q→R)]→{[(P →Q)→(P →R)]→[Q→(P →R)]}

strengthening the antecedent 1, adding an antecedent

QED Next let’s show that ` (P →Q)→[(Q→R)→(P →R)], which says in effect that conditionals are “transitive”. Here’s a sketch: 1. {(Q→R)→[(P →Q)→(P →R)]}→ {[(Q→R)→(P →Q)]→[(Q→R)→(P →R)]} 2. (Q→R)→[(P →Q)→(P →R)] 3. [(Q→R)→(P →Q)]→[(Q→R)→(P →R)] 4. {[(Q→R)→(P →Q)]→[(Q→R)→(P →R)]}→ {(P →Q)→[(Q→R)→(P →R)]} 5. (P →Q)→[(Q→R)→(P →R)]

A2 (*) (proved above) 1, 2 MP strengthening the antecedent 3, 4 MP

QED Given this transitivity theorem, we can always move from φ→ψ and ψ→χ to φ→χ thus: 1. φ→ψ from earlier lines 2. ψ→χ from earlier lines 3. (φ→ψ)→[(ψ→χ )→(φ→χ )] transitivity theorem just proved 4. (ψ→χ )→(φ→χ ) 1, 3 MP 5. φ→χ 2, 4 MP So, such moves may henceforth be justified by appeal to “transitivity”. The following proof of the law of contraposition uses this move:

CHAPTER 2. PROPOSITIONAL LOGIC 1. (∼Q→∼P )→[(∼Q→P )→Q] 2. [(∼Q→P )→Q]→(P →Q) 3. (∼Q→∼P )→(P →Q)

22

A3 strengthening the antecedent 1, 2 transitivity

QED One final proof, of ∼P →(P →Q): 1. ∼P →(∼Q→∼P ) A1 2. (∼Q→∼P )→(P →Q) contraposition 3. ∼P →(P →Q) 1, 2 transitivity

2.2.2

The deduction theorem

Axiomatic proofs are difficult, in large part, because assumptions are not allowed. In a natural deduction system, one may assume the antecedent, φ, reason one’s way to the consequent, ψ, and then conclude the conditional φ→ψ. This form of proof is much easier. While assumptions are not allowed in proofs in our system, in fact the following theorem about our system may be proved: Deduction theorem: If Γ∪{φ}` ψ, then Γ ` (φ→ψ) What the deduction theorem says is that whenever there exists a proof from (Γ and) φ to ψ, then there also exists a proof of φ→ψ (from Γ). That is not to say that one is allowed to assume φ in a proof of φ→ψ. But once one proves the deduction theorem (I won’t do that here), then if one can prove ψ after assuming φ, one is entitled to conclude that a proof of φ→ψ exists.

2.3

Semantics of PL

The notion of provability is one conception of logical consequence. An alternate conception is the following: ψ is a logical consequence of φ1 , . . . , φn , iff there is “no way” for φ1 , . . . , φn to be true while ψ is false. This is called a semantic conception of logical consequence, because it appeals to the notion of truth, which in turn involves the notion of meaning. We need to make the semantic conception of logical consequence more precise. We will in effect employ the method of truth tables, but in a formalized way. Let’s define the notion of a propositional assignment function (PL-assignment):


23

A is a PL-assignment =d f A is a function, or rule, that assigns either 1 or 0 to every sentence letter of PL Think of 0 and 1 as truth values; thus a valuation assigns truth values to sentence letters. Instead of saying “let P be false, and Q be true”, we can say: let A be an assignment such that A(P )=0 and A(Q)=1. Once we settle what truth values a given assignment assigns to the sentence letters, the truth values of complex sentences containing those sentence letters are thereby fixed. The usual, informal, method for showing exactly how those truth values are fixed is by giving truth tables. The standard truth tables for the → and ∼ are the following: φ 1 1 0 0

→ 1 0 0 0

ψ 1 0 1 0

∼ 1 0

φ 0 1

What we will do, instead, is write out a formal definition of a function — the valuation function — that assigns truth values to complex sentences as a function of the truth values of their sentence letters — i.e., as a function of a given PL assignment A. But as you’ll see, the idea is the same as the truth tables: the truth tables are really just pictures of the valuation function: For any PL-assignment, A, the PL-valuation for A, VA , is defined as the function that assigns to each wff either 1 or 0, and which is such that, for any wffs φ and ψ, i) if φ is a sentence letter then VA (φ) = A(φ) ii) VA (φ→ψ) = 1 iff either VA (φ) = 0 or VA (ψ) = 1 iii) VA (∼φ) = 1 iff VA (φ) = 0 Notice an interesting feature of this definition: the very expression we are trying to define, ‘VA ’, appears in the right hand side of clauses ii) and iii) of the definition. Is that “circular”? Not in any objectionable way. This definition is what is called a “recursive” definition, and recursive definitions are legitimate despite this sort of circularity. The reason is that clauses ii) and iii) define


24

the valuation of complex formulas (∼φ and φ→ψ) in terms of the valuations of smaller formulas (φ and ψ). These smaller formulas may themselves be complex, and therefore may have their valuations determined, via clauses ii) and iii), in terms of yet smaller formulas, and so on. But eventually (since every formula has a finite length!) the valuation of a formula will be determined by clause i), not clauses ii) and iii). And clause i) is not circular: in that clause, the valuation of φ is determined by a direct appeal to the assignment function A. Recursive definitions always “bottom out” in this way; they always include a clause (called the “base” clause) like i). A digression: notice that in the definition of a valuation function I use the English logical connectives ‘either…or’, and ‘iff ’; and in many places in the future I’ll be using other English logical words such as ‘not’, ‘all’, etc. I use these English connectives rather than the logical connectives a , ∨, →, ↔, ∼, ∀, and ∃, to draw attention to the fact that I’m not writing down wffs. of the language of study (in this case, the language of propositional logic), but rather writing down sentences of our “metalanguage” — the informal language we use to discuss logical languages. Notice that there’s no “circularity” here. In giving these definitions, our goal is not to define logical concepts such as negation, conjunction, quantification, etc. That is probably impossible. What we are doing is i) starting with the assumption that we already understand the logical concepts, ii) trying to use those notions to provide a formalized semantics for a logical language. This can be put in terms of “object language” — the language under study, in this case the language of propositional logic — and “metalanguage”, the language used to talk about the object language, in this case English. We use metalanguage connectives, such as ‘iff’ and ‘or’, to provide a semantics for the object language connectives ∼, →, etc. Back to the definition. There is no need to give clauses for the other connectives, since they’re not officially in our language — “φ∧ψ”, for example, is really just an abbreviation we use for the sentence ∼(φ→∼ψ). However we could derive that the following facts are indeed true of valuation functions: For any assignment A, and any wffs ψ and χ , VA (ψ∧χ ) = 1 VA (ψ∨χ ) = 1 VA (ψ↔χ ) = 1

iff VA (ψ) = 1 and VA (χ ) = 1 iff either VA (ψ) = 1 or VA (χ ) = 1 iff VA (ψ) = VA (χ )

We can show that all three of these hold. I’ll do the first one here; the others


25

are homework exercises. I’ll write it out in a little more detail than you need to use, to make it clear exactly how the reasoning works: Let ψ and χ be any wffs. The expression ψ∧χ is an abbreviation for the expression ∼(ψ→∼χ ). So we want to show that, for any PLassignment A, VA (∼(ψ→∼χ )) = 1 iff VA (ψ)=1 and VA (χ )=1. Now, in order to show that a statement α holds iff a statement β holds, we must first show that if α holds, then β holds (the “forwards ⇒ direction”); then we must show that if β holds then α holds (the “backwards ⇐direction”): ⇒: First assume that VA (∼(ψ→∼χ ))=1. Then, by definition of the valuation function, clause for ∼, VA (ψ→∼χ )=0. So2 , VA (ψ→∼χ ) is not 1. But then, by the clause in the definition of VA for the →, we know that it’s not the case that: either VA (ψ)=0 or VA (∼χ )=1. That is: VA (ψ)=1 and VA (∼χ )=0. From the latter, by the clause for ∼, we know that VA (χ )=1. That’s what we wanted to show — that VA (ψ)=1 and VA (χ )=1. ⇐: This is sort of like undoing the previous half. Suppose that VA (ψ)=1 and VA (χ )=1. Since VA (χ )=1, by the clause for ∼, VA (∼χ )=0; but now since VA (ψ)=1 and VA (∼χ )=0, by the clause for → we know that VA (ψ→∼χ )=0; then by the clause for ∼, we know that VA (∼(ψ→∼χ ))=1, which is what we were trying to show. It’s important to distinguish the kind of argument I just gave from what were called “proofs” in section 2.2. The proofs of section 2.2 are object-language proofs. The notion of a proof was rigorously defined (“a sequence of wffs, each of which is either …”) and very restrictive: modus ponens was the only rule, and there was no conditional proof or proof by reductio. The argument just given, on the other hand, was given in the metalanguage, in an unformalized language, and using unformalized techniques of argument. “Unformalized” doesn’t imply lack of rigor. The argument was perfectly rigorous: it conforms to the standards of good argumentation that generally prevail in mathematics. We’re free to use reductio ad absurdum, conditional proof, universal proof (to The careful reader will note that here (and henceforth), I treat “VA (α)=0” and “VA (α) is not 1” interchangeably (for any wff α). (Similarly for “VA (α)=1” and “VA (α) is not 0”.) This is justified as follows. First, if VA (α) is 0, then it can’t also be that VA (α) is 1 — VA was stipulated to be a function. Second, since it was stipulated that VA assigns either 0 or 1 to each wff, if VA (α) is not 1, then VA (α) must be 0. 2


26

establish something of the form “everything is thus-and-so”, we consider an arbitrary thing and show that it is thus-and-so). We may “skip steps” if it’s clear how the argument is supposed to go. In short, what we must do is convince a well-informed and mathematically sophisticated reader that the result we’re after is indeed correct. With our definition of an assignment, and of truth-in-an-assignment, in place, we can now define the semantic versions of the notions of logical truth, logical consequence, and logically correct argument. The semantic notion of a logical truth is that of a valid formula: φ is valid =d f for every PL-valuation, A, VA (φ)=1 We write “ φ” for “φ is valid”. The valid formulas of propositional logic are often called “tautologies”. As for logical consequence, the semantic version of this notion is that of one formula’s being a semantic consequence of a set of formulas: φ is a semantic consequence of the wffs in set Γ =d f for every PL-valuation, A, IF for each θ in Γ, VA (θ)=1, THEN VA (φ)=1 We write “Γ φ” for “φ is a semantic consequence of Γ” The intuitive idea is that φ is a semantic consequence of Γ if φ is true whenever each of the members of Γ is true. Finally, we can say that an argument is semantically logically correct iff its conclusion is a semantic consequence of (the set of) its premises. A parenthetical remark: now we can see the importance for setting up the grammar for our system according to precise rules. If we hadn’t, the definition of ‘truth value’ given here would have been impossible. In this definition we defined truth values of complicated formulas based on their form. For example, if a formula has the form (φ→ψ), then we assigned it an appropriate truth value based on the truth values of φ and ψ. But suppose we had a formula in our language that looked as follows: P →P →P and suppose that P has truth value 0. What is the truth value of the whole? We can’t tell, because of the missing parentheses. For if the parentheses look like this: (P →P )→P


27

then the truth value is 0, whereas if the parentheses look like this: P →(P →P ) then it is 1. Certain kinds of ambiguity, then, make it impossible to assign truth value. We solve this problem in logic by pronouncing the original string “P →P →P ” as ill-formed; it is missing parentheses. Thus, the precise rules of grammar assure us that when it comes time for doing semantics, we’ll be able to assign semantic values (in this case, truth values) in an unambiguous way. Notice also a fact about validity in propositional logic: it is mechanically “decidable” — a computer program could be written that is capable of telling, for any given formula, whether or not that formula is valid. The program would simply construct a complete truth table for the formula in question. We can observe that this is possible by noting the following: every formula contains a finite number N of sentence letters, and so for any formula, there are only a finite number of different “cases” one needs to check — namely, the 2N permutations of truth values for the contained sentence letters. But given any assignment of truth values to the sentence letters of a formula, it’s clearly a perfectly mechanical procedure to compute the truth value the formula takes for those truth values — simply apply the rules for the ∼ and → repeatedly. It’s worth being very clear about two assumptions in this proof (which, by the way, is our first bit of metatheory — our first proof about a logical system). They are: that every formula has a finite number of sentence letters, and that the truth values of sentence letters not contained in a formula do not affect the truth value of the formula. We need the latter assumption to be sure that there are only a finite number of cases — namely, the permutations of truth values of the contained sentence letters — we need to check to see whether a formula is valid; for there are infinitely many valuation functions (since there are infinitely many sentence letters in the language of PL). These two assumptions are obviously true, but it would be good to prove them. I’ll prove the first assumption here; the second may be proved by a similar method, namely by induction. Proof that every wff contains a finite number of sentence letters: In this sort of proof by induction, we’re trying to prove a statement of the form: every wff has property P. The property P in this case is having a finite number of different sentence letters. In order to do this, we must show two separate statements:


28

base case: we show that every atomic sentence has the property. This is obvious — atomic sentences are just sentence letters, and each of them contains one sentence letter, and thus finitely many different sentence letters. induction step: we begin by assuming that if formulas φ and ψ have the property, then so will the complex formulas one can form from φ and ψ by the rules of formation, namely ∼φ and φ→ψ. So, we assume that φ and ψ have finitely many different sentence letters; and we show that the same must hold for ∼φ and φ→ψ. That’s obvious: ∼φ has as many different sentence letters as does φ; since φ, by assumption, has only finitely many, then so does ∼φ. As for φ→ψ, by hypothesis, φ and ψ have finitely many different sentence letters, and so φ→ψ has, at most, n + m sentence letters, where n and m are the number of different sentence letters in φ and ψ, respectively. We’ve shown that every atomic formula has the property having a finite number of different sentence letters; and we’ve shown that the property is inherited by complex formulas built according to the recursion rules. But every wff is either atomic, or built from atomics by a finite series of applications of the recursion rules. Therefore, by induction, every wff has the property. QED.

2.4

Soundness and completeness of PL

We have two notions now, the notion of a theorem and the notion of a valid formula. An important accomplishment of metalogic is the establishment of the following two important connections between these notions: Soundness: every theorem is valid (If ` φ then φ) Completeness: every valid wff is a theorem (If φ then ` φ) It’s pretty easy to establish soundness: Soundness proof for PL: We’re going to prove this by induction as well. But our inductive proof here is slightly different. We’re not trying to prove something of the form “Every wff has property P”. Instead, we’re trying to prove something of the form “Every

CHAPTER 2. PROPOSITIONAL LOGIC theorem has property P”. In this case, the property P is: being a valid formula. Here’s how induction works in this case. A theorem is the last line of any proof. So, to show that every theorem has a certain property P, all we need to do is show that every time one adds another line to a proof, that line has property P. Now, there are two ways one can add to a proof. First, one can add an axiom. The base case of the inductive proof must show that adding axioms always means adding a line with property P. Second, one can add a formula that follows from earlier lines by a rule. The inductive step of the inductive proof must show that in this case, too, one adds a line with property P, provided all the preceding lines have property P. OK, here goes: base case: here we need to show that every PL-axiom is valid. This is tedious but straightforward. Take A1, for example. Suppose for reductio that some instance of A1 is invalid, i.e., for some assignment A, VA (φ→(ψ→φ))=0. Thus, VA (φ)=1 and VA (ψ→φ)=0. Given the latter, VA (φ)=0 — contradiction. Analogous proofs can be given that instances of A2 and A3 are also valid. induction step: here we begin by assuming that every line in a proof up to a certain point is valid (this is the “inductive hypothesis”); we then show that if one adds another line that follows from earlier lines by the rule modus ponens, that line must be valid too. I.e., we’re trying to show that “modus ponens preserves validity”. So, assume the inductive hypothesis: that all the earlier lines in the proof are valid. And now, consider the result of applying modus ponens. That means that the new line we’ve added to the proof is some formula ψ, which we’ve inferred from two earlier lines that have the forms φ→ψ and φ. We must show that ψ is a valid formula, i.e., that VA (ψ)=1 for every assignment A. By the inductive hypothesis, all earlier lines in the proof are valid, and hence both φ→ψ and φ are valid. Thus, VA (φ)=1 and VA (φ→ψ)=1. But if VA (φ)=1 then VA (ψ) can’t be 0, for if it were, then VA (φ→ψ) would be 0, and it isn’t. Thus, VA (ψ)=1. We’ve shown that axioms are valid, and that modus ponens preserves validity. So, by induction, every time one adds to a proof, one adds a valid formula. So the last line in a proof is always a valid

29


30

formula. Thus, every theorem is valid. QED. Notice the general structure of this proof: we first showed that every axiom has a certain property, and then we showed that the rule of inference preserves the property. Given the definition of ‘theorem’, it followed that every theorem has the property. We chose our definition of a theorem with just this sort of proof in mind. Remember that this is a proof in the metalanguage, about propositional logic. It isn’t a proof in any system of derivation. Completeness is harder, and I won’t prove it here. Before we leave this chapter, let me summarize and clarify the nature of proofs by induction. Induction is the method of proof to use whenever one is trying to prove that every member of an infinite class of entities has a certain feature F, where each member of that infinite class of entities is generated from certain “starting points” by a finite number of successive “operations”. To do this, one establishes two things: a) that the starting points have feature F, and b) that the operations preserve feature F — i.e., that if the inputs to the operations have feature F then the output also has feature F. In logic, it is important to distinguish two different cases where proofs by induction are needed. One case is where one is establishing a fact of the form: every theorem has a certain feature F. (The proof of the soundness theorem is an example of this case.) Here’s why induction is applicable: a theorem is defined as the last line of a proof. So the fact to be established is that every line in every proof has feature F. Now, a proof is defined as a finite sequence, where each member is either an axiom or follows from earlier lines by the rule modus ponens. The axioms are the “starting points” and modus ponens is the “operation”. So all that’s required to show that every line in every proof has feature F is to show that a) the axioms all have feature F, and b) show that if you start with formulas that have feature F, and you apply modus ponens, then what you get is something with feature F. More carefully, b) means: if φ has feature F, and φ→ψ has feature F, then ψ has feature F. Once a) and b) are established, one can conclude by induction that all lines in all proofs have feature F. A second case in which induction may be used is when one is trying to establish a fact of the form: every formula has a certain feature F. (The proof that every wff has a finite number of sentence letter is an example of this case.) Here’s why induction is applicable: all formulas are built out of sentence letters (the “starting points”) by successive applications of the rules of formation (“operations”) (the rules of formation, recall, say that if φ and ψ are formulas,


31

then so are (φ→ψ) and ∼φ.) So, to show that all formulas have feature F, we must merely show that a) all the sentence letters have feature F, and b) show that if φ and ψ both have feature F, then both (φ→ψ) and ∼φ also will have feature F. In any given proof by induction, it’s important to identify which sort of inductive proof one is dealing with.

2.5

Natural Deduction in Propositional Logic

This chapter develops the method of natural deduction for propositional logic. This is an alternate method for defining provability. Natural deduction proofs are much easier to construct than axiomatic proofs.

2.5.1

Sequents

The basic notion is that of a sequent. A sequent looks like this: Γ`φ Γ is a set of formulas, and φ is a particular formula. The symbol in the middle, `, is the same symbol as we used as the metalanguage symbol for provability in section 2.2; but here it is being used for a (somewhat) different purposes: the symbol itself is a part of what are now calling sequents. What does a sequent mean? Well, strictly speaking a sequent isn’t a statement, so it doesn’t mean anything; but informally think of the sequent Γ ` φ as meaning that φ is a logical consequence of Γ. Accordingly, we can introduce a notion of logical correctness for sequents: the sequent Γ ` φ is logically correct if the formula φ is a logical consequence of the formulas in Γ. Let’s call the formulas in Γ the premises of the sequent, and φ the conclusion of the sequent; thus, one is entitled to conclude the conclusion of a logically correct sequent from its premises. Now, from our investigation of the semantics of propositional logic, we already have the makings of a semantic criterion for when a sequent is logically correct: the sequent Γ ` φ is logically correct iff φ is a semantic consequence of Γ. We could also, if we wanted, use the methods of section 2.2 to give a proof-theoretic criterion: Γ ` φ is logically correct iff φ is provable from Γ. But in this section, we will explore a new sort of proof-theoretic criterion for the logical correctness of sequents.


32

The purpose of this new criterion is to model the kind of reasoning one employs in everyday life (and which is modeled in the derivation systems of many introductory logic books.) In ordinary reasoning, one reasons by means of assumptions. For example, in order to establish a conditional claim “if P then Q”, one would ordinarily i) assume P, ii) reason one’s way to Q, iii) and on that basis conclude that the conditional claim “if P then Q” is true. Another example: to establish a claim of the form “not P”, one would ordinarily i) assume P, ii) reason one’s way to a contradiction, iii) and on that basis conclude that “not P” is true. Reasoning by conditional proof and by reductio ad absurdum is commonplace in ordinary life, but is not allowed in the proof system of section 2.2 (that is why proofs were so hard to construct in that system!) The natural deduction proofs that we will introduce in this section do allow (analogs of) conditional proof and reductio, and are therefore much easier to construct. Superficially, proofs in our natural deduction system will look a lot like axiomatic proofs. A natural deduction proof is defined as a sequence of sequents; to prove a sequent, one must simply exhibit a proof whose last line is the desired sequent. Rules of inference now allow us to move from sequents to sequents, rather than from formulas to formulas. Some sequents may be entered into a proof at any time; these function like axioms. But as we will see, natural deduction proofs are much easier to construct than axiomatic proofs, since the “conditional” nature of sequents will, in essence, allow us to work with assumptions. (It’s a bit weird to think of proving sequents, since each sequent itself asserts a relation of logical consequence between its premises and its conclusion. But you’ll get used to it.)

2.5.2

Rules

Our rules tell us when we can write down sequents. The first rule, the rule of assumptions (As), says we can always write down any sequent of the following form: φ`φ All such a sequent says is that φ can be proved if we assume φ itself. The rest of the rules consist of introduction rules and elimination rules for each of the connectives ∼, ∧, ∨, → (let’s forget the ↔; φ↔ψ can just be eliminated in favor of (φ→ψ)∧(ψ→φ).) Let’s start with ∧I:


33

Γ`φ ∆`ψ Γ,∆ ` φ∧ψ This says that if some assumptions Γ lead to φ, and some assumptions ∆ lead to ψ, then from all the assumptions together, the ones in Γ and the ones in ∆, we can get to φ∧ψ. Next we have ∧E: Γ ` φ∧ψ Γ`φ Γ`ψ This says that if Γ leads to the conjunction φaψ, then we should be able to infer either of the two sequents below the line, Γ ` φ or Γ ` ψ (or both). Next, ∨I and ∨E: Γ`φ Γ ` φ∨ψ

Γ ` ψ∨φ

Γ ` φ∨ψ ∆1 ,φ ` χ Γ,∆1 ,∆2 ` χ

∆2 ,ψ ` χ

Let’s think about what ∨E means. Remember the intuitive meaning of a sequent: its conclusion is a logical consequence of its premise. Another (related) way to think of it is that Γ ` φ means that one can establish that φ if one assumes the members of Γ. So, if the sequent Γ ` φ∨ψ is logically correct, that means we’ve got the disjunction φ∨ψ, assuming the formulas in Γ. Now, suppose we can reason to a new formula χ , assuming φ, plus perhaps some other assumptions ∆1 . And suppose we can also reason to χ from ψ, plus perhaps some other assumptions ∆2 . Then, since either φ or ψ (plus the assumptions in ∆1 and ∆2 ) leads to χ , and we know that φ∨ψ is true (conditional on the assumptions in Γ), we ought to be able to infer χ itself, assuming the assumptions we needed along the way (∆1 and ∆2 ), plus the assumptions we needed to get φ∨ψ, namely, Γ. Next, we have double negation (DN): Γ`φ Γ ` ∼∼φ

Γ ` ∼∼φ Γ`φ

In connection with negation, we also have the rule of reductio ad absurdum, RAA: Γ,φ ` ψ∧∼ψ Γ ` ∼φ


34

That is, if φ (along with perhaps some other assumptions, Γ) leads to a contradiction, we can conclude that ∼φ is true (given the assumptions in Γ). And finally we have →I and →E: Γ ` φ→ψ Γ,∆ ` ψ

Γ,φ ` ψ Γ ` φ→ψ

∆`φ

→E is perfectly straightforward; it’s just modus ponens. But →I requires a bit more thought. →I is just the principle of conditional proof. Suppose you can get to ψ on the assumption that φ (plus perhaps some other assumptions Γ.) Then, you should be able to conclude that the conditional φ→ψ is true (assuming the formulas in Γ). Put another way: if you want to establish the conditional φ→ψ, all you need to do is assume that φ is true, and reason your way to ψ.

2.5.3

Example derivations

While this system may not look exactly like the derivation systems familiar from introductory logic textbooks, the essence is the same. Each system is designed to model reasoning with assumptions. The difference is that the derivation systems in introductory textbooks keep track of which assumptions are operative at a given point in a proof by means of the placement of that point in the proof on the page, and by means of drawing lines or boxes around parts of the proof once the assumptions that led to those parts are no longer operative, whereas the current system keeps track of the operative assumptions by explicitly placing them in the premise sets of sequents. A little experimentation will show that all the usual techniques for proving things in the usual systems carry over to the present system. In this section I’ll do a few examples to make this clear. A first simple example: let’s show that P ∧Q ` Q∧P : 1. 2. 3. 4.

P ∧Q ` P ∧Q P ∧Q ` P P ∧Q ` Q P ∧Q ` Q∧P

As 1, ∧E 1, ∧E 2, 3 ∧I

Notice the strategy. We first use the rule of assumptions to enter the premise of the sequent we’re trying to prove: P ∧Q. We then use the rules of inference to infer the consequent of that sequent: Q∧P . Since our initial assumption of P ∧Q was dependent on the formula P ∧Q, our subsequent inferences remain


35

dependent on that same assumption, and so the final sequent concluded, Q∧P , remains dependent on that assumption. Let’s write our proofs out in a simpler way. Instead of writing out entire sequents, let’s write out only their conclusions. We can indicate the premises of the sequent using line numbers; the line numbers indicating the premises of the sequent will go to the left of the number indicating the sequent itself. Rewriting the previous proof in this way yields: 1 (1) P ∧Q 1 (2) P 1 (3) Q 1 (4) Q∧P

As 1, ∧E 1, ∧E 2, 3 ∧I

Next, let’s have an example to illustrate conditional proof. Let’s establish P →Q, Q→R ` P →R: 1. P →Q ` P →Q 2. Q→R ` Q→R 3. P ` P 4. P →Q, P ` Q 5. P →Q, Q→R, P ` R 6. P →Q, Q→R ` P →R

As As As 1,3 →E 2,4 →E 5,→I

It can be rewritten in the simpler style as follows: 1 (1) 2 (2) 3 (3) 1,3 (4) 1,2,3 (5) 1,2 (6)

P →Q Q→R P Q R P →R

As As As 1, 3 →E 2, 4 →E 5, →I

Let’s think about this example. We’re trying to establish P →R on the basis of two formulas, P →Q and Q→R, so we start by assuming the latter two formulas. Then, since the formula we’re trying to establish is a conditional, we assume the antecedent of the conditional, in line 3. We then proceed, on that basis, to reason our way to R, the consequent of the conditional we’re trying to prove. (Notice how in lines 4 and 5, we add more line numbers on the very left. Whenever we use → E, we increase dependencies: when we infer


36

Q from P and P →Q, our conclusion Q depends on all the formulas that P and P →Q depended on, namely, the formulas on lines 1 and 3. Look back to the statement of the rule → E: the conclusion ψ depends on all the formulas that φ and φ→ψ depended on: Γ and ∆.) That brings us to line 5. At that point, we’ve shown that R can be proven, on the basis of various assumptions, including P . The rule →I — that is, the rule of conditional proof — then lets us conclude that the conditional P →R follows merely on the basis of the other assumptions; that rule, note, lets us in line 6 drop line 3 from the list of assumptions on which P →R depends. Next let’s establish an instance of DeMorgan’s Law, ∼(P ∨Q) ` ∼P ∧∼Q: 1 2 2 1,2 1 6 6 1,6 1 1

(1) (2) (3) (4) (5) (6) (7) (8) (9) (10)

∼(P ∨Q) P P ∨Q (P ∨Q)∧∼(P ∨Q) ∼P Q P ∨Q (P ∨Q)∧∼(P ∨Q) ∼Q ∼P ∧∼Q

As As (for reductio) 2, ∨I 1, 3 ∧I 4, RAA As (for reductio) 6, ∨I 1, 7 ∧I 8, RAA 5, 9∧I

Next let’s establish ∅ ` P ∨∼P (∅ is the null set): 1 (1) 2 (2) 2 (3) 2,1 (4) 1 (5) 6 (6) 6 (7) 6,1 (8) 1 (9) 1 (10) ∅ (11) ∅ (12)

∼(P ∨∼P ) P P ∨∼P (P ∨∼P )∧∼(P ∨∼P ) ∼P ∼P P ∨∼P (P ∨∼P )∧∼(P ∨∼P ) ∼∼P ∼P ∧∼∼P ∼∼(P ∨∼P ) P ∨∼P

As As (for reductio) 2, ∨I 1, 3 ∧I 4, RAA As (for reductio) 6, ∨I 1, 7 ∧I 8, RAA 5, 9 ∧I 10, RAA 11, DN

Comment: my overall goal was to assume ∼(P ∨∼P ) and then derive a con-


37

tradiction. And my route to the contradiction was to separately establish ∼P (lines 2-5) and ∼∼P (lines 6-9), each by reductio arguments. Finally, let’s establish a sequent corresponding to a way that ∨ E is sometimes formulated: P ∨Q, ∼P ` Q: 1 (1) 2 (2) 3 (3) 4 (4) 5 (5) 4,5 (6) 4,5 (7) 2,4,5 (8) 2,4 (9) 2,4 (10) 1,2 (11)

P ∨Q ∼P Q P ∼Q ∼Q∧P P P ∧∼P ∼∼Q Q Q

As As As (for use with ∨E) As (for use with ∨E) As (for reductio) 4,5 ∧I 6, ∧E 2,7 ∧I 8, RAA 9, DN 1,3,10 ∨E

The basic idea of this proof is to use ∨ E on line 1 to get Q. That calls, in turn, for showing that each disjunct of line 1, P and Q, leads to Q. Showing that Q leads to Q is easy; that was line 3. Showing that P leads to Q took lines 4-10; line 10 states the result of that reasoning, namely that Q follows from P (as well as line 2). I began at line 4 by assuming P . Then my strategy was to establish Q by reductio, so I assumed ∼Q in line 5. At this point, I basically had my contradiction: at line 2 I had ∼P and at line 4 I had P . (You might think I had another contradiction: Q at line 3 and ∼Q at line 5. But at the end of the proof, I don’t want my conclusion to depend on line 3, whereas I don’t mind it depending on line 2, since that’s one of the premises of the sequent I’m trying to establish.) So I want to put P and ∼P together, to get P ∧∼P , and then conclude ∼∼Q by RAA. But there is a minor hitch. Look carefully at how RAA is formulated. It says that if we have Γ,φ ` ψ∧∼ψ, we can conclude Γ ` ∼φ. The first of these two sequents includes φ in its premises. That means that in order to conclude ∼φ, the contradiction ψ∧∼ψ needs to depend on φ. So in the present case, in order to finish the reductio argument and conclude ∼∼Q, the contradiction P ∧∼P needs to depend on the reductio assumption ∼Q (line 5.) But if I just used ∧I to put lines 2 and 4 together, the resulting contradiction will only depend on lines 2 and 4. To get around this, I used a little trick. Whenever you have a sequent Γ ` φ, you can always add any formula ψ you like to the premises on which φ depends, using the following


38

argument:3 Γ`φ ψ`ψ Γ,ψ ` φ∧ψ Γ,ψ ` φ

(begin with this) As (ψ is any chosen formula) ∧I ∧E

Lines 4, 6 and 7 in the proof employ this trick: initially, at line 4, P only depends on 4, but then by line 7, P also depends on 5. That way, the move from 8 to 9 by RAA is justified.

2.5.4

Theoremhood and consequence

So far we have defined the notion of a provable sequent. We can now use this to define sequent-proof-theoretic (“SPT”) versions of the notions of logical truth, logical consequence, and logical correctness: A formula φ is a SPT-logical truth iff the sequent ∅ ` φ is a provable sequent. Formula φ is a SPT-logical consequence of the formulas in set Γ iff the sequent Γ ` φ is a provable sequent. An argument is SPT-logically correct iff its conclusion is a SPT-logical consequence of its premises Given these definitions, and given the semantics for PL described in section 2.3, one could give soundness and completeness proofs.4 The soundness proof, for instance, would proceed by proving by induction that whenever sequent Γ ` φ is provable, φ is a semantic consequence of Γ. This would proceed by showing that each rule of inference (As, RAA, ∧I, ∧E, etc.) preserves semantic consequence. The completeness proof is harder. Adding arbitrary dependencies is not allowed in relevance logic, where a sequent is provable only when all of its premises are, in an intuitive sense, relevant to its conclusion. Relevant logicians modify various rules of classical logic, including the rule of ∧E. 4 Note: if we allow sequents with infinite premise-sets, then to secure completeness we will need to add a rule for adding dependencies: from Γ ` φ conclude Γ ∪ ∆ ` φ, where ∆ is any set of wffs. The trick described above for adding dependencies (using RA, ∧I and ∧E) only allows us to add one wff at a time to the premise set of a given sequent, whereas this new rule allows adding infinitely many. 3

Chapter 3 Variations and Deviations from Standard Propositional Logic s promised, we will not stop with the standard logics familiar from introductory textbooks. In this chapter we examine some philosophically important variations and deviations from standard propositional logic.

A

3.1

Alternate connectives

3.1.1

Symbolizing truth functions in propositional logic

Our propositional logic is complete, in a certain sense that I’ll now explain. The basic idea is that we can say anything we want to say with it. More carefully, let’s introduce the idea of a truth function. A truth function is a (finite-placed) function or rule that maps truth values (i.e., 0s and 1s) to truth values. For example, here is a truth function, f : f (1) = 0 f (0) = 1 This is a called one-place function because it takes only one truth value as input. In fact, we have a name for this truth function: negation. And we express that truth function with our symbol ∼. So the negation truth function is one we can symbolize in propositional logic. More carefully, what we mean by saying “We can symbolize truth function f in propositional logic” is this: 39

CHAPTER 3. VARIATIONS AND DEVIATIONS FROM PL

40

there is some sentence of propositional logic, φ, containing a single sentence letter, P , which has the following feature: whenever P has a truth value t , then the whole sentence φ has the truth value f (t ). The sentence φ is in fact ∼P . Here’s another truth function, g . g is a two-place truth function, which means that it takes two truth values as inputs: g (1, 1) = 1 g (1, 0) = 0 g (0, 1) = 0 g (0, 0) = 0 In fact, this is the conjunction truth function. And have a symbol for this truth function: ∧. And as before, we can symbolize function g in propositional logic; this means that: There is some sentence of propositional logic, φ, containing two sentence letters, P and Q, which has the following feature: whenever P has a truth value, t , and Q has a truth value, t 0 , then the whole sentence φ has the truth value g (t , t 0 ) One such sentence φ is in fact: P ∧Q. Notice that the sentence φ that symbolizes1 the function g had to have two sentence letters rather than one. That’s because the function g was a two-place function. In general, the definition of “can be symbolized” is this: n-place truth function h can be symbolized in propositional logic =d f there is some sentence of propositional logic, φ, containing n sentence letters, P1 . . . Pn , which has the following feature: whenever P1 has a truth value, t1 , and, …, and Pn has a truth value, tn , then the whole sentence φ has the truth value h(t1 . . . tn ) Here’s another truth function: i(1, 1) = 0 i(1, 0) = 1 i(0, 1) = 1 i(0, 0) = 1 1

Strictly speaking, we should speak of a sentence symbolizing a truth function relative to an ordering of its sentence letters.


41

Think of this truth function as “not both”. Unlike the negation and conjunction truth functions, we don’t have a single symbol for this truth function. Nevertheless, it can be symbolized in propositional logic: by the following sentence: ∼(P ∧Q) Now, it’s not too hard to prove that: All truth functions (of any finite number of places) can be symbolized in propositional logic using just the ∧, ∨, and ∼ I’ll begin by illustrating the idea of the proof with an example. Suppose we want to symbolize the following three-place truth-function: f( f( f( f( f( f( f( f(

1, 1, 1, 1, 0, 0, 0, 0,

1, 1, 0, 0, 1, 1, 0, 0,

1 0 1 0 1 0 1 0

)=0 )=1 )=0 )=1 )=0 )=0 )=1 )=0

Since this truth function returns the value 1 in just three cases (rows two, four, and seven), what we want is a sentence containing three sentence letters, P1 , P2 , P3 , that is true in exactly those three cases: (a) when P1 , P2 , P3 take on the three truth values in the second row (i.e., 1, 1, 0), (b) when P1 , P2 , P3 take on the three truth values in the fourth row (1, 0, 0), and (c) when P1 , P2 , P3 take on the three truth values in the seventh row (0, 0, 1). Now, we can construct a sentence that is true in case (a) and false otherwise: P1 ∧P2 ∧∼P3 . We can also construct a sentence that’s true in case (b) and false otherwise: P1 ∧∼P2 ∧∼P3 . And we can also construct a sentence that’s true in case (c) and false otherwise: ∼P1 ∧∼P2 ∧P3 . But then we can simply disjoin these three sentences to get the sentence we want: (P1 ∧P2 ∧∼P3 ) ∨ (P1 ∧∼P2 ∧∼P3 ) ∨ (∼P1 ∧∼P2 ∧P3 )


42

(Strictly speaking the three-way conjunctions, and the three-way disjunction, need parentheses added, but since it doesn’t matter where they’re added — conjunction and disjunction are associative — I’ve left them off.) This strategy is in fact purely general. Any n-place truth function, f , can be represented by a chart like the one above. Each row in the chart consists of a certain combination of n truth values, followed by the truth value returned by f for those n inputs. For each such row, construct a conjunction whose i th conjunct is Pi if the i th truth value in the row is 1, and ∼Pi if the i th truth value in the row is 0. Notice that the conjunction just constructed is true if and only if its sentence letters have the truth values corresponding to the row in question. The desired formula is then simply the disjunction of all and only the conjunctions for rows where the function f returns the value 1.2 Since the conjunction for a given row is true iff its sentence letters have the truth values corresponding to the row in question, the resulting disjunction is true iff its sentence letters have truth values corresponding to one of the rows where f returns the value true, which is what we want. Say that a set of connectives is adequate iff one can symbolize all the truth functions using a sentence containing only those connectives. What we just showed was that the set {∧, ∨, ∼} is adequate. We can then use this fact to prove that other sets of connectives are adequate. For example, it is easy to prove that φ∨ψ has the same truth table as (is true relative to exactly the same PL-assignments as) ∼(∼φ∧∼ψ). But that means that for any sentence χ whose only connectives are ∧, ∨, and ∼, we can construct another sentence χ 0 with the same truth table but whose only connectives are ∧ and ∼: simply begin with χ and use the equivalence between φ∨ψ and ∼(∼φ∧∼ψ) to eliminate all occurrences of ∨ in favor of occurrences of ∧ and ∼. But now consider any truth function f . Since {∧, ∨, ∼} is adequate, f can be symbolized by some sentence χ ; but χ has the same truth table as some sentence χ 0 whose only connectives are ∧ , and ∼; hence f can be symbolized by χ 0 as well. So {∧, ∼} is adequate. Similar arguments can be given to show that other connective sets are adequate as well. For example, the ∧ can be eliminated in favor of the → and the ∼ (since φ∧ψ has the same truth table as ∼(φ→∼ψ)); therefore, since {∧, ∼} is adequate, {→, ∼} is also adequate. 2

Special case: if there are no such rows — i.e., if the function returns 0 for all inputs — then let the formula be simply any logically false formula containing P1 . . . Pn , for example P1 ∧∼P1 ∧P2 ∧P3 ∧ · · · ∧Pn .


3.1.2

43

Inadequate connective sets

Can we show that certain sets of connectives that are not adequate? The answer is yes. Let’s prove that {∧, →} is not an adequate set of connectives. We’ll do this by proving that if those were our only connectives, we couldn’t symbolize the negation truth function. Let’s prove this fact: For any sentence, φ, containing just sentence letter P and the connectives ∧ and →, if P is true then so is φ. We’ll again use the method of induction. We want to show that the assertion is true for all sentences. So we first prove that the assertion is true for all sentence with no connectives (i.e., for sentences containing just sentence letters.) This is the base case, and is very easy here, since if φ has no connectives, then obviously φ is just the sentence letter P itself, in which case, clearly, if P is true then so is φ. Next we assume the inductive hypothesis: Inductive hypothesis: the assertion holds true for sentences φ and ψ And we try to show, on the basis of this assumption, that: The assertion holds true for φ∧ψ and φ→ψ This is easy to show. We want to show that the assertion holds for φ∧ψ — that is, if P is true then so is φ∧ψ. But we know by the inductive hypothesis that the assertion holds for φ and ψ individually. So we know that if P is true, then both φ and ψ are true. But then, we know from the truth table for ∧ that φ∧ψ is also true in this case. The reasoning is exactly parallel for φ→ψ: the inductive hypothesis tells us that whenever P is true, so are φ and ψ, and then we know that in this case φ→ψ must also then be true, by the truth table for →. Therefore, by induction, the result is proved.

3.1.3

Sheffer stroke

We’ve seen how we can choose alternate sets of connectives. Some of these choices are adequate (i.e., allow symbolization of all truth functions), others are not.


44

As we saw, there are some truth functions that can be symbolized in propositional logic, but not by a single connective (e.g., the not-both function i discussed above.) We could change this, by adding a new connective. Let’s use a new connective, the “Sheffer stroke”, |, to symbolize not-both. φ|ψ is to mean that not both φ and ψ are true, so let’s stipulate that φ|ψ will have the same truth table as ∼(φ∧ψ), i.e: φ 1 1 0 0

| ψ 0 1 1 0 1 1 1 0

Now here’s an exciting thing about |: it’s an adequate connective all on its own. You can symbolize all the truth functions using just |! Here’s how we can prove this. We showed above that {→, ∼} is adequate; so all we need to do is show how to define the → and the ∼ using just the |. Defining ∼ is easy; φ|φ has the same truth table as ∼φ. As for φ→ψ, think of it this way. φ→ψ is equivalent to ∼(φ∧∼ψ), i.e., φ|∼ψ. But given the method just given for defining ∼ in terms of |, we know that ∼ψ is equivalent to ψ|ψ. Thus, φ→ψ has the same truth table as: φ|(ψ|ψ).

3.2

Polish notation

Alternate connectives, like the Sheffer stroke, are called “variations” of standard logic because they don’t really change what we’re saying with propositional logic; it’s just a change in notation. Another fun change in notation is polish notation. The basic idea of polish notation is that the connectives all go before the sentences they connect. Instead of writing P ∧Q, we write ∧P Q. Instead of writing P ∨Q we write ∨P Q. Formally, here is the definition of a wff: i) sentence letters are wffs ii) if φ and ψ are wffs, then so are: ∧φψ ∨φψ →φψ


45

↔φψ ∼φ What’s the point? This notation eliminates the need for parentheses. With the usual notation, in which we put the connectives between the sentences they connect, we need parentheses to distinguish, e.g.: (P ∧Q)→R P ∧(Q→R) But with polish notation, these are distinguished without parentheses; they become: →∧P QR ∧P →QR respectively.

3.3

Multi-valued logic3

Logicians have considered adding a third truth value to the usual two. In these new systems, in addition to truth (1) and falsity (0), we have a third truth value, #. There are a number of things one could take # to mean (e.g., “meaningless”, or “undefined”, or “unknown”). Standard logic is “bivalent” — that means that there are no more than two truth values. So, moving from standard logic to a system that admits a third truth value is called “denying bivalence”. One could deny bivalence, and go even further, and admit four, five, or even infinitely many truth values. But we’ll only discuss trivalent systems — i.e., systems with only three truth values. Why would one want to admit a third truth value? There are various philosophical reasons one might give. One concerns vagueness. A person with one dollar is not rich. A person with a million dollars is rich. Somewhere in the middle, there are some people that are hard to classify. Perhaps a person with $100,000 is such a person. They seem neither definitely rich nor definitely not rich. So there’s pressure to say that the statement “this person is rich” is capable of being neither definitely true nor definitely false. It’s vague. Others say we need a third truth value for statements about the future. If it is in some sense “not yet determined” whether there will be a sea battle tomorrow, then (it is argued) the sentence: 3

See Gamut (1991a, pp. 173-183).


46

There will be a sea battle tomorrow is neither true nor false. In general, statements about the future are neither true nor false if there is nothing about the present that determines their truth value one way or the other.4 Yet another case in which some have claimed that bivalence fails concerns failed presupposition. Consider this sentence: Ted stopped beating his dog. In fact, I have never beaten a dog. I don’t even have a dog. So is it true that I stopped beating my dog? Obviously not. But on the other hand, is this statement false? Certainly no one would want to assert its negation: “Ted has not stopped beating his dog”. The sentence presupposes that I was beating a dog; since this presupposition is false, the question of the sentence’s truth does not arise: the sentence is neither true nor false. For a final challenge to bivalence, consider the sentence: Sherlock Holmes has a mole on his left leg ‘Sherlock Holmes’ doesn’t refer to a real entity. Further, Sir Arthur Conan Doyle does not specify in his Sherlock Holmes stories whether Holmes has such a mole. Either of these reasons might be argued to result in a truth value gap for the displayed sentence. It’s an interesting philosophical question whether any of these arguments for bivalence’s failing are any good. But we won’t take up that question. Instead, we’ll look at the formal result of giving up bivalence. That is, we’ll introduce some non-bivalent formal systems. We won’t ask whether these systems really model English correctly. These systems all give different truth tables for the Boolean connectives. The original truth tables give you the truth values of complex formulas based on whether their sentence letters are true or false (1 or 0). The new truth tables need to take into account cases where the sentence letters are # (neither 1 nor 0). 4 An alternate view preserves the “openness of the future” as well as bivalence: both ‘There will be a sea battle tomorrow’ and ‘There will fail to be a sea battle tomorrow’ are false. This combination is not contradictory, provided one rejects the equivalence of “It will be the case tomorrow that ∼φ” and “∼ it will be the case tomorrow that φ”.


3.3.1

47

Łukasiewicz’s system

Here are the new truth tables (let’s skip the ↔): ∼ 1 0 0 1 # #

∧ 1 0 #

1 1 0 #

0 0 0 0

# # 0 #

∨ 1 0 #

1 1 1 1

0 1 0 #

# 1 # #

→ 1 0 #

1 1 1 1

0 0 1 #

# # 1 1

Using these truth tables, one can calculate truth values of wholes based on truth values of parts. Example: Where P is 1, Q is 0 and R is #, calculate the truth value of (P∨Q)→∼(R→Q). First, what is R→Q? Answer, from the truth table for →: #. Next, what is ∼(R→Q)? From the truth table for ∼, we know that the negation of a # is a #. So, ∼(R→Q) is #. Next, P ∨Q: that’s 1 ∨ 0 — i.e., 0. Finally, the whole thing: 0→# — i.e., 1. If we wanted, we could formalize all of this a bit more by defining up new notions of an assignment, and of truth relative to an assignment. The new notion of an assignment — a trivalent assignment — would be that of a function that assigns to each sentence letter exactly one of the values: 1, 0, #. And the new notion of truth relative to a trivalent assignment would be defined thus: For any trivalent assignment, A, the valuation for A, VA , is defined as the function that assigns to each wff either 1, 0, or #, and which is such that, for any wffs φ and ψ, i) if φ is a sentence letter then VA (φ)=A(φ)  ii) VA (φaψ) =

 1 if VA (φ)=1 and VA (ψ)=1 0 if VA (φ)=0 or VA (ψ)=0  # otherwise

 iii) VA (φ∨ψ) =

 1 if VA (φ)=1 or VA (ψ)=1 0 if VA (φ)=0 and VA (ψ)=0  # otherwise


48

1 if either: VA (φ)=0, or VA (ψ)=1, or VA (φ)=# and VA (ψ)=# iv) VA (φ→ψ) =  0 VA (φ)=1 and VA (ψ)=0 # otherwise  

 v) VA (∼φ) =

 1 if VA (φ)=0 0 if VA (φ)=1  # otherwise

Let’s keep the definitions of validity and semantic consequence from before. Thus, φ is a valid formula iff it is true no matter what truth values its sentence letters take on. More formally: φ is valid iff for every trivalent assignment A, VA (φ)=1. φ is a semantic consequence of Γ iff φ is true whenever all the members of Γ are true — that is, iff for each trivalent assignment, if the valuation for that assignment assigns 1 to each member of Γ then it also assigns 1 to φ. So now, there are two ways a formula could fail to be valid. It could be 0 under some PL-valuation, or it could be # under some PL-valuation. “Valid formula” (as I’ve defined it) means always true; it does not mean never false. (A formula could be never false and still not always true, if it sometimes is #.) Example: is P ∨∼P valid? Answer: no, it isn’t. Suppose P is #. Then ∼P is #; but then the whole thing is # (since #∨# is #.) Example: is P →P valid? Answer: yes. P could be either 1, 0 or #. From the truth table for →, we see that P →P is 1 in all three cases.

3.3.2

Kleene’s “strong” tables

This system is like Łukasiewicz’s system, except that the truth table for the → is different:

CHAPTER 3. VARIATIONS AND DEVIATIONS FROM PL → 1 0 #

1 1 1 1

0 0 1 #

49

# # 1 #

Here is the intuitive idea behind the Kleene tables. Let’s call the truth values 0 and 1 the “classical” truth values. If a formula’s halves have only classical truth values, then the truth value of the whole formula is just the classical truth value determined by the classical truth values of the halves. But if one or both halves are #, then we must consider the result of turning each # into one of the classical truth values. If the entire formula would sometimes be 1 and sometimes be 0 after doing this, then the entire formula is #. But if the entire formula always takes the same truth value, X, no matter which classical truth value any #s are turned into, then the entire formula gets this truth value X. Intuitively: if there is “enough information” in the classical truth values of a formula’s parts to settle on one particular classical truth value, then that truth value is the formula’s truth value. Take the truth table for φ→ψ, for example. When φ is 0 and ψ is #, the whole formula is 1 — because the false antecedent is sufficient to make the whole formula true, no matter what classical truth value we convert ψ to. On the other hand, when φ is 1 and ψ is #, then the whole formula is #. The reason is that what classical truth value we substitute in for ψ’s # affects the truth value of the whole. If the # becomes a 0 then the whole thing is 0; but if the # becomes a 1 then the whole thing is 1. There are two important differences between Łukasiewicz’s and Kleene’s systems. The first is that, unlike Łukasiewicz’s system, Kleene’s system makes the formula P →P invalid. The reason is that in Kleene’s system, #→# is #; thus, P →P isn’t true in all valuations (it is # in the valuation where P is #.) In fact, it’s easy to prove that there are no valid formulas in Kleene’s system. Consider the valuation that makes every sentence letter #. Here’s an inductive proof that every wff is # in this interpretation. Base case: all the sentence letters are # in this interpretation. (That’s obvious.) Inductive case: assume that φ and ψ are both # in this interpretation. We need now to show that φ∧ψ, φ∨ψ, and φ→ψ are all # in this interpretation. But that’s easy — just look at the truth tables for ∧, ∨ and →. #∧# is #, #∨# is #, and #→# is #. QED. Even though there are no valid formulas in Kleene’s system, there are still cases of semantic consequence. Let’s consider to understand semantic consequence as we did above: Γ φ iff φ is true whenever every member of Γ is true.


50

Then in Kleene’s system (and all the other systems we’ll consider), P ∧Q P . That’s because the definition of this is that P is true in every valuation in which P ∧Q is true. But the only way for P ∧Q to be true is for P to be true and Q to be true. The second (related) difference is that in Kleene’s system, → is interdefinable with the ∼ and ∨, in that φ→ψ has exactly the same truth table as ∼φ∨ψ. (Look at the truth tables to verify that this is true.) But that’s not true for Łukasiewicz’s system. In Łukasiewicz’s system, when φ and ψ are both #, then φ→ψ is 1, but ∼φ∨ψ is #.

3.3.3

Kleene’s “weak” tables (Bochvar’s tables)

This final system has a very different intuitive idea: that # is “infectious”. That is, if any formula has a part that is #, then the entire formula is #. Thus, the tables are as follows: ∼ 1 0 0 1 # #

∧ 1 0 #

1 1 0 #

0 0 0 #

# # # #

∨ 1 0 #

1 1 1 #

0 1 0 #

# # # #

→ 1 0 #

1 1 1 #

0 0 1 #

# # # #

So basically, the classical bit of each truth table is what you’d expect; but everything gets boring if any constituent formula is a #. One way to think about these tables is to think of the # as indicating nonsense. The sentence “The sun is purple and blevledgekl;rz”, one might naturally think, is neither true nor false because it is nonsense. It is nonsense even though it has a part that isn’t nonsense.

3.3.4

Supervaluationism

Recall the guiding thought behind the strong Kleene tables: if a formula’s classical truth values fix a particular truth value, then that is the value that the formula takes on. There is a way to take this idea a step further, which results in a new and interesting way of thinking about three-valued logic. According to the strong Kleene tables, we get a classical truth value for φ ψ, where is any connective, only when we have “enough classical information” in the truth values of φ and ψ to fix a classical truth value for φ ψ. Consider φ∧ψ for example: if either φ or ψ is false, then since


51

falsehood of a conjunct is classically sufficient for the falsehood of the whole conjunction, the entire formula is false. But if, on the other hand, both φ and ψ are #, then neither φ nor ψ has a classical truth value, we do not have enough classical information to settle on a classical truth value for φ∧ψ, and so the whole formula is #. But now consider a special case of the situation just considered, where φ is P , ψ is ∼P , and P is #. According to the strong Kleene tables, the conjunction P ∧∼P is #, since it is the conjunction of two formulas that are #. But there is a way of thinking about truth values of complex sentences according to which the truth value ought to be 0, not #: no matter what classical truth value P were to take on, the whole sentence P ∧∼P would be 0 — therefore, one might think, P ∧∼P ought to be 0. If P were 0 then P ∧∼P would be 0∧∼0 — that is 0; and if P were 1 then P ∧∼P would be 1∧∼1 — 0 again. The general thought here is this: suppose a sentence φ contains some sentence letters P1 . . . Pn that are #. If φ would be false no matter how we assign classical truth values to P1 . . . Pn — that is, no matter how we precisified φ — then φ is in fact false. Further, if φ would be true no matter how we precisified it, then φ is in fact true. But if precisifying φ would sometimes make it true and sometimes make it false, then φ in fact is #. The idea here can be thought of as an extension of the idea behind the strong Kleene tables. Consider a formula φ ψ, where is any connective. If there is enough classical information in the truth values of φ and ψ to fix on a particular classical truth value, then the strong Kleene tables assign φ ψ that truth value. Our new idea goes further, and says: if there is enough classical information within φ and ψ to fix a particular classical truth value, then φ ψ gets that truth value. Information “within” φ and ψ includes, not only the truth values of φ and ψ, but also a certain sort of information about sentence letters that occur in both φ and ψ. For example, in P ∧∼P , when P is #, there is insufficient classical information in the truth values of P and of ∼P to settle on a truth value for the whole formula P ∧∼P (since each is #). But when we look inside P and ∼P , we get more classical information: we can use the fact that P occurs in each to reason as we did above: whenever we turn P to 0, we turn ∼P to 1, and so P ∧∼P becomes 0; and whenever we turn P to 1 we turn ∼P to 0, and so again, P ∧∼P becomes 0. This new idea — that a formula has a classical truth value iff every way of precisifying it results in that truth value — is known as supervaluationism. Let us lay out this idea formally.


52

As above, a trivalent assignment is a function that assigns to each sentence letter one of the values 1, 0, #. Where A is a trivalent assignment and C is a PL- assignment (i.e., a bivalent assignment in the sense of section 2.3), say that C is a precisification of A iff: whenever A assigns a sentence letter a classical value (i.e., 1 or 0), C assigns that sentence letter the same classical value. Thus, precisifications of A agree with A on the classical truth values, but in addition — being classical assignments — they also assign classical truth values to sentence letters to which A assigns #. A given precisification of A “decides” all of A’s #s in a certain way. We can now say how the supervaluationist assigns truth values to complex formulas relative to a valuation. When φ is any wff and A is a trivalent assignment, let us define SA (φ) — the “supervaluation of φ relative to A — thus: SA (φ) = 1 if VC (φ) = 1 for every precisification, C, of A SA (φ) = 0 if VC (φ) = 0 for every precisification, C, of A SA (φ) = # otherwise Note the appeal here to VC , the valuation for PL-assignment C, as defined in section 2.3. Some common terminology: when SA (φ)=1, we say that φ is supertrue in A, and when SA (φ)=0, we say that φ is superfalse in A. For the supervaluationist, a formula is true when it is supertrue (i.e., true in all precisifications of A), false when it is superfalse (i.e., false in all precisifications of A), and # when it is neither supertrue nor superfalse (i.e., when it is true in some precisifications of A but false in others.) To return to the example considered above: the supervaluationist assigns a different truth value to P ∧∼P , when P is #, than do the strong Kleene tables (and indeed, than do all the other tables we have considered.) The strong Kleene tables say that P ∧∼P is # in this case. But the supervaluationist says that it is 0: each precisification of any trivalent assignment that assigns P # is by definition a PL-assignment, and P ∧∼P is 0 in each PL-assignment. Let us note a few interesting facts about supervaluationism. First, note that every classical tautology turns out to be supertrue in every valuation. For let A be any trivalent assignment and let φ be a tautology. By the definition of supertruth, φ is supertrue iff φ is true in every precisification of A. But precisifications are PL-assignments, and the definition of a tautology


53

is a formula that is true in every PL-assignment. Similar reasoning shows that if φ is false in every PL-assignment, then φ is superfalse. Second, note that according to supervaluationism, some formulas are nevertheless neither true nor false in some valuations. For instance, take the formula P ∧Q, in any valuation V in which P is 1 and Q is #. Any precisification of V must continue to assign P 1. But some will assign 1 to Q, whereas others will assign 0 to Q. Any of the former precisifications will assign 1 to P ∧Q, whereas any of the latter will assign 0 to P ∧Q. Hence P ∧Q is neither supertrue nor superfalse in V — SV (P ∧Q) = #. Finally, notice that the propositional connectives are not truth functional according to supervaluationism. To say that a connective is truth functional is to say that the truth value5 of a complex statement whose major connective is is a function of the truth values of the immediate constituents of that formula — that is, any two such formulas whose immediate constituents have the same true values must themselves have the same truth value. According to all of the truth tables for three-valued logic we considered earlier (Łukasiewicz, Kleene strong and weak), the propositional connectives are truth-functional. Indeed, this is in a way trivial: if a connective isn’t truth-functional then one can’t give it a truth table at all: what a truth table does is specify how a connective determines the truth value of entire sentences as a function of the truth values of its parts. But supervaluationism renders the truth functional connectives not truth functional. Consider the following pair of sentences, in a valuation in which P and Q are both #: P ∧Q P ∧∼P As we have seen, in such valuations, the first formula is # and the second formula is 0 (since it is superfalse). But each of these formulas is a conjunction, each of whose conjuncts is #: the truth values of φ and ψ do not determine the truth value of φ∧ψ. Similarly, the truth values of other complex formulas are not determined by the truth values of their parts, as the following pairs of formulas show (the indicated truth values, again, are relative to a valuation in which P and Q are #): P ∨Q # P →Q # P ∨∼P 1 P →P 1 5

I am counting #, in addition to 1 and 0, as a “truth value”.


3.4

54

Intuitionism

Intuitionism in the philosophy of mathematics is a view according to which there are no mind-independent mathematical facts. Rather, mathematical facts and entities are mental constructs that owe their existence to the mental activity of mathematicians constructing proofs. This philosophy of mathematics then leads them to a distinctive form of logic: intuitionist logic. Let P be the statement: The sequence 0123456789 occurs somewhere in the decimal expansion of π. How should we think about its meaning? For the classical mathematician, the answer is straightforward. P is a statement about a part of mathematical reality, namely, the infinite decimal expansion of π. Either the sequence 0123456789 occurs somewhere in that expansion, in which case P is true, or it does not, in which case P is false and ∼P is true. For the intuitionist, this whole picture is mistaken, premised as it is on the reality of an infinite decimal expansion of π. Our minds are finite, and so only the finite initial segment of π’s decimal expansion that we have constructed so far is real. The intuitionist’s alternate picture of P ’s meaning, and indeed of meaning generally (for mathematical statements) is a radical one.6 The classical mathematician, comfortable with the idea of a realm of mindindependent entities, thinks of meaning in terms of truth and falsity. As we saw, she thinks of P as being true or false depending on the facts about π’s decimal expansion. Further, she explains the meanings of the propositional connectives in truth-theoretic terms: a conjunction is true iff each of its conjuncts are true; a negation is true iff the negated formula is false; and so on. Intuitionists, on the other hand, reject the centrality of truth to meaning, since truth is tied up with the rejected picture of mind-independent mathematical reality. For them, the central semantic concept is that of proof. They simply do not think in terms of truth and falsity; in matters of meaning, they think in terms of the conditions under which formulas have been proved. Take P , for example. Intuitionists advise us: don’t think in terms of what it would take for P to be true. Think, rather, in terms of what it would take to prove P . And the answer is clear: we would need to actually continue our construction of the decimal expansion of π to a point where we found the sequence 0123456789. What, now, of ∼P ? Again, thinking in terms of proof, not truth: what 6

One intuitionist picture, anyway, on which see Dummett (1973). What follows is a crude sketch. It does not do justice to the actual intuitionist position, which is, as they say, subtle.


55

would it take for ∼P to be proved? The answer here is less straightforward. Since P said that there exists a number of a certain sort, it was clear how it would have to be proved: by actually exhibiting (calculating) some particular number of that sort. But ∼P says that there is no number of a certain sort; how do we prove something like that? The intuitionist’s answer: by proving that the assumption that there is a number of that sort leads to a contradiction. In general, a negation, ∼φ, is proved by proving that φ leads to a contradiction.7 Similarly for the other connectives: the intuitionist explicates their meanings by their role in generating proof conditions, rather than truth conditions. φ∧ψ is proved by separately giving a proof of φ and a proof of ψ; φ∨ψ is proved by giving either a proof of φ or a proof of ψ; φ→ψ is proved by exhibiting a construction whereby any proof of φ can be converted into a proof of ψ. Likewise, the intuitionist thinks of logical correctness as the preservation of provability, not the preservation of truth. For example, φ∧ψ logically implies φ because if one has a proof of φ∧ψ, then one has a proof of φ; and conversely, if one has proofs of φ and ψ separately, then one has the materials for a proof of φ∧ψ. So far, so classical. But ∼∼φ does not logically imply φ, for the intuitionist. Simply having a proof of ∼∼P — a proof that the assumption that 0123456789 occurs nowhere in π’s decimal expansion leads to a contradiction — wouldn’t give us a proof of P , since proving P would require exhibiting a particular place in π’s decimal expansion where 0123456789 occurs. Likewise, intuitionists do not accept the law of the excluded middle, φ∨∼φ, as a logical truth. To be a logical truth, a sentence should be provable from no premises whatsoever. But to prove P ∨∼P , for example, would require either exhibiting a case of 0123456789 in π’s decimal expansion, or proving that the assumption that 0123456789 occurs in π’s decimal expansion leads to a contradiction. We’re not in a position to do either. Though we won’t consider intuitionist predicate logic, one of its most striking features is easy to grasp informally. Intuitionists say that an existentially quantified sentence is proved iff one of its instances has been proved. Therefore they reject the inference from ∼∀xF x to ∃x∼F x, for one might be able to prove a contradiction from the assumption of ∀xF x without being able to prove any instance of ∃x∼F x. We have so far been considering a putative philosophical justification for intuitionist propositional logic. That justification has been rough and ready; 7

Given the contrast with the classical conception of negation, a different symbol (often “¬”) is sometimes used for intuitionist negation.


56

but intuitionist propositional logic itself is easy to present, perfectly precise, and is a coherent system regardless of what one thinks of its philosophical underpinnings. Two simple modifications to the natural deduction system of chapter 2.5 generate intuitionistic propositional logic. First, we drop one half of double-negation, namely what we might call “double-negation elimination” (DNE): Γ ` ∼∼φ Γ`φ Second, we add the rule “ex falso” (EF): Γ ` φ∧∼φ Γ`ψ Note that EF can be proved in the original system of chapter 2.5: simply use RAA and then DNE. So, intuitionist logic results from a system for classical logic by simply dropping one rule (DNE) and adding another rule that was previously provable (EF). It follows that every intuitionistically provable sequent is also classically provable (because every intuitionistic proof can be converted to a classical proof). Notice how dropping DNE blocks proofs of various classical theorems the intuitionist wants to avoid. The proof of ∅ ` P ∨∼P in chapter 2.5, for instance, used DNE. Of course, for all we’ve said so far, there might be some other way to prove this sequent. Only when we have a semantics for intuitionistic logic, and a soundness proof relative to that semantics, can we show that this sequent cannot be proven without DNE. We will discuss a semantics for intuitionism in section 7.2. It is interesting to note that even though intuitionists reject the inference from ∼∼P to P , they accept the inference from ∼∼∼P to ∼P , since its proof only requires the half of DN that they accept, namely the inference from P to ∼∼P : 1 2 2 1,2 1

(1) (2) (3) (4) (5)

∼∼∼P P ∼∼P ∼∼P ∧ ∼∼∼P ∼P

As As (for reductio) 2, DN (accepted version) 1,3 ∧I 4, RAA


57

Note that you can’t use this sort of proof to establish ∼∼P ` P . Given the way RAA is stated, its application always results in a formula beginning with the ∼.

Chapter 4 Predicate Logic et’s now turn from propositional to predicate logic. We’re going to do the same thing we did for propositional logic: formalize predicate logic. We’ll first do grammar. One would normally then go on to define theoremhood, using axioms and rules.1 But we’ll skip that bit; we’ll go straight to semantics — we’ll define validity.

L 4.1

Grammar of predicate logic

As before, we start by specifying the kinds of symbols that may be used in sentences of predicate logic — primitive vocabulary — and then go on to define the well formed formulas as strings of primitive vocabulary that have the right form. Primitive vocabulary: i) logical: →, ∼, ∀ ii) nonlogical: a) for each n > 0, n-place predicates F , G . . ., with or without subscripts b) variables x, y . . . with or without subscripts c) individual constants (names) a, b . . ., with or without subscripts 1

There are, in fact, axiom systems for (first-order) predicate logic that are sound and complete with respect to the semantics I will go on to give.

58

CHAPTER 4. PREDICATE LOGIC

59

iii) parentheses No symbol of one type is a symbol of any other type. Let’s call any variable or constant a term. Definition of wff: i) if Π is an n-place predicate and α1 . . . αn are terms, then Πα1 . . . αn is a wff ii) if φ, ψ are wffs, and α is a variable, then ∼φ, (φ→ψ), and ∀αφ are wffs iii) nothing else is a wff. We’ll call formulas that are wffs in virtue of clause i) “atomic” formulas. When a formula has no free variables, we’ll say that it is a closed formula, or sentence; otherwise it is an open formula. We have the same defined logical terms: ∧, ∨, ↔. We also add the following definition of the existential quantifier: ∃vφ =d f ∼∀α∼φ

(where α is a variable and φ is a wff).

We won’t give any definition of ‘theorem’, but rather move straight to semantics.

4.2

Set theory2

First, though, a digression. We’ll need to talk a lot about sets, so I want to make some introductory remarks about set theory. Sets have members. For example, we may speak of the set of people, the set of cities, the set of real numbers, etc. There is also the empty set: the one set with no members. Though the notion of a set is an intuitive one, it is deeply perplexing. This can be seen by reflecting on the Russell Paradox, discovered by Bertrand Russell, the great philosopher and mathematician. Let us call R the set of all and only those sets that are not members of themselves. For short, R is the set of nonself-members. Russell asks the following question: is R a member of itself? There are two possibilities: 2

Supplementary reading: the beginning of Enderton (1977)


60

i) R ∈ / R. Thus, R is a non-self-member. But R was said to be the set of all non-self-members, and so we’d have R ∈ R. Contradiction. ii) R ∈ R. So R is not a non-self-member. R, by definition, contains only non-self-members. So R ∈ / R. Contradiction. Thus, each possibility leads to a contradiction. But there are no remaining possibilities — either R is a member of itself or it isn’t! So it looks like the very idea of sets is paradoxical. The modern discipline of axiomatic set theory arose in part to develop a notion of sets that isn’t subject to this sort of paradox. This is done by imposing rigid restrictions on when a given “condition” picks out a set. In the example above, the condition “is a non-self-member” will be ruled out — there’s no set of all and only the things satisfying this condition. The specifics of set theory are beyond the scope of this course; for our purposes, we’ll help ourselves to the existence of sets, and not worry about exactly what sets are, or how the Russell paradox is avoided. There are some common notions of sets we’ll need. We say that A is a subset of B (“A ⊆ B”) when every member of A is a member of B. We say that the intersection of A and B (“A ∩ B”) is the set that contains all and only those things that are in both A and B, and that the union of A and B (“A ∪ B”) is the set containing all and only those things that are members of either A or B. Suppose we want to refer to the set of the so-and-sos — that is, the set containing all and only objects, u, that satisfy the condition “so-and-so”. We’ll do this with the term “{u: u is a so-and-so}”. With this locution, we can restate the definitions of ∩ and ∪ from the previous paragraph as follows: A ∩ B =d f {u : u ∈ A and u ∈ B} A ∪ B =d f {u : u ∈ A or u ∈ B} We’ll need more than just sets — we’ll need ordered pairs.3 Why? Well, you may recall that when we specify a set, we don’t need to specify any particular order An aside: there’s a trick for “reducing” talk of ordered pairs to talk of sets; define 〈u, v〉 as the set {{u},{u, v}}. The trick is that we put the set together in such a way that we can look at the set and tell what the first member of the ordered pair is: it’s the one that “appears twice”. And one can go on to reduce talk of ordered triples, ordered quadruples, etc., to talk of ordered pairs. But the technicalities of these reductions won’t matter for us; I’ll just feel free to go on speaking of ordered pairs, triples, etc. 3


61

of the members. For example, the set containing me and Bill Clinton doesn’t have a “first” member. This is reflected in the fact that “{Ted, Clinton}” and “{Clinton, Ted}” are two different names for the same set — the set containing just Clinton and Ted. But sometimes, we have the need to talk about a set-like thing containing Clinton and Ted, but in a certain order. For this purpose, logicians use ordered pairs. To name the ordered pair of Clinton and Ted, we use: “〈Clinton, Ted〉”. Here, the order is significant, for 〈Clinton, Ted〉 and 〈Ted, Clinton〉 are not the same thing. Similarly, we have ordered triples 〈u, v, w〉, and in general, ordered n-tuples 〈u1 , . . . , un 〉, for any natural number n. Let’s even allow 1-tuples: let’s define the 1-tuple 〈u〉 as being the object u itself.

4.3

Semantics of predicate logic

The semantic definition of validity, intuitively, says that a sentence is valid if it is “true no matter what”. In propositional logic, we cashed out “true no matter what” using valuations. A valuation function was thought of as a possibility, since a valuation assigns either true or false to each sentence letter. Then we defined truth-in-a-valuation. So that means we could think of truth-in-allvaluations as “truth in all possibilities” — i.e., truth no matter what. This procedure needs to get more complicated for the predicate “calculus” (PC), as it is sometimes called. The reason is that the method of truth tables assumes that we can calculate the truth value of a complex formula by looking at the truth values of its parts. But take the sentence ∃x(F x∧Gx). You can’t calculate its truth value by looking at the truth values of F x and Gx, since sentences like F x don’t have truth values. The letter ‘x’ doesn’t stand for any one thing; it’s a variable; so ‘F x’ doesn’t have a truth value. The following is called “Tarski-style” semantics for PC, in honor of Alfred Tarski who made it up (actually, he made something like it up). It gives an alternate definition of “true no matter what” — true in all models: A (PC-) model is an ordered pair 〈D,I〉, such that: i) D is a non-empty set ii) I is a function such that: a) if α is a constant then I(α) ∈ D


62

b) if Π is an n-place predicate, then I(Π) = some set of ntuples of members of D. (An “n-tuple” is an ordered set of n objects. Ordinary sets are unordered — the set {u, v} is just the same as the set {v, u}; the order doesn’t matter. But the ordered set 〈u, v〉 is not the same as the ordered set 〈v, u〉, because the order of u and v is different.) Think of a model as a possible world. The model is based on D, its domain. D contains, intuitively, the individuals that exist in the possibility. I is the interpretation function, which tells us what the non-logical constants (names and predicates) mean in the possibility. I assigns to each constant (“name”) a member of the domain — its denotation. For example, if the domain is the set of persons, then the name ‘a’ might be assigned me. One-place predicates get assigned sets of 1-tuples of D — that is, just sets of members of D. So, a one-place predicate ‘F ’ might get assigned a set of persons. That set is called the “extension” of the predicate — if the extension is the set of males, then the predicate ‘F ’ might be thought of as symbolizing “is male”. Two-place predicates get assigned sets of ordered pairs of members of D — that is, binary relations over the domain. If a two place predicate ‘R’ is assigned the set of persons 〈u, v〉 such that u is taller than v, we might think of ‘R’ as symbolizing “is taller than”. Similarly, three-place predicates get assigned sets of ordered triples… Relative to any PC-model 〈D,I〉, we want to define the notion of truth in a model — the corresponding valuation function. But we’ll need some apparatus first. It’s pretty easy to see what truth value a sentence like F a should have. I assigns a member of the domain to a — call that member u. I also assigns a subset of the domain to F — let’s call that subset S. The sentence F a should be true iff u ∈ S — that is, iff the referent of a is a member of the extension of F . That is, F a should be true iff I(a)∈I(F ). Similarly, Rab should be true iff 〈I(a),I(b )〉 ∈ I(R). And so on. As before, we can give recursive clauses for the truth values of negations and conditionals. φ→ψ, for example, will be true iff either φ is false or ψ is true. But this becomes tricky when we try to specify the truth value of ∀xF x. It should, intuitively, be true if and only if ‘F x’ is true, no matter what we put in in place of ‘x’. But this is vague. Do we mean “whatever name (constant) we put in place of ‘x”’? No, because we don’t want to assume that we’ve got a name for everything in the domain, and what if F x is true for all the objects we


63

have names for, but false for one of the nameless things! Do we mean, “true no matter what object from the domain we put in place of ‘x”’? No; objects from the domain aren’t part of our primitive vocabulary, so the result of replacing ‘x’ with an object from the domain won’t be a formula!4 Tarski’s solution to this problem goes as follows. Initially, we don’t consider truth values of formulas absolutely. Rather, we let the variables refer to certain things in the domain temporarily. Then, we’ll say that ∀xF x will be true iff for all objects u in the domain D: F x is true while x temporarily refers to u. We implement this idea of temporary reference by defining the notion of a variable assignment: g is a variable assignment for model 〈D,I〉 iff g is a function that assigns to each variable some object in D. The variable assignments give the “temporary” meanings to the variables; when g (x) = u, then u is the temporary denotation of x. We need a further bit of notation. Let u be some object in D, let g be some variable assignment, and let α be a variable. We then define “g u/α ” to be the variable assignment that is just like g , except that it assigns u to α. (If g already assigns u to α then g u/α will be the same function as g .) Note the following important fact about variable assignments: g u/α , when applied to α, must give the value u. (Work through the definitions to see that this is so.) That is: g u/α (α) = u One more bit of apparatus. Given any model M (=〈D,I〉), and given any variable assignment, g , and given any term (i.e., variable or name) α, we define the denotation of α, relative to M and g , “[α]M,g ” as follows: [α]M, g =I(α) if α is a constant, and [α]M,g = g (α) if α is a variable. The subscripts M and g on [ ] indicate that denotations are assigned relative to a model (M), and relative to a variable assignment (g ). Now we are ready to define the valuation function, which assigns truth values relative to variable assignments. (Relativization to assignments is necessary 4

Unless the domain happens to contain members of our primitive vocabulary!


64

because, as we noticed before, F x doesn’t have a truth value absolutely. It only has a truth value relative to an assigned value to the variable x — i.e., relative to a choice of an arbitrary denotation for x.) The valuation function, VM, g , for model M (=〈D,I〉) and variable assignment g , is defined as the function that assigns to each wff either 0 or 1 subject to the following constraints: i) for any n-place predicate Π and any terms α1 …αn , VM,g (Πα1 …αn ) =1 iff 〈[α1 ]M,g …[αn ]M,g 〉 ∈ I(Π) ii) for any wffs φ, ψ, and any variable α: a) VM,g (∼φ)=1 iff VM, g (φ)=0 b) VM,g (φ→ψ)=1 iff either VM,g (φ)=0 or VM,g (ψ)=1 c) VM,g (∀αφ)=1 iff for every u ∈ D, VM, gu/α (φ)=1 (In understanding clause i), recall that the one tuple containing just u, 〈u〉 is just u itself. Thus, in the case where Π is F , some one place predicate, clause i) says that VM,g (F α)=1 iff [α]M,g ∈ I(F ).) So far we have defined the notion of truth in a model relative to a variable assignment. But what we really want is a notion of truth in a model, period — that is, absolute truth in a model. (We want this because we want to define, e.g., a valid formula as one that is true in all models.) So, let’s define absolute truth in a model in this way: φ is true in M =d f VM, g (φ)=1, for each variable assignment g It might seem that this is too strict a requirement — why must φ be true relative to each variable assignment? But in fact, it’s not too strict at all. The kinds of formulas we’re really interested in are formulas without free variables (we’re interested in formulas like F a, ∀xF x, ∀x(F x→Gx); not formulas like F x, ∀xRxy, etc.). And if a formula has no free variables, then if there’s even a single variable assignment relative to which it is true, then it is true relative to every variable assignment. (And so, we could just as well have defined truth in a model as truth relative to some variable assignment.) I won’t prove this fact, but it’s not too hard to prove; one would simply need to prove (by induction) that, for any wff φ, if variable assignments g and h agree on all variables free in φ, then VM,g (φ)=VM,h (φ). Now we can go on to give semantic definitions of the other core logical notions:


65

φ is valid (“ φ”) iff φ is true in all PC-models φ is a semantic consequence of Γ (“Γ φ”) iff for every model M, if each member of Γ is true in M then φ is also true in M Since our new definition of the valuation function treats the propositional connectives → and ∼ in the same way as the propositional logic valuation did, it’s easy to prove that it also treats the defined connectives ∧, ∨, and ↔ in the same way: VM, g (φ∧ψ)=1 iff VM,g (φ)=1 andVM,g (ψ)=1 VM,g (φ∨ψ)=1 iff VM,g (φ)=1 or VM,g (ψ)=1 VM,g (φ↔ψ)=1 iff VM, g (φ) = VM,g (ψ) Moreover, we can also prove that the valuation function treats ∃ as it should (given its intended meaning): VM, g (∃αφ)=1 iff there is some u ∈ D such that VM,gu/α (φ)=1 This can be established as follows: The definition of ∃αφ is: ∼∀α∼φ. So, we must show that for any model, and any variable assignment g based on that model, VM, g (∼∀α∼φ)=1 iff there is some u ∈ D such that VM,gu/α (φ)=1. (In arguments like these, I’ll sometimes stop writing the subscript M in order to reduce clutter. It should be obvious from the context what the relevant model is.) Here’s the argument: • Vg (∼∀α∼φ)=1 iff Vg (∀α∼φ)=0 (given the clause for ∼ in the definition of the valuation function) • But, Vg (∀α∼φ)=0 iff for some u ∈ D, Vgu/α (∼φ)=0 • Given the clause for ∼, this can be rewritten as: … iff for some u ∈ D, Vgu/α (φ)=1


4.4

66

Establishing validity and invalidity

Given our definitions, we can establish that particular formulas are valid. For example, let’s show that ∀xF x→F a is valid; that is, let’s show that for any model 〈D,I〉, and any variable assignment g , Vg (∀xF x→F a)=1. • Suppose otherwise; then Vg (∀xF x) = 1 and Vg (F a) = 0. • Given the latter, that means that [a] g ∈ / I(F ) — that is, I(a) ∈ / I(F ). • Given the former, for any u ∈ D, Vgu/x (F x) = 1. • I(a) ∈ D, and so VgI(a)/x (F x) = 1. • By the truth condition for atomics, [x] gI(a)/x ∈ I(F ). • By the definition of the denotation of a variable, [x] gI(a)/x = gI(a)/x (x) • but gI(a)/x (x) = I(a). Thus, I(a) ∈ I(F ). Contradiction Notice a couple things about this proof. Note that I claimed that I(a)∈D; this comes from the definition of an interpretation function: the interpretation of a constant is always a member of the domain. Second, notice that “I(a)” is a term of our metalanguage; that’s why, when I’m given that “for any u in D”, I can set u equal to I(a). In general, to show that a formula is valid, what you need to do is reason informally, in the metalanguage, using ordinary, informal, mathematically acceptable patterns of reasoning. We’ve seen how to establish that particular formulas are valid. How do we show that a formula is invalid? We need to simply exhibit a single model in which the formula is false. (The definition of validity specifies that a valid formula is true in all models; therefore, it only takes one model in which a formula is false to make that formula invalid.) So let’s take one example; let’s show that the formula (∃xF x∧∃xGx)→∃x(F x∧Gx) isn’t valid. To do this, we must produce a model in which this formula is false. All we need is a single model, since in order for the formula to be valid, it must be true in all models. My model will contain numbers in its domain: D={0,1}


67

I(F )={0} I(G)={1} It is intuitively clear that the formula is false in this model. In this model, something has F (namely, 0), and something has G (namely, 1), but nothing has both.

Chapter 5 Extensions of Predicate Logic he predicate logic we considered in the previous chapter is powerful. Much natural language discourse can be represented using it, in a way that reveals logical structure. Nevertheless, it has its limitations. In this chapter we consider some of its limitations, and corresponding additions to predicate logic.

T 5.1

Identity

“Standard” predicate logic is usually taken to include the identity sign (“=”). “a=b ” means that a and b are one and the same thing.

5.1.1

Grammar for the identity sign

We first need to expand our definition of a well-formed formula. We simply add the following clause: If α and β are terms, then α=β is a wff We need to beware of a potential source of confusion. We’re now using the symbol ‘=’ as the object-language symbol for identity. But I’ve also been using ‘=’ as the metalanguage symbol for identity, for instance when I write things like “V(φ)=1”. This shouldn’t generally cause confusion, but if there’s a danger of misunderstanding, I’ll write in the metalanguage “is” or “is the same object as” or something like that, instead of ‘=’.

68

CHAPTER 5. EXTENSIONS OF PREDICATE LOGIC

5.1.2

69

Semantics for the identity sign

We also need to add to our definition of truth-in-a-model; we need to add a clause to the definition of a valuation function telling it what truth values it should give sentences containing the = sign. Here is the clause: VM, g (α=β) = 1 iff [α]M,g is the same object as [β]M,g We can then use this clause in establishing the validity and invalidity of formulas. For example, let’s show that the formula ∀x∃y x=y is valid: • We need to show that in any model, and any variable assignment g in that model, Vg (∀x∃y x=y) = 1. So, suppose for reductio that for some g in some model, Vg (∀x∃y x=y) = 0. • Given the clause for ∀, for some object in the domain, call it “u”, Vgu/x (∃y x=y) = 0. • Given the clause for ∃, for every v in the domain, Vgu/x v/y (x=y) =0. • Letting v be u, we have: Vgu/x u/y (x=y) = 0. • So, given the clause for “=”, [x] gu/x u/y is not the same object as [y] gu/x u/y • but [x] gu/x u/y and [y] gu/x u/y are the same object. [x] gu/x u/y is g u/x u/y (x), i.e., u; and [y] gu/x u/y is g u/x u/y (y), i.e., u.

5.1.3

Translations with the identity sign

Why do we ever add anything to our list of logical constants? Why not stick with the tried and true logical constants of propositional and predicate logic? We generally add a logical constant when it has a distinctive inferential and semantic role, and when it has very general application — when, that is, it occurs in a wide range of linguistic contexts. We studied the distinctive semantic role of ‘=’ in the previous section. In this section, we’ll look at the range of linguistic contexts that can be symbolized using ‘=’. The most obvious sentences that may be symbolized with ‘=’ are those that explicitly concern identity, such as: Mark Twain is identical to Samuel Clemens t =c Every man fails to be identical to George Sand ∀x(M x→∼x=s)


70

(It will be convenient to abbreviate ∼α=β as α 6= β. Thus, the second symbolization can be rewritten as: ∀x(M x→x 6= s).) But many other sentences involve the concept of identity in subtler ways. Consider, for example, “Every lawyer hates every other lawyer”. The ‘other’ signifies nonidentity; we have, therefore: ∀x(Lx→∀y[(Ly∧x 6= y)→H xy]) Consider next “Only Ted can change grades”. This means: “no one other than Ted can change grades”, and may therefore be symbolized as: ∼∃x(x 6= t ∧C x) (letting ‘C x’ symbolize “x can change grades”.) Another interesting class of sentences concerns number. We cannot symbolize “There are at least two dinosaurs” as: “∃x∃y(D x∧D y)”, since this would be true even if there were only one dinosaur: x and y could be assigned the same dinosaur. The identity sign to the rescue: ∃x∃y(D x∧D y ∧ x 6= y) This says that there are two different objects, x and y, each of which are dinosaurs. To say “There are at least three dinosaurs” we say: ∃x∃y∃z(D x∧D y∧D z∧ x 6= y ∧ x 6= z ∧ y 6= z) Indeed, for any n, one can construct a sentence φn that symbolizes “there are at least n F s”: φn :

∃x1 . . . ∃xn (F x1 ∧ · · · ∧F xn ∧ δ)

where δ is the conjunction of all sentences “xi 6= x j ” where i and j are integers between 1 and n (inclusive) and i < j . (The sentence δ says in effect that no two of the variables x1 . . . xn stand for the same object.) Since we can construct each φn , we can symbolize other sentences involving number as well. To say that there are at most n F s, we write: ∼φn+1 . To say that there are between n and m F s (where m > n), we write: φn ∧∼φ m+1 . To say that there are exactly n F s”, we write: φn ∧∼φn+1 .” These methods for constructing sentences involving number will always work; but one can often construct shorter numerical symbolizations by other methods. For example, to say “there are exactly two dinosaurs”, instead of saying “there are at least two dinosaurs, and it’s not the case that there are at least three dinosaurs”, we could say instead: ∃x∃y(D x∧D y ∧ x 6= y ∧ ∀z[D z→(z=x∨z=y)])


5.2

71

Function symbols

Given our current predicate logic, our symbolizations of the following English sentences are unsatisfactory: 3 is the sum of 1 and 2 a=b George W. Bush’s father was a politician Pb The names in predicate logic stand for English singular noun phrases. Thus, “b ” in the final sentence stands for “George W. Bush’s father”. But this symbolization ignores the fact that the noun phrase “George W. Bush’s father” contains “George W. Bush” as a significant constituent. It treats “George W. Bush’s father” as a black box, so far as logic is concerned. But that’s bad. For example, the following is an intuitively valid inference in English: George W. Bush’s father was a politician Therefore, someone’s father was a politician We should develop a logic that accounts for the validity of this reasoning by “breaking up” noun phrases like “George W. Bush’s father”. To do this, we’ll add function symbols. Think of “George W. Bush’s father” as the result of plugging “George W. Bush” into the blank in “ ’s father”. “ ’s father” is an English function symbol. Function symbols are like predicates in some ways. The predicate “ is happy” has a blank in it, in which you can put a name. “ ’s father” is similar in that you can put a name into its blank. But there is a difference: when you put a name into the blank of a predicate, you get a complete sentence, whereas when you put a name into the blank of “ ’s father”, you get a noun phrase, such as “George W. Bush’s father”. Corresponding to English function symbols, we’ll add logical function symbols. We’ll symbolize “ ’s father” as f ( ). We can put names into the blank here. Thus, we’ll symbolize “George W. Bush’s father” as “ f (a)”, where “a” stands for “George W. Bush”. We need to add two more complications. First, what goes into the blank doesn’t have to be a name — it could be something that itself contains a function symbol. E.g., in English you can say: “George W. Bush’s father’s father”. We’d symbolize this as: f ( f (a)).


72

Second, just as we have multi-place predicates, we have multi-place function symbols. “The sum of 1 and 2” contains the function symbol “the sum of and —”. When you fill in the blanks with the names “1” and “2”, you get the noun phrase “the sum of 1 and 2”. So, we symbolize this using the two-place function symbol, “s( ,—). If we let “a” symbolize “1” and “b ” symbolize “2”, then “the sum of 1 and 2” becomes: s (a, b ). The result of plugging names into function symbols in English is a noun phrase. Noun phrases combine with predicates to form complete sentences. Function symbols function analogously in logic. Once you combine a function symbol with a name, you can take the whole thing, apply a predicate to it, and get a complete sentence. Thus, the sentence: George W. Bush’s father was a politician Becomes: P f (a) And 3 is the sum of 1 and 2 becomes c = s(a, b ) (here “c” symbolizes “3”). We can put variables into the blanks of function symbols, too. Thus, we can symbolize Someone’s father was a politician As ∃xP f (x)

5.2.1

Grammar for function symbols

We need to update our definition of a wff to allow for function symbols. First, we need to add to our vocabulary. So, the new definition starts like this (the new bit is in boldface): Primitive vocabulary:


73

i) logical: →, ∼, ∀ ii) nonlogical: a) for each n > 0, n-place predicates F , G, . . ., with or without subscripts b) for each n > 0, n-place function symbols f , g ,…, with or without subscripts c) variables x, y, . . ., with or without subscripts d) individual constants (names) a, b , . . ., with or without subscripts iii) parentheses The definition of a wff, actually, stays the same; all that needs to change is the definition of a “term”. Before, terms were just names or variables. Now, we need to allow for f (a), f ( f (a)), etc., to be terms. So we need a recursive definition of a term, as follows: Definition of terms i) names and variables are terms ii) if f is an n-place function symbol, and α1 …αn are terms, then f (α1 ,…,αn ) is a term iii) nothing else is a term

5.2.2

Semantics for function symbols

We now need to update our definition of a model by saying what the interpretation of a function symbol is. That’s easy: the interpretation of an n-place function symbol ought to be an n-place function defined on the model’s domain — i.e., a rule that maps any n members of the model’s domain to another member of the model’s domain. For example, in a model in which the one-place function symbol f ( ) is to represent “ ’s father”, the interpretation of f will be the function that assigns to any member of the domain that object’s father. Here’s the general definition of a model: A PC-Model is defined as an ordered pair 〈D,I〉, such that: i) D is a non-empty set


74

ii) I is a function such that: a) if α is a constant then I(α) ∈ D b) if Π is an n-place predicate, then I(Π) = some set of ntuples of members of D. c) If f is an n-place function symbol, then I(f ) is an nplace (total) function defined on D. (“Total” simply means that the function must yield an output for any n members of D.) The definition of a valuation function stays the same; all we need to do is update the definition of denotation to accommodate our new complex terms. Since we now can have arbitrarily long terms (not just names or variables), we need a recursive definition: Definition of denotation in a model M (=〈D, I 〉): i) if α is a constant then [α]M, g is I(α) ii) if α is a variable then [α]M,g is g (α) iii) if α is a complex term f (α1 ,…,αn ), then [α]M,g = I(f )([α1 ]M,g ,…,[αn ]M,g ) Note the recursive nature of this definition: the denotation of a complex term is defined in terms of the denotations of its smaller parts. Let’s think carefully about what clause iii) says. It says that, in order to calculate the denotation of the complex term f (α1 ,…,αn ) (relative to assignment g ), we must first figure out what I( f ) is — that is, what the interpretation function I assigns to the function symbol f . This object, the new definition of a model tells us, is an n-place function on the domain. We then take this function, I( f ), and apply it to n arguments: namely, the denotations (relative to g ) of the terms α1 . . . αn . The result is our desired denotation of f (α1 ,…,αn ). It may help to think about a simple case. Suppose that f is a one-place function symbol; suppose our domain consists of the set of natural numbers; suppose that the name a denotes the number 3 in this model (i.e., I(a) = 3), and suppose that f denotes the successor function (i.e., I( f ) is the function, successor, that assigns to any natural number n the number n + 1.) In that case,


75

the definition tells us that: [ f (a)] g = I( f )([a] g ) = I( f )(I(a)) = successor(3) =4 Here’s a sample metalanguage proof that makes use of the new definitions. Let’s show that the argument considered earlier is a valid argument, when it is symbolized into our new logical language: George W. Bush’s father was a politician Therefore, someone’s father was a politician We need to show that P f (a) ∃xP f (x) — i.e., that in any model in which P f (a) is true, ∃xP f (x) is true: • Suppose that P f (a) is true in a model 〈I, D〉 — i.e., Vg (P f (a)) = 1 (where V is the valuation for this model), for each variable assignment g . • We need to show that Vg (∃xP f (x)) = 1, for each g . • That is, we must show (for an arbitrarily selected g ) that for some object u ∈ D,Vgu/x (P f (x)) = 1, i.e., [ f (x)] gu/x ∈ I(P ). • [ f (x)] gu/x is defined as I( f )([x] gu/x ) (clause for function symbols of the definition of denotation) • But [x] gu/x is just g u/x (x) — i.e., u. • So what we must show is that for some u ∈ D,I( f )(u) ∈ I(P ). – – – –

5.2.3

Well, since Vg (P f (a)) = 1, [ f (a)] g ∈ I(P ). But [ f (a)] g is I( f )([a] g ); and [a] g is just I(a). So I( f )(I(a)) ∈ I(P ). So I(a) is our desired u

Translations with function symbols: some examples

Here are some example translations involving function symbols:


76

Everyone loves his or her father ∀xLx f (x) No one’s father is also his or her mother ∼∃x f (x)=m(x) No one is his or her own father ∼∃x x= f (x) Everyone’s maternal grandfather hates his or her paternal grandmother ∀x H f (m(x)) m( f (x)) Every even number is the sum of two prime numbers ∀x(E x→∃y∃z(P y∧P z∧x=s (y, z)))

5.3

Definite descriptions

Our logic has gotten more powerful with the addition of function symbols, but it still isn’t perfect. Function symbols let us “break up” certain complex noun phrases — e.g., “Bush’s father”. But there are other noun phrases we still can’t break up — e.g., “The black cat”. As it is, we still need to symbolize this as a simple name — “a”. But that leaves out the fact that “the black cat” contain “black” and “cat” as semantically significant constituents. And so it misses the validity of certain inferences. For example, the following is a valid argument: The black cat is happy Therefore, some cat is happy If we symbolized this argument given our current logic, we would get the obviously invalid: Ha Therefore, ∃x(C x∧H x) Here’s how we’ll break up “the black cat”. We’ll introduce a new symbol, ι, to stand for “the”. The function of “the” in English is to turn predicates into noun phrases. “Black cat” is a predicate of English; “the black cat” is a noun phrase that refers to the thing that satisfied the predicate “black cat”. Similarly, in logic, given a predicate F , we’ll let ιxF x be a term that means: the thing that is F .


77

We’ll want to let ιx attach to complex predicates, not just simple predicates. To symbolize “the black cat” — i.e., the thing that is both black and a cat — we want to write: ιx(B x∧C x). In fact, we’ll let ιx attach to wffs with arbitrary complexity. To symbolize “the fireman who saved someone”, we’ll write: ιx(F x∧∃yS xy).

5.3.1

Grammar for ι

Just as with function symbols, we need to add a bit to the primitive vocabulary, and revise the definition of a term. Here’s the new grammar: Primitive vocabulary: i) logical: →, ∼, ∀, ι ii) nonlogical: a) for each n > 0, n-place predicates F , G, . . ., with or without subscripts b) variables x, y, . . ., with or without subscripts c) individual constants (names) a, b , . . ., with or without subscripts Definition of terms and wffs: i) names and variables are terms ii) if φ is a wff and α is a variable then ιαφ is a term iii) if Π is an n-place predicate and α1 …αn are terms, then Πα1 …αn is a wff iv) if φ, ψ are wffs, and α is a variable, then ∼φ, (φ→ψ), and ∀αφ are wffs v) nothing else is a wff or term Notice how we needed to combine the recursive definitions of term and wff into a single recursive definition of wffs and terms together. The reason is that we need the notion of a wff to define what counts as a term containing the ι operator (clause ii); but we need the notion of a term to define what counts as a wff (clause iii). The way we accomplish this is not circular. The reason it isn’t is that we can always decide, using these rules, whether a given string counts as a wff or term by looking at whether smaller strings count as wffs or terms. And the smallest strings are said to be wffs or terms in non-circular ways.


5.3.2

78

Semantics for ι

We need to update the definition of denotation so that ιxφ will denote the one and only thing in the domain that is φ. This is a little tricky, though. What is there is no such thing? Suppose that ‘K’ symbolizes “king of” and ‘a’ symbolizes “USA”. Then, what should ‘ιxK xa’ denote? It is trying to denote the king of the USA, but there is no such thing. Further, what if more than one thing satisfies the predicate? In short, what do we say about “empty descriptions”? One approach would be to say that every atomic sentence with an empty description is false. One way to do this is to include in each model an “emptiness marker”, e, which is an object we assign as the denotation for each empty description. The emptiness marker shouldn’t be thought of as a “real” denotation; when we assign it as the denotation of a description, this just marks the fact that the description has no real denotation. We will stipulate that the emptiness marker is not in the domain; this ensures that it is not in the extension of any predicate, and hence that atomic sentences containing empty descriptions are always false. Here’s how the semantics looks: A PC-Model is defined as an ordered triple 〈D,I, e〉, such that: i) D is a non-empty set ii) e ∈ /D iii) I is a function such that: a) if α is a constant then I(α) ∈ D b) if Π is an n-place predicate, then I(Π) = some set of ntuples of members of D Definition of denotation and valuation: The denotation and valuation functions, [ ]M,g and VM,g , for model M (=〈D,I〉) and variable assignment g , are defined as the functions that satisfy the following constraints: i) VM,g assigns to each wff either 0 or 1 ii) []M, g assigns to each term either e, or a member of D iii) if α is a constant then [α]M,g is I(α) iv) if α is a variable then [α]M,g is g (α)


79

v) if α is a complex term ιβφ, where β is a variable and φ is a wff, then [α]M,g = the unique u ∈ D such that Vgu/β(φ) = 1 if there is a unique such u; otherwise [α]M,g = e vi) for any n-place predicate Π. and any terms α1 , . . . , αn , VM, g (Πα1 . . . αn ) = 1 iff 〈[α1 ]M,g . . . [αn ]M,g 〉 ∈ I(Π) vii) for any wffs φ, ψ, and any variable α: a) VM,g (∼φ)=1 iff VM,g (φ)=0 b) VM,g (φ→ψ)=1 iff either VM,g (φ)=0 or VM,g (ψ)=1 c) VM,g (∀αφ)=1 iff for every u ∈ D, VM,gu/α (φ)=1 (As with the grammar, we need to mix together the definition of denotation and the definition of the valuation function. The reason is that we need to define the denotation of definite descriptions using the valuation function (in clause v), but we need to define the valuation function using the concept of denotation in clause vi. As before, this is not circular.) An alternate approach would appeal to three-valued logic. We could leave the denotation of ιxφ undefined if there is no object in the domain such that φ. We could then treat any atomic sentence that contains a denotationless term as being neither true nor false — i.e., #. We would then need to update the other clauses to allow for #s, perhaps using the Kleene tables, perhaps some other truth tables. I won’t explore this further.

5.3.3

Eliminability of function symbols and definite descriptions

In a sense, we don’t really need function symbols or the ι. Take: The black cat is happy Given the ι, we can symbolize this as H ιx(B x∧C x). But we could symbolize it without the ι as follows: ∃x[ (B x∧C x) ∧ ∀y[(B y∧C y)→y=x] ∧ H x] That is, “there is something such that: i) it is a black cat, ii) nothing else is a black cat, and iii) it is happy”.


80

This method for symbolizing sentences containing ‘the’ is called “Russell’s theory of descriptions”, because Bertrand Russell, the 19th and 20th century philosopher and logician, invented it.1 In general, we have the following rule: “the F is φ” is symbolized: “∃x[F x ∧ ∀y(F y→x=y) ∧ φ] This method can be iterated so as to apply to sentences with two or more definite descriptions, such as: The 8-foot tall man drove the 20-foot long limousine. which becomes, letting ‘E’ stand for ‘is eight feet tall’ and ‘T ’ stand for ‘is twenty feet long’: ∃x[E x∧M x ∧ ∀z([E z∧M z]→x=z) ∧ ∃y[T y∧Ly ∧ ∀z([T z∧Lz]→y=z) ∧D xy]] An interesting problem arises with negations of sentences involving definite descriptions, when we use Russell’s method: The president is not bald. Does this mean: The president is such that he’s non-bald. which is symbolized as follows: ∃x[P x∧∀y(P y→x=y)∧∼B x] ? Or does it mean: It is not the case that the President is bald which is symbolized thus: ∼∃x[P x∧∀y(P y→x=y)∧B x] 1

See Russell (1905).


81

? According to Russell, the original sentence is simply ambiguous. Symbolizing it the first way is called “giving the description wide scope (relative to the ∼)”, since the ∼ is inside the scope of the ∃x. Symbolizing it in the second way is called “giving the description narrow scope (relative to the ∼)”, because the ∃x is inside the scope of the ∼. What is the difference in meaning between these two symbolizations? The first says that there really is a unique president, and adds that he is not bald. So the first implies that there’s a unique president. The second merely denies that there is a unique president, who is bald. That doesn’t imply that there’s a unique president. It would be true if there’s a unique president who is not bald, but it would also be true in two other cases: i) there’s no president ii) there is more than one president A similar ambiguity arises with the following sentence: The round square does not exist. We might think to symbolize it: ∃x[Rx∧S x∧∀y([Ry∧S y]→x=y)∧∼E x] letting “E” stands for “exists”. In other words, we might give the description wide scope. But this is wrong, because it says there is a certain round square that doesn’t exist, and that’s a contradiction. This way of symbolizing the sentence corresponds to reading the sentence as saying: The thing that is a round square is such that it does not exist But that isn’t the most natural way to read the sentence. The sentence would usually be interpreted to mean: It is not true that the round square exists. — that is, as the negation of “the round square exists”: ∼∃x[Rx∧S x∧∀y([Ry∧S y]→x=y)∧E x] with the ∼ out in front. Here we’ve given the description narrow scope. Notice also that saying that x exists at the end is redundant, so we could simplify to:


82

∼∃x[Rx∧S x∧∀y([Ry∧S y]→x=y)] Again, notice the moral of these last two examples: if a definite description occurs in a sentence with a ‘not’, the sentence may be ambiguous: does the ‘not’ apply to the entire rest of the sentence, or merely to the predicate? If we are willing to use Russell’s method for translating definite descriptions, we can drop ι from our language. We would, in effect, not be treating “the F ” as a referring phrase. We would instead be paraphrasing sentences that contain “the F ” into sentences that don’t. “The black cat is happy” got paraphrased as: “there is something that is a black cat, is such that nothing else is a black cat, and is happy”. See? — no occurrence of “the black cat” in the paraphrased sentence. In fact, once we use Russell’s method, we can get rid of function symbols too. Given function symbols, we treated “father” as a function symbol, symbolized it with “ f ”, and symbolized the sentence “George W. Bush’s father was a politician” as P f (b ). But instead, we could treat ‘father of’ as a two-place predicate, F , and regard the whole sentence as meaning: “The father of George W. Bush was a politician.” Given the ι, this could be symbolized as: P ιxF x b But given Russell’s method, we can symbolize the whole thing without using either function symbols or the ι: ∃x(F x b ∧ ∀y(F y b →y=x) ∧ P x) We can get rid of all function symbols this way, if we want. Here’s the method: • Take any n-place function symbol f • Introduce a corresponding n + 1-place predicate R • In any sentence containing the term “ f (α1 . . . αn )”, replace each occurrence of this term with “the x such that R(x, α1 . . . αn )”. • Finally, symbolize the resulting sentence using Russell’s theory of descriptions For example, let’s go back to: Every even number is the sum of two prime numbers


83

Instead of introducing a function symbol s(x, y) for “the sum of x and y”, let’s introduce a predicate letter R(z, x, y) for “z is a sum of x and y”. We then use Russell’s method to symbolize the whole sentence thus: ∀x(E x→∃y∃z[P y∧P z∧∃w(Rwy z∧∀w1 (Rw1 y z→w1 =w)∧x=w)]) The end of the formula (beginning with ∃w) says “the product of y and z is identical to x” — that is, that there exists some w such that w is a product of y and z, and there is no other product of y and z other than w, and w = x.

5.4

Further quantifiers

Standard logic contains just the quantifiers ∀ and ∃. As we have seen, using just these quantifiers, plus the rest of standard predicate logic, one can represent the truth conditions of a great many sentences of natural language. But not all. For instance, there is no way to symbolize the following sentences in predicate logic: Most things are massive Most men are brutes There are infinitely many numbers Some critics admire only one another Like those sentences that are representable in standard logic, these sentences involve quantificational notions: most things, some critics, and so on. In this section we examine broader notions of quantifiers that allow us to symbolize these sentences.

5.4.1

Generalized monadic quantifiers

We need to generalize the idea behind the standard quantifiers ∃ and ∀ in two ways. To approach the first, think about the clauses in the definition of truth in a model, M, with domain D, for ∀ and ∃: VM, g (∀αφ)=1 iff for every u ∈ D, VM, gu/α (φ)=1 VM,g (∃αφ)=1 iff for some u ∈ D, VM, gu/α (φ)=1 Let’s introduce the following bit of terminology. For any model, M (= 〈D,I〉), and wff, φ, let’s introduce a name for (roughly speaking) the set of members of M’s domain of which φ is true:


84

φM, g ,α = {u : u ∈ D and VM,gu/α (φ) = 1} Thus, if we begin with any variable assignment g , then φM,g ,α is the set of things u in D such that φ is true, relative to variable assignment g (u/α). Given this terminology, we can rewrite the clauses for ∀ and ∃ as follows: VM, g (∀αφ) = 1 iff φM,g ,α = D VM,g (∃αφ) = 1 iff φM,g ,α 6=∅ But if we can rewrite the semantic clauses for the familiar quantifiers ∀ and ∃ in this way — as conditions on φM,g ,α — then why not introduce new symbols of the same grammatical type as ∀ and ∃, whose semantics is parallel to ∀ and ∃ except in laying down different conditions on φM,g ,α ? These would be new kinds of quantifiers. For instance, for any integer n, we could introduce a quantifier ∃n , to be read as “there exists at least n”. That is, ∃n φ means: “there are at least n φs.” The definitions of a wff, and of truth in a model, would be updated with the following clauses: If α is a variable and φ is a wff, then ∃n αφ is a wff VM,g (∃n αφ)=1 iff |φM,g ,α | ≥ n The expression |A| stands for the “cardinality” of set A — i.e., the number of members of A. Thus, this definition says that ∃n αφ is true iff the cardinality of φM, g ,α is greater than or equal to n — i.e., this set has at least n members. Now, the introduction of the symbols ∃n do not increase the expressive power of predicate logic, for as we saw in section 5.1.3, we can symbolize “there are at least n Fs” using just standard predicate logic (plus =). The new notation is merely a space-saver. But other such additions are not mere space-savers. For instance, consider the quantifier most: If α is a variable and φ is a wff, then “most α φ” is a wff VM,g (most α φ)=1 iff |φM,g ,α | > |D−φM,g ,α | The minus-sign in the second clause is the symbol for set-theoretic difference: A−B is the set of things that are in A but not in B. Thus, the definition says that most α φ is true iff more things in the domain D are φ than are not φ. As it turns out (though I won’t prove this here), there is no way to say this using just


85

standard predicate logic. The introduction of the quantifier most genuinely enhances standard predicate logic. One could add all sorts of additional “quantifiers” Q in this way. Each would be, grammatically, just like ∀ and ∃, in that each would combine with a variable, α, and then attach to a sentence φ, to form a new sentence Qαφ. Each of these new quantifiers, Q, would be associated with a relation between sets, RQ , such that Qαφ would be true in a model, M, with domain D, relative to variable assignment g , iff φM, g ,α bears RQ to D. If such an added symbol Q is to count as a quantifier in any intuitive sense, then the relation RQ can’t be just any relation between sets. It should be a relation concerning the relative “quantities” of its relata. It shouldn’t, for instance, “concern particular objects” in the way that the following symbol, ∃Ted-loved , concerns particular objects: VM, g (∃Ted-loved αφ)=1 iff φM,g ,α ∩ {u : u ∈ D and Ted loves u} 6= ∅ So we should require the following of RQ . Consider any set, D, and any oneone function, f , from D onto another set D*. Then, if a subset X of D bears RQ to D, the set f [X ] must bear RQ to D*. ( f [X ] is the image of X under function f — i.e., {u : u ∈ D* and u = f (v), for some v ∈ D}. It is the subset of D* onto which f projects X .)

5.4.2

Generalized binary quantifiers

We have seen how the standard quantifiers ∀ and ∃ can be generalized in one way: syntactically similar symbols may be introduced and associated with different relations between sets. Our second way of generalizing the standard quantifiers is to allow two-place, or binary quantifiers. ∀ and φ are monadic in that ∀α and ∃α attach to a single open sentence φ. Compare the natural language monadic quantifiers ‘everything’ and ‘something’: Everything is material Something is spiritual Here, the predicates (verb phrases) ‘is material’ and ‘is spiritual’ correspond to the open sentences of logic; it is to these that ‘everything’ and ‘something’ attach. But in fact, monadic quantifiers in natural language are atypical. ‘Every’ and ‘some’ typically occur as follows:


86

Every student is happy Some fish are tasty The quantifiers ‘every’ and ‘some’ attach to two predicates. In the first, ‘every’ attaches to ‘[is a] student’ and ‘is happy’; in the second, ‘some’ attaches to ‘[is a] fish’ and ‘[is] tasty’. In these sentences, we may think of ‘every’ and ‘some’ as binary quantifiers. (Indeed, one might think of ‘everything’ and ‘something’ as the result of applying the binary quantifiers ‘every’ and ‘some’ to the predicate ‘is a thing’.) A logical notation can be introduced which exhibits a parallel structure, in which ∀ and ∃ attach to two open sentences. In this notation, the form of quantified sentences is: (∀α:φ)ψ (∃α:φ)ψ The first is to be read: “all φs are ψ”; the second is to be read “there is a φ that is a ψ”. The clauses for these new binary quantifiers are these: VM, g ((∀α:φ)ψ )=1 iff φM,g ,α ⊆ ψM,g ,α VM,g ((∃α:φ)ψ )=1 iff φM, g ,α ∩ ψM,g ,α 6= ∅ As with the introduction of the monadic quantifiers ∃n , the introduction of the binary existential and universal quantifiers does not increase the expressive power of first order logic, for the same effect can be achieved with monadic quantifiers. (∀α:φ)ψ and (∃α:φ)ψ become, respectively: ∀α(φ→ψ) ∃α(φ∧ψ) But, as with the monadic quantifier most, there are binary quantifiers one can introduce that genuinely increase expressive power. For example, most occurrences of ‘most’ in English are binary, e.g.: Most fish swim To symbolize such sentences, we can introduce a binary quantifier most2 . The sentence (most2 α:φ)ψ is to be read “most φs are ψs”. The semantic clause for most2 is:


87

VM, g ((most2 α:φ)ψ)=1 iff |φM,g ,α ∩ ψM,g ,α | > |φM, g ,α − ψM, g ,α | The binary most2 increases our expressive power, even relative to the monadic most: not every sentence expressible with the former is equivalent to a sentence expressible with the latter.2

5.4.3

Second-order logic

Standard predicate logic, as described in sections 4.1-4.3, is known as first-order. We’ll now briefly look at second-order predicate logic. The distinction has to do with how variables behave; it has syntactic and semantic sides. The syntactic part of the idea concerns the grammar of variables. All the variables in first-order logic are grammatical terms. That is, they behave grammatically like names: you can combine them with a predicate to get a wff; you cannot combine them solely with other terms to get a wff; etc. In second-order logic, on the other hand, variables can occupy predicate position. Thus, each of the following sentences is a well-formed formula in second-order logic: ∃X X a ∃X ∃yXy Here we say the variable X occupying predicate position. Predicate variables, like the normal predicates of standard first-order logic, can be one-place, twoplace, three place, etc. The semantic part of the idea concerns the interpretation of variables. In first-order logic, a variable-assignment assigns to each variable a member of the domain. A variable assignment in second-order logic assigns to each standard (first-order) variable α a member of the domain, as before, but assigns to each n-place predicate variable a set of n-tuples drawn from the domain. (This is what one would expect: the semantic value of a n-place predicate is its extension, a set of n-tuples, and variable assignments assign temporary semantic values.) Then, the following clauses to the definition of truth in a model must be added: If π is an n-place predicate variable and α1 …αn are terms, then VM,g (πα1 …αn ) = 1 iff 〈[α1 ]M,g …[αn ]M,g 〉 ∈ g (π) 2

Westerståhl (1989, p. 29).


88

If π is a predicate variable and φ is a wff, then VM, g (∀πφ) = 1 iff for every set U of n-tuples from D, VM, gU/π (φ) = 1 (where gU/π is the variable assignment just like g except in assigning U to π.) Second-order logic is different from first-order logic in many ways. For instance, one can define the identity predicate in second-order logic: x=y =d f ∀X (X x↔Xy) This can be seen to work correctly as follows. A one-place second-order variable X gets assigned a set of things. Thus, the atomic sentence X x says that the object (currently assigned to) x is a member of the set (currently assigned to) X . Thus, ∀X (X x↔Xy) says that x and y are members of exactly the same sets. But since x and only x is a member of {x} (i.e., x’s unit set), that means that the only way for this to be true is for y to be identical to x. More importantly, the metalogical properties of second-order logic are dramatically different from those of first-order logic. For instance, there is no sound and complete recursive set of axioms for second-order logic; the Löwenheim-Skolem theorem fails for second-order logic; Gödel’s incompleteness result does not apply to second-order logic (i.e., there is a recursive set of second-order axioms whose (second-order, semantic) consequences are all and only the sentences true in the standard model of arithmetic.) Such results are studied in depth in mathematical logic.3 Second-order logic also allows us to express claims that cannot be expressed in first-order logic. Consider the “Geach-Kaplan sentence”:4 (GK) Some critics admire only one another It can be shown that there is no way to symbolize (one reading of) the sentence using just first-order logic and predicates for ‘is a critic’ and ‘admires’. The sentence says that there is a group of critics such that the members of that group admire only other members of the group, but one cannot say this in first-order logic. However, the sentence can be symbolized in second-order logic: (GK2 ) ∃X [∃xX x ∧ ∀x(X x→C x) ∧ ∀x∀y([X x∧Axy]→[Xy∧x 6= y)] 3

See, for instance, Boolos and Jeffrey (1989, chapter 18) The sentence and its significance were discovered by Peter Geach and David Kaplan. See Boolos (1984). 4


89

(GK2 ) “symbolizes” (GK) in the sense that it contains no predicates other than C and A, and for every model 〈D,I〉, the following is true: (*) (GK2 ) is true in 〈D,I〉 iff D has a nonempty subset, X , such that i) X ⊆ I(C ), and ii) whenever 〈u, v〉 ∈ I(A) and u ∈ X , then v ∈ X as well and v is not u. No first-order sentence symbolizes the Geach-Kaplan sentence in this sense. However, one can in a sense symbolize the Geach-Kaplan sentence using a firstorder sentence, provided the sentence employs, in addition to the predicates C and A, a predicate ∈ for set-membership: (GK1 ) ∃z[∃x x∈z ∧ ∀x(x∈z→C x) ∧ ∀x∀y([x∈z∧Axy]→[y∈z∧x 6= y)] (GK1 ) doesn’t “symbolize” (GK) in the sense of satisfying (*) in every model, for in some models the two-place predicate ∈ doesn’t mean set-membership. Nevertheless, if we just restrict our attention to models 〈D,I〉 in which ∈ does mean set-membership (restricted to the model’s domain, of course — that is, I(∈) = {〈u, v〉 : u, v ∈ D and u∈v}), then (GK1 ) will indeed satisfy (*). In essence, the difference between (GK1 ) and (GK2 ) is that it is hard-wired into the definition of truth in a model that second-order predications Xy express setmembership, whereas this is not hard-wired into the definition of the first-order predication y ∈ z.5

5

For more on second-order logic, see Boolos (1975, 1984, 1985).

Chapter 6 Propositional Modal Logic odal logic is the logic of necessity and possibility. Thus, in modal logic we will treat as logical constants words like “necessary”, “could be”, “must be”, etc. Here are our new symbols:

M

2φ: “It is necessary that φ”, “Necessarily, φ”, “It must be that φ” 3φ: “It is possible that φ”, “Possibly, φ”, “It could be that φ”, “It can be that φ”, “It might be that φ” “φ is possible” is sometimes used in the following sense: “φ could be true, but then again, φ could be false”. For example, if one says “it might rain tomorrow”, one might intend to say not only that there is a possibility of rain, but also that there is a possibility that there will be no rain. This is not the sense of ‘possible’ that we symbolize with the 3. In our intended sense, “possibly φ” does not imply “possibly not-φ”. To get into the spirit of this sense, note the naturalness of saying the following: “well of course 2+2 can equal 4, since it does equal 4”. Here, ‘can’ is used in our intended sense: it is presumably not possible for 2+2 to fail to be 4, and so in this case, ‘it can be the case that 2+2 equals 4’ does not imply ‘it can be the case that 2+2 does not equal 4’. It is helpful to think of the 2 and the 3 in terms of possible worlds. A possible world is a complete and possible scenario. “Possible” means simply that the scenario could have happened. There are no possible worlds in which it is both raining and also not raining (at the same time and place). But within this limit, we can imagine all sorts of possible worlds: possible worlds with talking donkeys, possible worlds in which I am ten feet tall, and so on. “Complete” means simply that no detail is left out — possible worlds are completely specific 90

CHAPTER 6. PROPOSITIONAL MODAL LOGIC

91

scenarios. There is no possible world in which I am “somewhere between 10 and 11 feet tall”; I must be some particular height in any possible world.1 Likewise, in any possible world in which I am exactly 10 feet, six inches tall (say), I must have some particular weight, must live in some particular place, and so on. One of these possible worlds is the actual world — this is the complete and possible scenario that in fact obtains. The rest of them are merely possible — they do not obtain, but would have obtained if things had gone differently. In terms of possible worlds, we can think of our modal operators thus: “2φ” is true iff φ is true in all possible worlds “3φ” is true iff φ is true in at least one possible world It is necessarily true that all bachelors are male; in every possible world, every bachelor is male. There might have existed a talking donkey; some possible world contains a talking donkey. Possible worlds provide, at the very least, a vivid way to think about necessity and possibility. How much more than a vivid guide they provide is an open philosophical question. Some maintain that possible worlds are the key to the metaphysics of modality, that what it is for a proposition to be necessarily true is for it to be true in all possible worlds.2 Whether this view is defensible is a question beyond the scope of this book; what is important for present purposes is that we distinguish possible worlds as a vivid heuristic from possible worlds as a concern in serious metaphysics. Our first topic in modal logic is the addition of the 2 and the 3 to propositional logic; the result is modal propositional logic (“MPL”). A further step will be be modal predicate logic (chapter 9).

6.1

Grammar of MPL

We need a new language: the language of propositional modal logic. The grammar of this language is just like the grammar of propositional logic, except that we add the 2 as a new one-place sentence connective: Primitive vocabulary: 1 2

This is not to say that possible worlds exclude vagueness. See, for example, Sider (2003).


92

Sentence letters: P, Q, R . . . , with or without numerical subscripts Connectives: →, ∼, 2 Parentheses: (,)

Definition of wff: i) Sentence letters are wffs ii) If φ, ψ are wffs then φ→ψ, ∼φ and 2 are wffs iii) nothing else is a wff The 2 is the only new primitive connective. But just as we were able to define ∧, ∨, and ↔, we can define new nonprimitive modal connectives: 3φ =df ∼2∼φ “φ is possible” φ⇒ψ =df 2(φ→ψ) “strictly implies”

6.2

Translations in MPL

Modal logic allows us to symbolize a number of sentences we couldn’t symbolize before. The most obvious cases are sentences that overtly involve “necessarily”, “possibly”, or equivalent expressions: Necessarily, if snow is white, then snow is white or grass is green 2[S→(S∨G)] I’ll go if I must 2G→G It is possible that Bush will lose the election 3L Snow might have been either green or blue 3(G∨B) If snow could have been green, then grass could have been white 3G→3W ‘Impossible’ and related expressions signify the lack of possibility:


93

It is impossible for snow to be both white and not white ∼3(W ∧∼W ) If grass cannot be clever then snow cannot be furry ∼3C →∼3F God’s being merciful is inconsistent with imperfection’s being incompatible with your going to heaven. ∼3(M ∧∼3(I ∧H )) (M =“God is merciful”, I = “You are imperfect”, H =“You go to heaven”) As for the strict conditional, it arguably does a decent job of representing certain English conditional constructions: Snow is a necessary condition for skiing ∼W ⇒∼K Food and water are required for survival ∼(F ∧W )⇒∼S Thunder implies lightning T ⇒L Once we add modal operators, we can expose an important ambiguity in certain English sentences. The surface grammar of a sentence like “if Ted is a bachelor, then he must be unmarried” is misleading: it suggests the symbolization: B→2U But since I am in fact a bachelor, it would follow from this symbolization that the proposition that I am unmarried is necessarily true. But clearly I am not necessarily a bachelor — I could have been married! The sentence is not saying that if I am in fact a bachelor, then the following is a necessary truth: I am married. It is rather saying that, necessarily, if I am a bachelor then I am married: 2(B→U ) It is the relationship between my being a bachelor and my being unmarried that is necessary. Think of this in terms of possible worlds: the first symbolization


94

says that if I am a bachelor in the actual world, then I am unmarried in every possible world (which is absurd); whereas the second one says that in each possible world, w, if I am a bachelor in w, then I am unmarried in w (which is quite sensible). The distinction between φ→2ψ and 2(φ→ψ) is called the distinction between the “necessity of the consequent” (first sentence) and the “necessity of the consequence” (second sentence). It is important to keep the distinction in mind, because of the fact that English surface structure is misleading. English modal words are ambiguous in a systematic way. For example, suppose I say that I can’t attend a certain conference in Cleveland. What is the force of “can’t” here? Probably I’m saying that my attending the conference is inconsistent with honoring other commitments I’ve made at that time. But notice that another sentence I might utter is: “I could attend the conference; but I would have to cancel my class, and I don’t want to do that.” Now I’ve said that I can attend the conference; have I contradicted my earlier assertion that I cannot attend the conference? No — what I mean now is perhaps that I have the means to get to Cleveland on that date. I have shifted what I mean by “can”. In fact, there are a lot of things one could mean by a modal word like ‘can’. Examples: I can come to the party, but I can’t stay late. (“can” = “is not inconvenient”) Humans can travel to the moon, but not Mars. (“can” = “is achievable with current technology”) Objects can move almost as fast as the speed of light, but nothing can travel faster than light. (“can” = “is consistent with the laws of nature”) Objects could have traveled faster than the speed of light (if the laws of nature had been different), but no matter what the laws had been, nothing could have traveled faster than itself. (“can” = “metaphysical possibility”) You can borrow but you can’t steal. (“can” = “morally acceptable”) So when representing English sentences using the 2 and the 3, one should keep in mind that these expressions can be used to express different strengths of necessity and possibility. (Though we won’t do this, one could introduce different symbols for different sorts of possibility and necessity.)


95

The different strengths of possibility and necessity can be made vivid by thinking, again, in terms of possible worlds. As we saw, we can think of the 2 and the 3 as quantifiers over possible worlds (the former a universal quantifier, the latter an existential quantifier). The very broad sort of possibility and necessity, metaphysical possibility and necessity, can be thought of as a completely unrestricted quantifier: a statement is necessarily true iff it is true in all possible worlds whatsoever. The other kinds of possibility and necessity can be thought of as resulting from various restrictions on the quantifiers over possible worlds. Thus, when ‘can’ signifies achievability given current technology, it means: true in some possible world in which technology has not progressed beyond where it has progressed in fact at the current time; when ‘can’ means moral acceptability, it means: true in some possible world in which nothing morally forbidden occurs; and so on.

6.3

Axiomatic systems of MPL

We’ll now study provability in modal logic. We’ll approach this axiomatically: we’re going to write down axioms, which are sentences of propositional modal logic that seem clearly to be logical truths, and we’re going to write down rules of inference, which say which sentences can be logically inferred from which other sentences. Unfortunately, this is much less straightforward for modal logic than it is for propositional logic. For propositional logic, pretty much everyone agrees what the right axioms and rules of inference should be. But for modal logic, this is less clear, especially for sentences that contain iterations of modal operators. For instance, should 2P →22P be a logical truth? It’s not obvious what the answer is. A quick peek at the history of modal logic is in order. Modal logic arose from dissatisfaction with the material conditional → of standard propositional logic. The material conditional φ→ψ is true whenever φ is false or ψ is true; but in expressing the conditionality of ψ on φ, we sometimes want to require a tighter relationship: we want it not to be a mere accident that either φ is false or ψ is true. To express this tighter relationship, C. I. Lewis introduced the strict conditional φ⇒ψ, which he defined, as above, as 2(φ→ψ).3 Thus defined, φ⇒ψ isn’t automatically true just because φ is false or ψ is true. It must be necessarily true that either φ is false or ψ is true. 3

See Lewis (1918); Lewis and Langford (1932).


96

Lewis then asked: what axioms should govern this new symbol 2? Certain axioms seemed clearly appropriate, for instance: 2(φ→ψ)→(2φ→2ψ). Others were less clear. Should 2φ→22φ be an axiom? What about 32φ→φ? What to choose as an axiom is far less obvious in modal logic as it is in standard propositional logic. Lewis’s solution to this problem was not to choose. Instead, he formulated several different axiomatic systems. The systems differ from one another by containing different axioms; as a result, different theorems are provable in the different systems. In the following sections, we will look at some of these axiomatic systems of Lewis’s. This of course only postpones the difficult questions. Those questions arise when we want to apply Lewis’s systems; when we ask which system is the correct system — i.e., which one correctly mirrors the logical properties of the English words ‘possibly’ and ‘necessarily’? (Note that since there are different sorts of necessity and possibility, different systems might correctly represent different sorts.) We won’t here be addressing such philosophical questions. Since we will be formulating multiple axiomatic systems, it is no longer appropriate to use a single symbol “`φ” to mean that φ is a theorem. Instead, we will give names to the modal systems: K, D, T, B, S4, S5; and we’ll use these names as subscripts on “`” to indicate theoremhood. Thus, `K φ will mean that φ is a theorem of system K.

6.3.1

System K

Our first system, K, is the weakest system — i.e., the system with the fewest theorems. Here are the rules and axioms of K: System K


Rules:

97

MP NEC (“necessitation”) φ φ→ψ φ ψ 2φ

Axioms: PL axioms: for any MPL-wffs φ, ψ, and χ , the following are axioms: (A1) φ→(ψ→φ) (A2) (φ→(ψ→χ ))→((φ→ψ)→(φ→χ )) (A3) (∼ψ→∼φ)→((∼ψ→φ)→ψ) K-schema: for any MPL wffs φ and ψ, the following is an axiom: 2(φ→ψ)→(2φ→2ψ) As before, a K-proof is defined as a series of wffs, each of which is either a K-axiom or follows from earlier lines in proof by a K-rule. A K-theorem is the last line of any K-proof. This axiomatic system (like all the modal systems we will study) is an extension of propositional logic, in the sense that it includes all of the theorems of propositional logic, but then adds more theorems. It includes all of propositional logic because one of its rules is the propositional logic rule MP, and each propositional logic axiom is one of its axioms. It adds theorems by adding a new rule of inference (NEC), and a new axiom schema (the K-schema) (as well as adding new wffs — wffs containing the 2 — to the stock of wffs that can occur in the PL axioms.) The rule of inference, NEC (for “necessitation”), says that if you have a formula φ on a line, then you may infer the formula 2φ. This may seem unintuitive. After all, can’t a sentence be true without being necessarily true? Yes — but the rule of necessitation doesn’t contradict this. Remember that every line in every axiomatic proof is a theorem. So whenever one uses necessitation in a proof, one is applying it to a theorem. And necessitation does seem appropriate when applied to theorems: if φ is a theorem, then 2φ ought also to be a theorem. Think of it this way. The worry about the rule of necessitation is that it isn’t a truth-preserving rule: intuitively speaking, its premise can be true when its conclusion is false. The answer to the worry is that while necessitation


98

doesn’t preserve truth, it does preserve logical truth, which is all that matters in the present context. For in the present context, we’re only using NEC in a definition of theoremhood. We want our theorems to be, intuitively, logical truths; and provided that our axioms are all logical truths and our rules preserve logical truth, the definition will yield only logical truths as theorems. We will return to this issue. Let’s investigate what one can prove in K. The simplest sort of distinctively modal proof consists of first proving something from the PL axioms, and then necessitating it, as in the following proof of 2((P →Q)→(P →P )) 1. 2. 3. 4.

P →(Q→P ) P →(Q→P ))→((P →Q)→(P →P )) (P →Q)→(P →P ) 2((P →Q)→(P →P ))

(A1) (A2) 1,2 MP 3, NEC

Using this technique, we can prove anything of the form 2φ, where φ is provable in PL. And, since the PL axioms are complete (I mentioned but did not prove this fact in chapter 2), that means that we can prove 2φ whenever φ is a tautology — i.e., a valid wff of PL. But constructing proofs from the PL axioms is a pain in the neck! — and anyway not what we want to focus on in this chapter. So let’s introduce the following time-saving shortcut. Instead of writing out proofs of tautologies, let’s instead allow ourselves to write any PL tautology at any point in a proof, annotating simply “PL”.4 Thus, the previous proof could be shortened to: 1. (P →Q)→(P →P ) PL 2. 2((P →Q)→(P →P )) 1, NEC Furthermore, consider the wff 2P →2P . Clearly, we can construct a proof of this wff from the PL axioms: begin with any proof of the tautology Q→Q from the PL axioms, and then construct a new proof by replacing each occurrence of Q in the first proof with 2P . (This is a legitimate proof, even though 2P isn’t a wff of propositional logic, because when we stated the system K, the schematic letters φ, ψ, and χ in the PL axioms are allowed to be filled in with any wffs of MPL, not just wffs of PL.) So let us also include lines like this in our modal proofs: 4

How do you know whether something is a tautology? Figure it out any way you like: do a truth table, or a natural deduction derivation — whatever.


99

2P →2P PL Why am I making such a fuss about this? Didn’t I just say in the previous paragraph that we can write down any tautology at any time, with the annotation “PL”? Well, strictly speaking, 2P →2P isn’t a tautology. A tautology is a valid wff of PL, and 2P →2P isn’t even a wff of PL (since it contains a 2). But it is the result of beginning with some PL-tautology (Q→Q, in this case) and uniformly changing sentence letters to chosen modal wffs (in this case, Qs to 2P s); hence any proof of the PL tautology may be converted into a proof of it; hence the “PL” annotation is just as justified here as it is in the case of a genuine tautology. So in general, MPL wffs that result from PL tautologies in this way may be written down and annotated “PL”. Back to investigating what we can prove in K. As we’ve seen, we can prove that tautologies are necessary — we can prove 2φ whenever φ is a tautology. One can also prove in K that contradictions are impossible. For instance, ∼3(P ∧∼P ) is a theorem of K: 1. 2. 3. 4.

∼(P ∧∼P ) 2∼(P ∧∼P ) 2∼(P ∧∼P )→∼∼2∼(P ∧∼P ) ∼∼2∼(P ∧∼P )

PL 1, NEC PL 2, 3, MP

But line 4 is a definitional abbreviation of ∼3(P ∧∼P ). Let’s introduce another time-saving shortcut. Note that the move from 2 to 4 in the previous proof is just a move from a formula to a propositional logical consequence of that formula. Let’s allow ourselves to move directly from any lines in a proof, φ1 . . . φn , to any propositional logical consequence ψ of those lines, by “PL”. Thus, the previous proof could be shorted to: 1. ∼(P ∧∼P ) PL 2. 2∼(P ∧∼P ) 1, NEC 3. ∼∼2∼(P ∧∼P ) 2, PL Why is this legitimate? Suppose that ψ is a propositional logical semantic consequence of φ1 . . . φn . Then the conditional φ1 →(φ2 → · · · (φn →ψ) . . . ) is a PL-valid formula, and so, given the completeness of the PL axioms, is a theorem of K. That means that if we have φ1 , . . . , φn in an axiomatic K-proof, then we can always prove the conditional φ1 →(φ2 → · · · (φn →ψ) . . . ) using the PL-axioms, and then use MP repeatedly to infer ψ. So inferring ψ directly,


100

and annotating “PL”, is justified. (As with the earlier “PL” shortcut, let’s use this shortcut when the conditional φ1 →(φ2 → · · · (φn →ψ) . . .) results from some tautology by uniform substitution, even if it contains modal operators and so isn’t strictly a tautology.) So far our modal proofs have only used necessitation and the PL axioms. What about the K-axioms? The point of the K-schema is to enable “distribution of the 2 over the →”. That is, if you ever have the formula 2(φ→ψ), then you can always move to 2φ→2ψ as follows: 2(φ→ψ) 2(φ→ψ)→(2φ→2ψ) K axiom 2φ→2ψ MP Putting this together with necessitation, this means that whenever one can prove the conditional φ→ψ, then one can prove the modal conditional 2φ→2ψ as well. First prove φ→ψ, then necessitate it to get 2(φ→ψ), then distribute the 2 over the arrow to get 2φ→2ψ. This procedure is one of the core K-strategies, and is featured in the following proof of 2(P ∧Q)→(2P ∧2Q): 1. 2. 3. 4. 5. 6.

(P ∧Q)→P 2[(P ∧Q)→P ] 2[(P ∧Q)→P ]→[2(P ∧Q)→2P ] 2(P ∧Q)→2P 2(P ∧Q)→2Q 2(P ∧Q)→(2P ∧2Q)

PL NEC K axiom 3,4 MP Insert steps similar to 1-4 4,5, PL

Notice that the preceding proof, like all of our proofs since we introduced the time-saving shortcuts, is not a K-proof in the official defined sense. Lines 1, 5, and 6 are not axioms, nor do they follow from earlier lines by MP or NEC; similarly for line 6.5 So what kind of “proof” is it? It’s a metalanguage proof: an attempt to convince the reader, by acceptable standards of rigor, that some real K-proof exists. A reader could use this metalanguage proof as a blueprint for constructing a real proof. She would begin by replacing line 1 with a proof from the PL axioms of the conditional (P ∧Q)→P . (As we know from chapter 2, this could be a real pain in the neck! — but the completeness of PL assures us that it is possible.) She would then replace line 5 with lines parallel to lines 1-4, 5 A further (even pickier) reason: the symbol ∧ isn’t allowed in wffs; the sentences in the proof are mere abbreviations for official MPL-wffs.


101

but which begin with a proof of (P ∧Q)→Q rather than (P ∧Q)→P . Finally, in place of line 6, she would insert a proof from the PL axioms of the sentence (2(P ∧Q)→2P )→[(2(P ∧Q)→2Q)→(2(P ∧Q)→(2P ∧2Q))], and then use modus ponens twice to infer 2(P ∧Q)→(2P ∧2Q). Another example: (2P ∨2Q)→2(P ∨Q): 1. 2. 3. 4. 5. 6.

P →(P ∨Q) 2(P →(P ∨Q)) 2(Q→(P ∨Q)) 2P →2(P ∨Q) 2Q→2(P ∨Q) (2P ∨2Q)→2(P ∨Q)

PL 1, NEC PL, NEC 2, K 3, K 4,5 PL

Here I’ve introduced another time-saving shortcut that I’ll use more and more as we progress: doing two (or more) steps at once. Line 3 is really short for: 3a. Q→(P ∨Q) PL 3b. 2(Q→(P ∨Q)) 3a, NEC And line 4 is short for: 4a. 2(P →(P ∨Q))→(2P →2(P ∨Q)) K axiom 4b. 2P →2(P ∨Q) 2, 4a, MP One further comment about this last proof: it illustrates a strategy that is common in modal proofs. We were trying to prove a conditional formula whose antecedent is a disjunction of two modal formulas. But the modal techniques we had developed didn’t deliver formulas of this form. They only showed us how to put 2s in front of PL-tautologies, and how to distribute 2s over conditional. They only yield formulas of the form 2φ and 2φ→2ψ, whereas the formula we’re trying to prove looks different. To overcome this problem, what we did was to use the modal techniques to prove two conditionals, namely 2P →2(P ∨Q) and 2Q→2(P ∨Q), from which the desired formula, namely (2P ∨2Q)→2(P ∨Q), follows by propositional logic. The trick, in general, is this: remember that you have PL at your disposal. Simply look for one or more modal formulas you know how to prove which, by PL, imply the formula you want. Assemble the desired formulas, and then write down your desired formula, annotating “PL”. In doing so, it may be helpful to recall PL inferences like the following:

CHAPTER 6. PROPOSITIONAL MODAL LOGIC φ→ψ ψ→φ φ↔ψ

φ→(ψ→χ ) (φ∧ψ)→χ

φ→ψ φ→χ φ→(ψ∧χ )

φ→χ ψ→χ (φ∨ψ)→χ

φ→ψ ∼φ∨ψ

φ→∼ψ ∼(φ∧ψ)

102

The next example illustrates our next major modal proof technique: combining two 2 statements to get a single 2 statement. Let us construct a K-proof of (2P ∧2Q)→2(P ∧Q): 1. 2. 3. 4. 5. 6.

P →(Q→(P ∧Q)) 2[P →(Q→(P ∧Q))] 2P →2(Q→(P ∧Q)) 2(Q→(P ∧Q))→[2Q→2(P ∧Q)] 2P →[2Q→2(P ∧Q)] (2P ∧2Q)→2(P ∧Q)

PL NEC 2, K K axiom 3,4 PL 5, PL

(If you wanted to, you could skip step 5, and just go straight to 6 by propositional logic, since 6 is a propositional logical consequence of 3 and 4; I put it in for perspicuity.) The general technique illustrated by the last problem applies anytime you want to move from several 2 statements to a further 2 statement, where the inside parts of the first 2 statements imply the inside part of the final 2 statement. More carefully: it applies whenever you want to prove a formula of the form 2φ1 →(2φ2 → · · · (2φn →2ψ) . . . ), provided you are able to prove the formula φ1 →(φ2 → · · · (φn →ψ) . . . ). (The previous proof was an instance of this because it involved moving from 2P and 2Q to 2(P ∧Q); and this is a case where one can move from the inside parts of the first two formulas (namely, P and Q), to the inside part of the third formula (namely, P ∧Q) — by PL.) To do this, one begins by proving the conditional φ1 →(φ2 → · · · (φn →ψ) . . . ), necessitating it to get 2[φ1 →(φ2 → · · · (φn →ψ) . . . )], and then distributing the 2 over the arrows repeatedly using K-axioms and PL to get 2φ1 →(2φ2 → · · · (2φn →2ψ) . . . ).


103

One cautionary note in connection with this last proof: one might think to make this proof more intuitive by using something like conditional proof (which is, in essence, a use of the deduction theorem for propositional logic): 1. 2. 3. 4. 5. 6. 7. 8. 9. 10.

2P ∧2Q 2P 2Q P →(Q→(P ∧Q)) 2[P →(Q→(P ∧Q))] 2P →2(Q→(P ∧Q)) 2(Q→(P ∧Q)) 2Q→2(P ∧Q) 2(P ∧Q) (2P ∧2Q)→2(P ∧Q)

Assume for conditional proof 1, PL 1, PL PL NEC 5, K 6,2, MP 7,K 3,8 MP 1-9, conditional proof

But this is not a legal proof. Not only is conditional proof not allowed by the official rules of the proof system; it couldn’t be added to the system, since the deduction theorem (which says that if φ is provable from ψ then the conditional φ→ψ is provable) does not hold for K. If conditional proof did work, one could show that the following is a K theorem: P →2P . But clearly, this shouldn’t be a K theorem (and indeed, one can show that it isn’t.) Here’s the bogus proof: 1. P Assume 2. 2P 1, NEC 3. P →2P 1,2, Conditional proof We already knew that conditional proof is not officially allowed in K-proofs. But this shows that we couldn’t add conditional proof to our system (at least, not in a straightforward way.) Of course, to convince yourself that a given formula is really a tautology of propositional logic, you could sketch a proof of it to yourself using conditional proof, since conditional proof is acceptable for non-modal propositional logic. But as I’ve mentioned, we can just infer propositional logical consequences directly in our proofs. Another example will illustrate another technique for proving formulas in K with “nested” modal operators; let us prove `K 22(P ∧Q)→22P : 1. 2. 3. 4.

(P ∧Q)→P 2(P ∧Q)→2P 2[2(P ∧Q)→2P ] 22(P ∧Q)→22P

PL 1, NEC, K 2, NEC 3, K


104

Notice in line 3 that we necessitated something that was not a PL theorem. That’s ok; we’re allowed to necessitate any K-theorems, even those whose proofs were distinctly modal. Notice also how this proof contains two instances of our basic K-strategy. This strategy involves obtaining a conditional, necessitating it, then distributing the 2 using K. We did this first using the conditional (P ∧Q)→P ; that led us to a conditional, 2(P ∧Q)→2P . Then we started the strategy over again, using this as our initial conditional. So far we have no techniques dealing with the 3, other than eliminating it by definition. It will be convenient to derive some shortcuts. For example, we should be assured that the following hold: (these are often called “modal negation”, or MN): `K ∼2φ↔3∼φ `K ∼3φ↔2∼φ I’ll do one of these; the rest can be an exercise: 1. ∼∼φ→φ PL 2. 2∼∼φ→2φ 1, NEC, K 3. ∼2φ→∼2∼∼φ 2, PL The final line, 3, is the definitional equivalent of ∼2φ→3∼φ. Similarly, we should establish that 2φ↔∼3∼φ (i.e., 2φ↔∼∼2∼∼φ) is a theorem: 1. 2. 3. 4. 5. 6.

φ→∼∼φ 2φ→2∼∼φ 2φ→∼∼2∼∼φ 2∼∼φ→2φ ∼∼2∼∼φ→2φ 2φ↔∼∼2∼∼φ

PL 1, NEC, K 2, PL PL, NEC, K 4, PL 5, 3 PL

We can refer to the two theorems 2φ↔∼3∼φ, and 3φ↔∼2∼φ, as “dual”, because they say that the 2 and the 3 are “duals” (an analogy: the quantifiers are duals, because ∀xφ↔∼∃x∼φ, and ∃xφ↔∼∀x∼φ are both logical truths). It will also be worthwhile to know that an analog of the K axiom holds for the 3: “K3”: 2(φ→ψ)→(3φ→3ψ)


105

which amounts to showing that the following is a theorem: 2(φ→ψ)→(∼2∼φ→∼2∼ψ): How are we going to do this? We’re dealing with an axiomatic system here, so we can’t use conditional derivation, indirect derivation, and so on, as we usually would in deriving things in propositional logic. So what to do? What we need to do is look for a tautology that we can necessitate, and which will correspond to this pattern of reasoning. We can be guided as follows: the formula we seek is equivalent, in propositional logic, to the following: 2(φ→ψ)→(2∼ψ→2∼φ) So if we can show this last formula, we can infer our goal by PL reasoning. But this last formula looks like the result of necessitating a tautology, and then distributing the 2 over the → a couple times; and indeed it is: 1. 2. 3. 4. 5.

(φ→ψ)→ (∼ψ→∼φ) 2(φ→ψ)→2(∼ψ→∼φ) 2(∼ψ→∼φ)→(2∼ψ→2∼φ) 2(φ→ψ)→(2∼ψ→2∼φ) 2(φ→ψ)→(∼2∼φ→∼2∼ψ)

PL 1, NEC, K K 2,3 PL 4,PL

In doing proofs, let’s also allow ourselves to refer to earlier theorems proved, rather than repeating their proofs. The importance of K3 may be illustrated by the following proof of 2P →(3Q→3(P ∧Q)): 1. 2. 3. 4.

P →[Q→(P ∧Q)] 2P →2[Q→(P ∧Q)] 2[Q→(P ∧Q)]→[3Q→3(P ∧Q)] 2P →[3Q→3(P ∧Q)]

PL 1, NEC, K K3 2,3, PL

In general, the K3 rule allows us to complete proofs of the following sort. Suppose we wish to prove a formula of the form: O1 φ1 →(O2 φ2 →(. . . →(On φn →3ψ) . . .) where the Oi s are modal operators, all but one of which are 2s. (Thus, the remaining Oi is the 3.) This can be done, provided that ψ is provable in K from the φi s. The basic strategy is to prove a nested conditional, the antecedents of which are the φi s, and the consequent of which is ψ; necessitate it; then


106

repeatedly distribute the 2 over the →s, once using K3, the rest of the times using K. But there is one catch. We need to make the application of K3 last, after all the applications of K. This in turn requires the conditional we use to have the φi that is underneath the 3 as the last of the antecedents. For instance, suppose that φ3 is the one underneath the 3. Thus, what we are trying to prove is: 2φ1 →(2φ2 →(3φ3 →(2φ4 →(…→(2φn →3ψ)…) In this case, the conditional to use would be: φ1 →(φ2 →(φn →(φ4 →(…→(φn−1 →(φ3 →ψ)…) In other words, one must swap one of the other φi s (I arbitrarily chose φn ) with φ3 . What one obtains at the end will therefore have the modal statements out of order: 2φ1 →(2φ2 →(2φn →(2φ4 →(…→(2φn−1 →(3φ3 →3ψ)…) But that problem is easily solved; this is equivalent in PL to what we’re trying to get. (Recall that φ→(ψ→χ ) is logically equivalent in PL to ψ→(φ→χ ).) Why do we need to save K3 for last? The strategy of successively distributing the box over all the nested conditionals comes to a halt as soon as the K3 theorem is used. Let me illustrate with an example. Suppose we wish to prove `K 3P →(2Q→3(P ∧Q)). We might think to begin as follows: 1. 2. 3. 4.

P →(Q→(P ∧Q)) PL 2[P →(Q→(P ∧Q))] 1, Nec 3P →3(Q→(P ∧Q)) K3 ?

But now what? What we need to finish the proof is: 3(Q→(P ∧Q))→(2Q→3(P ∧Q)). But neither K nor K3 gets us this. The remedy is to begin the proof with a different conditional: 1. 2. 3. 4. 5. 6.

Q→(P →(P ∧Q)) 2(Q→(P →(P ∧Q))) 2Q→2(P →(P ∧Q)) 2(P →(P ∧Q))→(3P →3(P ∧Q)) 2Q→(3P →3(P ∧Q)) 3P →(2Q→3(P ∧Q))

PL 1, Nec 2, K, MP K3 3, 4, PL 5, PL


107

Before completing our discussion of K, it will be useful to note an important theorem: Substitution of equivalents: If `K α↔β, then for every wff χ , `K χ ↔χ β , where χ β results from χ by changing αs to βs. Proof of substitution of equivalents: Suppose (*) `K α↔β. We proceed by induction. Base case: here χ is a sentence letter. Then either i) changing αs to βs has no effect, in which case χ β is just χ , in which case obviously `K (χ ↔χ β ); or ii) χ is α, in which case χ β is β, and we know `K (χ ↔χ β ) since we are given (*). Induction case: We now assume the result holds for some formulas β β χ1 and χ2 — that is, we assume that `K χ1 ↔χ1 and `K χ2 ↔χ2 — and we show the result holds for ∼χ1 , 2χ1 , and χ1 →χ2 . Take the first case. We must show that the result holds for ∼χ1 — β i.e., we must show that `K ∼χ1 ↔(∼χ1 )β . (∼χ1 )β is just ∼χ1 , so β we must show `K ∼χ1 ↔∼χ1 . But this follows by PL from the β inductive hypothesis: `K χ1 ↔χ1 . Take the second case. We must show `K (χ1 →χ2 )β . The inducβ tive hypothesis tells us that `K χ1 ↔χ1 , from which it follows by propositional logic that: `K (χ1 →χ2 )↔ (χ1 β →χ2 ) The inductive hypothesis also tells us that `K (χ2 ↔χ2 β ), from which by propositional logic we obtain: `K (χ1 β →χ2 )↔ (χ1 β →χ2 β ) Now from the two indented equivalences, by propositional logic we have: `K (χ1 →χ2 )↔ (χ1 β →χ2 β ) But note that (χ1 β →χ2 β ) is just the same formula as (χ1 →χ2 )β . So we’ve shown what we wanted to show.


108 β

Finally, take the third case. We must show that `K 2χ1 ↔2χ1 . β This follows from the inductive hypothesis `K χ1 ↔χ1 . For the β inductive hypothesis implies `K χ1 →χ1 , by PL; and then by NEC β and K we have `K 2χ1 →2χ1 . A parallel argument establishes β `K 2χ1 →2χ1 ; and then the desired conclusion follows by PL. That completes the inductive proof. Substitution of equivalents is important because it lets us utilize proved equivalences in later proofs. For example, above, we proved the following two theorems: 2(P ∧Q)→(2P ∧2Q) (2P ∧2Q)→2(P ∧Q) From this we can infer by PL logic that 2(P ∧Q)↔(2P ∧2Q) is a theorem; let us call this 2∧. This means that, in effect, from now on, we can treat 2(P ∧Q) and 2P ∧2Q interchangeably. We’ll allow ourselves to utilize substitution of equivalents within proofs; let’s refer to the rule as “eq”. Note that the principle of substitution of equivalents, plus the biconditionals of modal negation, MN, that were shown to be theorems, allows us to “swap” negation signs and modal operators at will. For example, we can show ∼223φ↔332∼φ as follows: 1. 2. 3. 4.

∼223φ↔ ∼223φ 3∼23φ↔ ∼223φ 33∼3φ↔ ∼223φ 332∼φ↔ ∼223φ

PL 1, MN, eq 2. MN, eq 3, MN, eq

Let’s allow ourselves, for brevity, to do several of these steps at once. One can, then, prove a number of theorems in K. But there’s a big limitation of K: you can’t prove 2P →3P . (We’ll show this later, when we study invalidity.) From this, it follows that you can’t prove that tautologies are possible or that contradictions aren’t necessary. So a new system is called for.

6.3.2

System D

System D results from adding a new axiom to system K: System D


109

Rules: MP, NEC Axioms: PL axioms K-schema: 2(φ→ψ)→(2φ→2ψ) D-schema: 2φ→3φ Notice that since D includes all the K axioms, we retain all the K-theorems. And notice that this means that substitution of equivalents still holds. The addition of the new axioms just gives us more theorems. In fact, all of our systems will build on K in this way, by adding new axioms to K. An example of what we can do now is prove that tautologies are possible: 1. 2. 3. 4.

P ∨∼P 2(P ∨∼P ) 2(P ∨∼P )→3(P ∨∼P ) 3(P ∨∼P )

PL 1, NEC D 2,3 MP

Let’s do one more theorem, 22P →23P : 1. 2P →3P D 2. 2(2P →3P ) 1, NEC 3. 22P →23P 2, K This system is also extremely weak. As we will see later, we can’t prove 2φ→φ in D. Therefore, D doesn’t seem to be a correct logic for metaphysical necessity, for surely, if something’s true in all possible worlds, then it is true in the actual world, and so just plain old true. But there is some interest in D anyway: some have suggested that D is a correct logic for some sort of moral necessity: thus, 2φ might be read as “φ is morally necessary”, “φ ought to be the case”, or “φ ought to be performed”; similarly, 3φ might be read as “φ is morally permitted”, or “φ is allowed”. Thus, the D axiom corresponds to the principle that if something ought to be performed then it is permitted. That 2φ→φ cannot be proved in D would then be a virtue, for from the fact that something ought be performed, it certainly doesn’t follow that it is performed. But I won’t go any further into the question of whether D in fact does give a correct logic for some concept of moral necessity. That’s philosophy, not logic.

6.3.3

System T

This new system is the first system we have considered that has any plausibility of being a correct logic for metaphysical necessity. For we add the following


110

axiom schema: 2φ→φ. In fact, when we do this we can drop the D schema, since its instances become theorems. (We’ll show this below.) Thus, our T system is given by: System T Rules: MP, NEC Axioms: PL axioms K-schema: 2(φ→ψ)→(2φ→2ψ) T-schema: 2φ→φ The first theorem that’s worth establishing is this: “T3”: `T φ→3φ: 1. 2∼φ→∼φ T 2. φ→∼2∼φ 1, PL 2 is just the definition of φ→3φ. And now notice that instances of the Daxioms are now theorems, for 2φ→φ is a T axiom, we just proved that φ→3φ is a theorem; and from these two by PL we can prove 2φ→3φ.

6.3.4

System B

Our systems so far don’t allow us to prove anything interesting about iterated modalities, i.e., sentences with consecutive boxes or diamonds. Which such sentences should be theorems? The B axiom schema decides some of these questions for us: System B Rules: MP, NEC Axioms: PL axioms K-schema: 2(φ→ψ)→(2φ→2ψ) T-schema: 2φ→φ B-schema: 32φ→φ As in the case of T, let’s derive an analog of the B axiom for the 3: B3: φ→23φ:


111

1. 32∼φ→∼φ B 2. ∼23φ→∼φ 2, MN, eq (twice) 3. φ→23φ 3, PL Let’s try an example from the sheet of MPL theorems (# 41): [2P ∧232(P →Q)]→2Q: 1. 2. 3. 4. 5.

6.3.5

32(P →Q)→(P →Q) 232(P →Q)→2(P →Q) 2(P →Q)→(2P →2Q) 232(P →Q)→(2P →2Q) [2P ∧232(P →Q)]→2Q

B 1, Nec, K, MP K 2, 3 PL 4, PL

System S4

Here, we replace the B schema with a different schema: System S4 Rules: MP, NEC Axioms: PL axioms K-schema: 2(φ→ψ)→(2φ→2ψ) T-schema: 2φ→φ S4-schema: 2φ→22φ Again, we have a derived version of the S4 axiom for the diamond: Proof of “S43”: 33φ→3φ: 1. 2. 3. 4. 5.

2∼φ→22∼φ ∼22∼φ→∼2∼φ ∼∼33φ→∼2∼φ ∼∼33φ→3φ 33φ→3φ

S4 1, PL 2, MN, eq (twice) 3, dual, eq 4, PL

Let’s do one fairly difficult example: (3P ∧2Q)→3(P ∧2Q) (half of #56 from the theorem sheet). How should we approach this problem? My thinking is as follows. We saw in the K section above that the following sort of thing may always be proved: 2φ→(3ψ→3χ ), whenever the conditional φ→(ψ→χ ) can be proved. So we need to try to work the problem into this form.


112

As-is, the problem doesn’t quite have this form. But something very related does have this form, namely: 22Q→(3P →3(P ∧2Q)) (since the conditional 2Q→(P →(P ∧2Q)) is a tautology). This thought inspires the following proof: 1. 2. 3. 4. 5. 6.

6.3.6

2Q→(P →(P ∧2Q)) 22Q→2(P →(P ∧2Q)) 2(P →(P ∧2Q))→(3P →3(P ∧2Q)) 22Q→(3P →3(P ∧2Q)) 2Q→22Q (3P ∧2Q)→3(P ∧2Q)

PL 1, Nec, K, MP K3 2, 3 PL S4 4, 5 PL

System S5

Here, instead of the B or S4 schemas, we add the S5 schema to T: System S5 Rules: MP, NEC Axioms: PL axioms K-schema: 2(φ→ψ)→(2φ→2ψ) T-schema: 2φ→φ S5-schema: 32φ→2φ Theorem: “S53”: 3φ→23φ: 1. 32∼φ→2∼φ S5 2. ∼2∼φ→∼32∼φ 1, PL 3. 3φ→23φ 2, MN, dual, PL, eq. Note that the B and S4 axioms are now derivable as theorems. The B axiom, 32φ→φ, is trivial: 1. 32φ→2φ S5 2. 2φ→φ T 3. 32φ→φ 1,2 PL And now the S4 axiom, 2φ→22φ. This is a little harder. I used the B3 theorem, which we can now appeal to since the theoremhood of the B-schema has been established.

CHAPTER 6. PROPOSITIONAL MODAL LOGIC 1. 2. 3. 4. 5.

2φ→232φ 32φ→2φ 2(32φ→2φ) 232φ→22φ 2φ→22φ

113

B3 S5 2, Nec 3, K, MP 4, 1, PL

In S5, an important result for strings of modal operators holds: whenever a formula has a string of modal operators in front, it is always equivalent to the formula with only the first operator. For example, 223232232323φ is equivalent to 3φ (that is, each is provable from the other). This follows from the fact that the following equivalences are all theorems of S5: a) 32φ↔2φ b) 22φ↔2φ c) 23φ↔3φ d) 33φ↔3φ The left-to-right direction of a) is just S5; the right-to-left is T3; b) is T and S4; c) is T and S53; and d) is S43 and T3. Thus, by repeated applications of these equivalences, using substitution of equivalents, we can reduce strings of modal operators to the innermost operator. This fact, in conjunction with the MN and dual equivalences above, allows us to perform reductions on any string of modal operators and tildes (∼).

6.4

Semantics for MPL

So far, we have ways of establishing that a given wff is a theorem, for each of the various systems. But we don’t have a method for showing that a given wff isn’t a theorem. Truth-tables did for us in non-modal propositional logic. To show φ is not a theorem of PL, we produced an assignment to the sentence letters, relative to which φ is false. The existence of such an assignment means that φ is not valid. But by the soundness proof, every theorem is valid. So φ is not a theorem. We will follow the same procedure for MPL: for each system, we will define a notion of validity, and provide a soundness proof. Soundness, recall, means that every theorem is valid. Thus, to establish non-theoremhood, it will suffice to establish invalidity.


114

Defining validity is important for a couple other reasons. First, it gives us an alternate way of characterizing logical consequence. Whereas theoremhood is a proof-theoretic method of characterizing consequence, validity is a semantic method. Secondly, giving a semantics for a logical system sheds light on meaning. Learning about the truth table for ∧ tells us something about its meaning: the function of ∧ is to produce compound sentences φ∧ψ, which are true iff both conjuncts φ and ψ are true. Likewise, it is plausible to think that constructing a semantics for modal logic will tell us something about what 2 and 3 mean. In constructing a semantics for MPL, we face the following challenge: the modal operators 2 and 3 are not truth functional. A (sentential) connective is an expression that combines with sentences to make new sentences. A one-place connective combines with one sentence to form a new sentence. ‘It is not the case that’ is a one-place connective of English — the ∼ is a one-place connective in the language of PL. A connective is truth-functional iff whenever it combines with sentences to form a new sentence, the truth value of the resulting sentence is determined by the truth value of the component sentences. Many think that ‘and’ is truth-functional, since they think that an English sentence of the form “φ and ψ” is true iff φ and ψ are both true. But ‘necessarily’ is not truthfunctional. Suppose I tell you the truth value of φ; will you be able to tell me the truth value of this sentence? Well, if φ is false then presumably you can (it is false), but if φ is true, then you still don’t know. If φ is “Ted is a philosopher” then “Necessarily φ” is false, but if φ is “Either Ted is a philosopher or he isn’t a philosopher” then “Necessarily φ” is true. So the truth value of “Necessarily φ” isn’t determined by the truth value of φ. Similarly, ‘possibly’ isn’t truthfunctional either: ‘I might have been six feet tall’ is true, whereas ‘I might have been a round square’ is false, despite the fact that ‘I am six feet tall’ and ‘I am a round square’ each have the same truth value (they’re both false.) Since the 2 and the 3 are supposed to represent ‘necessarily’ and ‘possibly’, respectively, and since the latter aren’t truth-functional, we can’t use the method of truth tables to construct the semantics for the 2 and the 3. For the method of truth tables assumes truth-functionality. Truth tables are just pictures of truth functions: they specify what truth value a complex sentence has as a function of what truth values its parts have. Imagine trying to construct a truth table for the 2. It’s presumably clear (though see the discussion of systems K, D, and T below) that 2φ should be false if φ is false, but what about when φ is true?:


115

2 φ ? 1 0 0 There’s nothing we can put in this slot in the truth table, since when φ is false, sometimes 2φ is true and sometimes it is false. Our challenge is clear: we need to develop a semantics for the 2 and the 3 which isn’t just the method of truth tables.

6.4.1

Relations

Before we investigate how to overcome this challenge, a digression is necessary. Recall our discussion of ordered ’tuples from section 4.2. In addition to their use in constructing models, ordered ’tuples are also useful for constructing relations. We take a binary (2-place) relation to be a set of ordered pairs. For example, the taller-than relation may be taken to be the set of ordered pairs 〈u, v〉 such that u is taller than v. The less-than relation for positive integers is the set of ordered pairs 〈m, n〉 such that m is a positive integer less than n, another positive integer. That is, it is the following set: {〈1, 2〉, 〈1, 3〉, 〈1, 4〉 . . . 〈2, 3〉, 〈2, 4〉…} When 〈u, v〉 is a member of relation R, we say that u and v stand in R, or that u bears R to v. Most simply, we write “Ruv”. (This notation is like that of predicate logic; but here I’m speaking the metalanguage, not displaying sentences of a formalized language.) Some definitions. Let R be any binary relation. • The domain of R (“dom(R)”) is the set {u: for some v, Ruv} • The range of R (“ran(R)”) is the set {u: for some v, Rv u} • R is over A iff dom(R) ⊆ A and ran(R) ⊆ A In other words, the domain of R is the set of all things that bear R to something; the range is the set of all things that something bears R to; and R is over A iff the members of the ’tuples in R are all drawn from A. Let R be any binary relation over A. Then we define the following notions with respect to A: • R is serial (in A) iff for every u ∈ A, there is some v ∈ A such that Ruv.


116

• R is reflexive (in A) iff for every u ∈ A, Ru u • R is symmetric iff for all u, v, if Ruv then Rv u • R is transitive iff for any u, v, w, if Ruv and Rv w then Ruw • R is an equivalence relation (in A) iff R is symmetric, transitive, and reflexive (in A) • R is total (in A) iff for every u, v ∈ A, Ruv Notice that we relativize some of these notions to a given set A. We define the notion of reflexivity relative to a set, for example. We do this because the alternative would be to say that a relation is reflexive simpliciter if everything bears R to itself; but that would require the domain and range of any reflexive relation to be the set of absolutely all objects. It’s better to introduce the notion of being reflexive relative to a set, which is applicable to relations with smaller domains and ranges. (I will sometimes omit the qualifier ‘in A’ when it is clear which set that is.) Why don’t symmetry and transitivity have to be relativized to a set? — because they only say what must happen if R holds among certain things. Symmetry, for example, says merely that if R holds between u and v, then it must also hold between v and u, and so we can say that a relation is symmetric absolutely, without implying that everything is in its domain and range.

6.4.2

Kripke models for MPL

Now we’re ready to introduce a semantics for MPL. As we saw, we can’t construct truth tables for the 2 or the 3. Instead, we will pursue an approach called possible-worlds semantics. The intuitive idea is to count 2φ as being true iff φ is true in all possible worlds, and 3φ as being true iff φ is true in some possible worlds. More carefully: we are going to develop models for modal propositional logic. These models will contain objects we will call “possible worlds”. And formulas are going to be true or false “at” these worlds — that is, we are going to assign truth values to formulas in these models relative to possible worlds, rather than absolutely. Truth values of propositional-logic compound formulas — that is, negations and conditionals — will be determined by truth tables within each world; ∼φ, for example, will be true at a world iff φ is false at that world. But the truth value of 2φ at a world won’t be determined by the truth value of φ at that world; the truth value of φ at other worlds will also be relevant.


117

Specifically, 2φ will count as true at a world iff φ is true at every world that is “accessible” from the first world. What does “accessible” mean? Each model will come equipped with a binary relation, R, that holds between possible worlds; we will say that world v is “accessible from” world w when Rwv. The intuitive idea is that Rwv if and only if v is possible relative to w. That is, if you live in world w, then from your perspective, the events in world v are possible. The idea that what is possible might vary depending on what possible world you live in might at first seem strange, but it isn’t really. “It is physically impossible to travel faster than the speed of light” is true in the actual world, but false in worlds where the laws of nature allow faster-than-light travel. On to the official definitions based on these intuitive ideas. We need some general definitions which we will re-use in defining validity for the various systems. A frame is an ordered pair 〈W, R〉, such that: i) W is a non-empty set of objects, the “worlds” ii) R is a binary relation over W, the “accessibility relation” An MPL-model (“based on frame 〈W, R〉”) is an ordered triple, 〈W, R, A〉, such that: i) 〈W, R〉 is a frame ii) A is a two-place function (a “modal assignment function”) that assigns a 0 or 1 to each sentence letter, relative to (“at”) each world — that is, for any sentence letter α, and any w ∈ W, A(α, w) is either 0 or 1. Where M (=〈W, R, A〉) is any MPL-model, the valuation for M, VM , is defined as the two-place function that assigns either 0 or 1 to each wff relative to each member of W, subject to the following constraints, where α is any sentence letter, φ and ψ are any wffs, and w is any member of W: a) VM (α, w) = A(α, w) b) VM (∼φ, w)=1 if VM (φ, w)=0 c) VM (φ→ψ, w)=1 iff either VM (φ, w)=0 or VM (ψ, w)=1 d) VM (2φ, w)=1 iff for each v ∈ W, if Rwv, then VM (φ, v)=1


118

Note how each model has two halves, the frame and the assignment. Each frame is a map of the “structure” of the space of possible worlds: it contains information about how many worlds there are, and which worlds are accessible from which. The assignment then adds information about which sentence letters are true at which worlds. And given any model, the valuation function goes further and extends the notion of truth at worlds to complex wffs. What about the truth values for complex formulas that contain ∧, ∨, ↔, and 3? We have as derived conditions the following: i) VM (φ∧ψ, w)=1 iff VM (φ, w)=1 and VM (ψ, w)=1 ii) VM (φ∨ψ, w)=1 iff VM (φ, w)=1 or VM (ψ, w)=1 iii) VM (φ↔ψ, w)=1 iff VM (φ, w)=VM (ψ, w) iv) VM (3φ, w)=1 iff for some v ∈ W, Rwv and VM (φ, v)=1 It’s important to get clear on the status of possible-worlds lingo here. Where 〈W, R,I〉 is a model, we call the members of W “worlds”, and we call R the “accessibility” relation. But there’s no heavy-duty or suspect metaphysics going on. We give R and the members of W these names simply because this is a vivid way to think. Officially, W is nothing but a nonempty set, any old nonempty set. Its members needn’t be the kinds of things metaphysicians call possible worlds: they can be numbers, people, bananas — whatever you like. Similarly, R is just defined to be any old binary relation on R.

6.4.3

Validity in MPL

More definitions. A formula φ is valid on a frame 〈W,R〉 iff for every MPL-model M based on this frame, and every w ∈ W,VM (φ, w) = 1 We can now give our definitions of validity for our various systems: • φ is K-valid iff φ is valid on all frames • φ is D-valid iff φ is valid on all serial frames (i.e. all frames 〈W,R〉 where R is serial in W) • φ is T-valid iff φ is valid on all reflexive frames • φ is B-valid iff φ is valid on all reflexive and symmetric frames (i.e., on all frames 〈W,R〉 where R is reflexive in W and transitive)


119

• φ is S4-valid iff φ is valid on all reflexive and transitive frames • φ is S5-valid iff φ is valid on all equivalence frames (i.e., on all frames 〈W,R〉 where R is an equivalence relation on W) As with the ` notation, we subscript with the name of a system to indicate validity in that system; thus, “T φ” means that φ is T-valid. Of course, we would only define validity for these systems in this way if we could prove soundness and completeness relative to the definitions. We’ll do this below; but first, we’ll spend a bit of time working with these definitions.

6.4.4

Semantic validity proofs

Given our definition of validity, one can now prove that a certain formula is valid in a given system. First, a very simple example. Let us prove that the formula 2(P ∨∼P ) is K-valid. That is, we must prove that this formula is valid in every frame, since that is the definition of K-validity. Being valid in a frame means being true at every world in every model based on every frame. So, consider any frame 〈W, R〉, consider any model, M, based on that frame, and let w be any world in W. We must prove that VM (2(P ∨∼P ), w) = 1. (As before, I’ll start to omit the subscript M on VM when it’s unambiguous which model we’re talking about.) i) Suppose for reductio that V(2(P ∨∼P ), w) = 0 ii) So, by the truth condition for the 2, there is some world, v, such that Rwv and V(P ∨∼P, v) = 0 iii) But that’s impossible; since the truth conditions for the ∨ and the ∼ are just the usual ones, P ∨∼P is true in any world whatsoever Another example: let’s show that T (32(P →Q)∧2P )→3Q. We must show that V((32(P →Q)∧2P )→3Q, w) = 1 for the valuation V on an arbitrarily chosen model and world w in that model. i) Assume for reductio that V((32(P →Q)∧2P )→3Q, w) = 0 ii) So V(32(P →Q)∧2P, w) = 1 and … iii) …V(3Q, w) = 0


120

iv) From ii), 32(P →Q) is true at w, and so V(2(P →Q), v) = 1, for some world, call it v, such that Rwv v) From ii), V(2P, w) = 1. So, by the truth condition for the 2, P is true in every world accessible from w; since Rwv, it follows that V(P, v) = 1. vi) From iv), P →Q is true in every world accessible from v; since our model is a T-model, R is reflexive. So Rv v; and so V(P →Q, v) = 1 vii) From v) and vi), by the truth condition for the →, V(Q, v) = 1 viii) Given iii), Q is false at every world accessible from w; this contradicts vii) OK, we’ve shown that the formula (32(P →Q)∧2P )→3Q is valid in T. Suppose we were interested in showing that this formula is also valid in S4. What more would we have to do? Nothing! To be S4-valid is to be valid in every reflexive-and-transitive frame; since every reflexive-and-transitive frame is reflexive, we know automatically that the formula is S4-valid, without doing a separate proof. Think of it another way. To do a proof that the formula is S4-valid, we need to do a proof in which we are allowed to assume that the accessibility relation is both transitive and reflexive. And the proof above did just that. We didn’t ever use the fact that the accessibility relation is transitive — we only used the fact that it is reflexive (in line 9). But we don’t need to use everything we’re allowed to assume. In contrast, the proof above doesn’t establish that this formula is, say, K-valid. To be K-valid, the formula would need to be valid in all K-frames. But Kframes needn’t have reflexive accessibility relations, whereas the proof we gave assumed that the accessibility relation was reflexive. And in fact the formula isn’t in fact K-valid, as we’ll show how to demonstrate in the next section.


121

Consider the following diagram of systems: = S5 `@@ @@ || | | @@ || B S4 aB ~> BB ~ ~ BB B ~~~ TO

DO K An arrow from one system to another indicates that validity in the first system implies validity in the second system. For example, if a formula is D-valid, then it’s also T-valid. The reason is that if something is valid on all D-frames, then, since every T-frame is also a D-frame (since reflexivity implies seriality), it must be valid on all T-frames as well. S5 is the strongest system, since it has the most valid formulas. (That’s because it has the fewest frames — it’s easier to be an S5 theorem because there are fewer potentially falsifying frames.) Notice that the diagram isn’t linear. That’s because of the following. Both B and S4 are stronger than T; each contains all the T-valid formulas. But neither B nor S4 is stronger than the other — each contains valid formulas that the other doesn’t. (They of course overlap, because each contains all the T-valid formulas.) S5 is stronger than each; S5 contains all the valid formulas of each. These relationships between the systems will be exhibited below. Suppose you are given a formula, and for each system in which it is valid, you want to give a semantic proof of its validity. This needn’t require multiple semantic proofs — as we have seen, one semantic proof can do the job. To prove that a certain formula is valid in a number of systems, it suffices to prove that it is valid in the weakest possible system. Then, that very proof will automatically be a proof that it is valid in all stronger systems. For example, a proof that a formula is valid in K would itself be a proof that the formula is D, T, B, S4, and S5-valid. Why? Because every frame of any kind is a K-frame, so K-valid formulas are always valid in all other systems. In general, then, to show what systems a formula is valid in, it suffices to give a single semantic proof of it: in the weakest system in which it is valid.


122

There is an exception, however, since neither B nor S4 is stronger than the other. Suppose a formula is not valid in T, but one has given a semantic proof its validity in B. This proof also establishes that the formula is also valid in S5, since every S5 model is a B-model. But one still doesn’t yet know whether the formula is S4-valid, since not every S4-model is a B-model. Another semantic proof may be needed: of the formula’s S4-validity. (Of course, the formula may not be S4-valid.) So: when a wff is valid in both B and S4, but not in T, two semantic proofs of its validity are needed. I’ll present some more sample validity proofs below, but it’s often easier to do proofs of validity when one has failed to construct a counter-model for a formula. So let’s look first at counter-modeling.

6.4.5

Countermodels in MPL

We have a definition of validity for the various systems, and we’ve shown how to establish validity of particular formulas. Now we’ll investigate establishing invalidity. Let’s show that the formula 3P →2P is not K-valid. A formula is K-valid if it is valid in all K-frames, so all we must do is find one K-frame in which it isn’t valid. What follows is a procedure for doing this:6 Place the formula in a box The goal is to find some frame, some valuation for that frame, and some world in the frame, where the formula is false. Let’s start by drawing a box, which represents some chosen world in the frame we’ll construct. The goal is to make the formula false in this world. In these examples I’ll always call this first world “r”: r

3P →2P

Now, since the box represents a world, we should have some way of representing the accessibility relation — what worlds does world r “see”? Well, to represent one world (box) seeing another, we’ll draw an arrow from the first to the second. However, we don’t need to make this world r see anything. After all, we’re 6

This procedure is from Cresswell and Hughes (1996b).


123

trying to construct a K-model, and the accessibility relation of a K-model doesn’t even need to be serial — nothing need see anything. So, we’ll forget about arrows for the time being. Make the formula false in the world We will indicate a formula’s truth value (1 or 0) by writing it above the formula’s major connective. So to indicate that 3P →2P is to be false in this model, we’ll put a 0 above its arrow: r

0

3P →2P

Enter in forced truth values If we want to make the 3P →2P false in this world, the definition of a valuation function requires us to assign certain other truth values. Whenever a conditional is false at a world, its antecedent is true at that world and its consequent is false at that world. So, we’ve got to enter in more truth values; a 1 over the major connective of the antecedent (3P ), and a 0 over the major connective of the consequent (2P ): r

1

0 0

3P →2P

Enter asterisks When we assign a truth value to a modal formula, we thereby commit ourselves to assigning certain other truth values to various formulas at various worlds. For example, when we make 3P true at r, we commit ourselves to making P true at some world that r sees. To remind ourselves of this commitment, we’ll put an asterisk (*) below 3P . An asterisk below indicates a commitment to there being some world of a certain sort. Similarly, since 2P is false at r, this means that P must be false in some world P sees (if it were true in all such worlds, then by the semantic clause for the 2, 2P would be true at r). We again have a commitment to there being some world of a certain sort, so we enter an asterisk below 2P as well:


1

r

124

0 0

3P →2P ∗ ∗

Discharge bottom asterisks The next step is to fulfill the commitments we incurred by adding the bottom asterisks. For each, we need to add a world to the diagram. The first asterisk requires us to add a world in which P is true; the second requires us to add a world in which P is false. We do this as follows: 1

r

~~ ~~ ~ ~~ ~~ ~ ~ a 1

P

0 0

3P →2P ∗ ∗

@@ @@ @@ @@ @@ b

0

P

What I’ve done is added two more worlds to the diagram: a and b. P is true in a, but false in b. I have thereby satisfied my obligations to the asterisks on my diagram, for r does indeed see a world in which P is true, and another in which P is false. The official model We now have a diagram of a K-model containing a world in which 3P →2P is false. But we need to produce an official model, according to the official definition of a model. A model is an ordered triple 〈W, R,I〉, so we must specify the model’s three members. The set of worlds We first must specify the set of worlds, W. W is simply the set of worlds I invoked: W = {r, a, b} But what are r, a, and b? Let’s just take them to be the letters ‘r’, ‘a’, and ‘b’. No reason not to — the members of W, recall, can be any things whatsoever.


125

The accessibility relation Next, for the accessibility relation. Here, we need to write down what the arrows in the diagram represent. What do they represent? They represent that r “sees” a, and that r sees b. There are no other arrows in the diagram, so no other world sees anything else. Now, remember that the accessibility relation, like all relations, is a set of ordered pairs. So, we simply write out this set: R = {〈r, a〉, 〈r, b〉} That is, we write out the set of all ordered pairs 〈w1 , w2 〉 such that w1 “sees” w2 . The valuation function Finally, we need to specify the modal assignment function, A, which assigns truth values to sentence letters at worlds. In our model, A must assign 1 to P at world a, and 0 to P at world b. Now, our official definition requires an assignment function to assign a truth value to each of the infinitely many sentence letters at each world; but so long as P is true at a and false at b, it doesn’t matter what other truth values A assigns. So let’s just (arbitrarily) choose to make all other sentence letters false at all worlds in the model. We have, then: V(P, a) = 1 V(P, b) = 0 for all other sentence letters α and worlds w, V(α, w) = 0 So, that’s it — we’ve produced the model. Check the model At the end of this process, it’s a good idea to check to make sure that your model is correct. This involves various things. First, make sure that you’ve succeeded in producing the correct kind of model. For example, if you’re trying to produce a T-model, make sure that the accessibility relation you’ve written down is reflexive (we were only doing a K-model in this case, remember). Secondly, make sure that the formula in question really does come out false at one of the worlds in your model.


126

Simplifying models Sometimes a model can be simplified. Consider the diagram of the final version of the model above: 1

r

0 0

3P →2P ∗ ∗

@@ @@ @@ @@ @@

~~ ~~ ~ ~ ~~ ~ ~~ a 1

b

P

0

P

We needn’t have used three worlds in the model. When we discharged the first asterisk, we needed to put in a world that r sees, in which P is true. But we needn’t have made that a new world — we could have simply have made P true in r. Of course we couldn’t haven’t done that for both asterisks, because that would have made P both true and false at r. So, we could make one simplification: 1 1 0 0

r

0

3P →2P ∗ ∗

b

0

P

The official model would then look as follows: W : {r, b} R : {〈r, r〉, 〈r, b〉} V(P, r) = 1; otherwise, everything false Adapting models to different systems We have showed that 3P →2P is not K-valid. Now, let’s show that this formula isn’t D-valid, i.e. that it is false in some world of some model with a serial accessibility relation (i.e., some “D-model”). Well, we haven’t quite done this, since the model above does not have a serial accessibility relation. But we can easily change this, as follows:


127

1 1 0 0

3P →2P ∗ ∗

r

0

b

0

0

P

Official model: W : {r, b} R : {〈r, r〉, 〈r, b〉, 〈b, b〉} V(P, r) = 1; otherwise, everything false That was easy — adding the fact that b sees itself didn’t require changing anything else in the model. Suppose we want now to show that 3P →2P isn’t T-valid. Well, we’ve already done so! Why? Because we’ve already produced a T-model in which this formula is false. Look back at the most recent model. Its accessibility relation is reflexive. So it’s a T-model already. In fact, that accessibility relation is also already transitive, so it’s already an S4-model. So we know that the formula isn’t S4-valid. It’s easy to revise the model to make the accessibility relation symmetric: 1 1 0 0

r

0

3P →2P ∗ ∗ O

b

0

0

P

Official model: W: {r,b} R: {〈r,r〉,〈r,b〉,〈b,b〉,〈b,r〉} V(P, r) = 1; otherwise, everything false


128

Now, we’ve got a B-model, too. What’s more, we’ve also got an S5-model: notice that the accessibility relation is an equivalence relation. (In fact, it’s also a total relation.) So, we’ve succeeded in establishing that 3P →2P is not valid in any of our systems. However, we could have done the same thing much more quickly, if we had given this final model in the first place. After all, this model is an S5, S4, B, T, D, and K-model. So one model establishes that the formula isn’t valid in any of the systems. In general, in order to establish that a formula is invalid in a number of systems, try to produce a model for the strongest system (i.e., the system with the most requirements on models). If you do, then you’ll automatically have a model for the weaker systems. Keep in mind the diagram of systems: S5 `@ @@ |= @@ || | | @ | S4 aB >B BB ~~ ~ BB B ~~~ TO DO K An arrow from one system to another, recall, indicates that validity in the first system implies validity in the second. The arrows also indicate facts about invalidity, but in reverse: when an arrow points from one system to another, then invalidity in the second system implies invalidity in the first. For example, if a wff is invalid in T, then it is invalid in D. (That’s because every T-frame is a D-frame, and hence every T-countermodel is a D-countermodel.) When our task is to discover which systems a given formula is invalid in, usually only one countermodel will be needed — a countermodel in the strongest system in which the formula is invalid. But there is an exception involving B and S4. Suppose a given formula is valid in S5, but we discover a model showing that it isn’t valid in B. That model is automatically a T, D, and K-model, so we know that the formula isn’t T, D, or K-valid. But we don’t yet know about that formula’s S4-validity. If it is S4-invalid, then we will need to produce a second countermodel, an S4 countermodel. (Notice that


129

the B-model couldn’t already be an S4-model. If it were, then its accessibility relation would be reflexive, symmetric, and transitive, and so it would be an S5 model, contradicting the fact that the formula was S5-valid.) Additional steps in countermodelling I gave a list of steps in constructing countermodels: 1. Place the formula in a box 2. Make the formula false in the world 3. Enter in forced truth values 4. Enter asterisks 5. Discharge bottom asterisks 6. The official model We’ll need to adapt this list. Above asterisks Let’s try to get a countermodel for 32P →23P in all the systems in which it is invalid, and a semantic validity proof in all the systems in which it is valid. We always start with countermodelling before doing semantic validity proofs, and when doing countermodelling, we start by trying for a K-model. After the first few steps, we have: 1

r

a

1

2P

0 0

32P →23P ∗ ∗

y yy yy y y yy y |y

EE EE EE EE EE E" b

0

3P

At this point, we’ve got a true 2, and a false 3. Take the first: a true 2P . This doesn’t commit us to adding a world in which P is true; rather, it commits us to making P true in every world that a sees. Similarly, a zero over a 3, over 3P in world b in this case, commits us to making P false in every world that b sees. We indicate such commitments, commitments in every world seen, by putting asterisks above the relevant modal operators:


1

r

0 0

32P →23P ∗ ∗

BB BB BB BB BB BB !

|| || | || || | }| |

∗ 1

a

130

2P

∗ 0

b

3P

Now, how can we discharge these asterisks? In this case, when trying to construct a K-model, we don’t need to do anything. Since a, for example, doesn’t see any world, then automatically P is true in every world it sees; the statement “for every world, w, if Raw then V(P, w) = 1” is vacuously true. Same goes for b — P is automatically false in all worlds it sees. So, we’ve got a K-model in which 32P →23P is true. But now suppose we try to turn the model into a D-model. Every world must now see at least one world. Let’s try: 1

r

|| || | || || | }| |

∗ 1

a

2P

c

0

0 0

32P →23P ∗ ∗

BB BB BB BB BB BB !

∗ 0

b

3P

1

0

P

d

0

P

I added worlds c and d, so that a and b would each see at least one world. (Further, worlds c and d each had to see a world, to keep the relation serial. I could have added still more worlds that c and d saw, but then they would themselves need to see some worlds…So I just let c and d see themselves.) But once c and d were added, discharging the upper asterisks in worlds a and b required making P true in c and false in d (since a sees c and b sees d). Let’s now try for a T-model. This will involve, among other things, letting


131

a and b see themselves. But this gets rid of the need for worlds c and d, since they were added just to make the relation serial. I’ll try: 1

r

0

∗ 1 1

a

0

2P

0 0

32P →23P ∗ ∗

| || || | || || | } |

BB BB BB BB BB BB ! b

0

∗ 0 0

3P

When I added arrows, I needed to make sure that I correctly discharged the asterisks. This required nothing of world r, since there were no top asterisks there. There were top asterisks in worlds a and b; but it turned out to be easy to discharge these asterisks — I just needed to let P be true in a, but false in b. Notice that I could have moved straight to this T-model — which is itself a D-model — rather than first going through the earlier mere-D-model. However, this won’t always be possible — sometimes you’ll be able to get a D-model, but no T-model. At this point let’s verify that our model does indeed assign the value 0 to our formula 32P →23P . First notice that 2P is true in a (since a only sees one world — itself — and P is true there). But r sees a. So 32P is true at r. Now, consider b. b only sees one world, itself, and P is false there. So 3P must also be false there. But r sees b. So 23P is false at r. But now, the antecedent of 32P →23P is true, while its consequent is false, at r. So that conditional is false at r. Which is what we wanted. Onward. Our model is not a B-model, since a, for example, doesn’t see r, despite the fact that r sees a. So let’s try to make this into a B-model. This involves making the relation symmetric. Here’s how it looks before I try to


132

discharge the top asterisks in a and b: 1

r

|= || | || || | | }| | 0

∗ 1 1

a

0

0 0

32P →23P ∗ ∗

2P

aBB BB BB BB BB BB ! b

0

∗ 0 0

3P

Now I need to make sure that all top asterisks are discharged. For example, since a now sees r, I’ll need to make sure that P is true at r. However, since b sees r too, P needs to be false at r. But P can’t be both true and false at r. So we’re stuck, in trying to get a B-model in which this formula is false. This suggests that maybe it is impossible — that is, perhaps this formula is true in all worlds in all B-models — that is, perhaps the formula is B-valid. (In fact, it is; one would suspect this because the formula is the result, roughly, of applying the B-axiom, and then afterwards the theorem B3. But since we haven’t proved soundness, we haven’t yet proved any connection between theoremhood and validity.) So, the thing to do is try to prove this: by supplying a semantic validity proof. So, let 〈W,R〉 be any reflexive-and-symmetric frame, let V be any valuation function, and let w be any member of W; we must show that V(32P →23P, w) = 1. i) Suppose for reductio that V(32P →23P, w) = 0 ii) Then V(32, w) = 1 and … iii) …V(23P, w) = 0 iv) By i), for some v, Rwv and V(2P, v) = 1. v) By symmetry, Rv w. vi) From iv), via the truth condition for 2, we know that P is true at every world accessible from v; and so, by v), V(P, w) = 1. vii) By iii), there is some world, call it u, such that Rw u and V(3P, u) = 0.


133

viii) By symmetry, w is accessible from u. ix) By vi), P is false in every world accessible from u; and so by viii), V(P, w) = 0, contradicting vi) Just as we suspected: the formula is indeed B-valid. So we know that it is S5-valid (the proof we just gave was itself a proof of its S5-validity). But what about S4-validity? Remember the diagram — we don’t have the answer yet. The thing to do here is to try to come up with an S4-model, or an S4 semantic validity proof. Usually, the best thing to do is to try for a model. In fact, in the present case this is quite easy: our T-model is already an S4-model. So, we’re done. Our answer to what systems the formula is valid and invalid in comes in two parts: Invalidity: we have an S4-model, which we put down officially as follows: W = {r,a,b} R = {〈r,r〉,〈a,a〉,〈b,b〉,〈r,a〉,〈r,b〉} V(P, a) = 1, all others false This model is itself also a T, D, and K-model (since its accessibility relation is reflexive and serial), so we’ve shown that the formula is K, D, T, and S4-invalid. Validity: we gave a semantic proof of B-validity above. This was itself a proof of S5-validity, as I noted. I’ll do one more example: 32P →3232P . We can get a T-model as follows:


134

∗ 1

32P →3232P ∗ ∗

r

0

Notice how commitments to specific truth values for different formulas are recorded by placing the formulas side by side in the box

0 0 0

∗ 1 1

0

2P

a

232P ∗

0

~

∗ 0 0

b

0

I discharged the second bottom asterisk in r by letting r see b

1

32P ∗

P

c

0

0

P

Official model: W = {r, a, b, c} R = {〈r, r〉, 〈a, a〉, 〈b, b〉, 〈c, c〉, 〈r, a〉, 〈r, b〉, 〈a, b〉, 〈b, c〉} V(P, b) = 1, all else 0 Now consider what happens when we try to turn this model into a B-model. World b must see back to world a. But then the false 32P in b conflicts with the true 2P in a. So it’s time for a validity proof. In constructed this validity proof, we can be guided by failed attempt to construct a countermodel (assuming all of our choices in constructing that countermodel were forced). In the following proof that the formula is B-valid, I chose variables for worlds that match up with the countermodel above: i) Suppose for reductio that V(32P →3232P, r ) = 0, in some world r in some B-model 〈W, R,V〉 ii) So V(32P, r ) = 1 and . . .


135

iii) V(3232P, r ) = 0 iv) From ii), there’s some world, call it a, such that V(2P, a) = 1 and Rra v) From iii), since Rra, V(232P, a) = 0 vi) And so, there’s some world, call it b , such that V(32P, b ) = 0 and Rab vii) By symmetry, Rb a. And so, given vi), V(2P, a) = 0. This contradicts iv) We now have a T-model for the formula, and a proof that it is B-valid. The B-validity proof shows the formula to be S5-valid; the T-model shows it to be K- and D-invalid. We still don’t yet know about S4. So let’s return to the T-model above, and see what happens when we try to make its accessibility relation transitive. World a must then see world c, which is impossible since 2P is true in a and P is false in c. So we’re ready for a S4-validity proof (the proof looks like the B-validity proof at first, but then diverges): i) Suppose for reductio that V(32P →3232P, r ) = 0, for some world r in some S4-model 〈W , R,V 〉 ii) So V(32P, r ) = 1 and . . . iii) V(3232P, r ) = 0 iv) From ii), there’s some world, call it a, such that V(2P, a) = 1 and Rra v) From iii), since Rra, V(232P, a) = 0 vi) And so, there’s some world, call it b , such that V(32P, b ) = 0 and Rab vii) By reflexivity, Rb b , so given vi), V(2P, b ) = 0 viii) And so, there’s some world, call it c, such that V(P, c) = 0 and Rb c. ix) From vi) and viii), given transitivity, we have Rac. And so, given iv), V(P, c) = 1, contradicting viii)


136

Daggers There’s another kind of step in constructing models. When we make an arrow false, then we’re forced to enter certain truth values for its components: 1 on the antecedent, 0 on the consequent. But consider making a disjunction true. This can happen in more than one way. The first disjunct might be true, or the second might be true, or both could be true. Similarly for true or false biconditionals, true conditionals, and false conjunctions. Consider constructing a countermodel for 2(P ∨Q)→2P ∨2Q. We’ll start by making the antecedent true. Let’s try for a T-model; so we must make P ∨Q true at r, since r sees itself. We put a dagger below the ∨, signifying that we’ve got a choice to make there. We’ll wait to make it as long as possible. Now, we must make the consequent false too. That means making both disjuncts false, which gives us two bottom asterisks. Let’s wait to discharge them. And first, let’s try one of the two possible choices for discharging the dagger — making P true at r: 1

r

0

1 1

0

0

0 0

2(P ∨Q)→(2P ∨2Q) † ∗ ∗

Now, we need to think about discharging the asterisks. The second can be discharged by making Q false at r. The first cannot be done that way because we’ve already made P true at r. So we’ll add another world: ∗ 1

r

0

1 1

0

0

0 0 0

2(P ∨Q)→(2P ∨2Q) † ∗ ∗ a

0

0

P

Now, however, we’ve got to go back and discharge the top asterisk in r — we’ve got to make P ∨Q true in a:


137

∗ 1

1 1

0

0

0 0 0

2(P ∨Q)→(2P ∨2Q) † ∗ ∗

r

0

0 1

P ∨Q †

a

0

Now, however, it’s easy to discharge the dagger, because our hand is forced — we’ve already got P false in a, so Q must be true in a. Moreover, we can make r accessible from a without messing up anything. So, we get this: ∗ 1

r

0

1 1

0

0

0 0 0

2(P ∨Q)→(2P ∨2Q) † ∗ ∗ O 0 1 1 a

0

P ∨Q †

And that’s the final picture. So, the official S5-model is: W = {r,a} R = {〈r,r〉,〈a,a〉,〈r,a〉} V(P, r) = 1, V(Q, a) = 1, all else false Summary of steps Here, then, is a final list of the steps for constructing countermodels: 1. Place the formula in a box 2. Make the formula false in the world 3. Enter in forced truth values 4. Enter in daggers, and after all forced moves over


138

5. Enter asterisks 6. Discharge asterisks (hint: do bottom asterisks first) 7. Back to step 3. 8. The official model

6.5

Soundness in MPL7

At this point, for each of our modal systems, we have a definition of ‘validity’. The hope in giving these definitions of validity is that they’ll match up with the axiomatic definitions of theoremhood already given — that is, we hope that a formula is a T-theorem (for example), iff it is T-valid, under the definition of T-validity given above. That is, we hope that soundness and completeness hold for T, and all the other systems. These hopes are in fact satisfied; in fact, the K-theorems are exactly the K-validities; the D-theorems are exactly the D-validities, etc. This striking correspondence between the formal properties (i.e. seriality, reflexivity, etc.) of the accessibility relation and the various systems was discovered by Saul Kripke and others in the late 1950s, and was a major advance in the history of modal logic. This discovery has practical as well as theoretical value. First, once we’ve proved soundness, we will for the first time have a method for establishing that a given formula is not a theorem: construct a countermodel for that formula, thus establishing that the formula is not valid, and then conclude via soundness that the formula is not a theorem. Second, given completeness, if we want to know that a given formula is a theorem, it suffices to show that it is valid. Since semantic validity proofs are comparatively easy to construct, it’s nice to be able to use them rather than axiomatic proofs to establish logical truth. We seek, then, to prove soundness and completeness, which are, in the case of K, the following: Soundness every K-theorem is K-valid Completeness every K-valid formula is a K-theorem As before, soundness will be much easier, so we’ll start with that. We’re going to prove a general result, which we’ll use in several soundness proofs. Where Γ is any set of modal wffs, let’s call “K+Γ” the axiomatic system that consists of 7

Proof adapted from Cresswell and Hughes (1996a).


139

the same rules of inference as K (MP and NEC), and which has as axioms the axioms of K (the K axioms plus the PL axioms), plus the members of Γ. Here is the theorem: Theorem 6.1 If Γ is any set of modal wffs and 〈W,R〉 is a frame on which each wff in Γ is valid, then every theorem of K+Γ is valid in 〈W,R〉. The reason we’re interested in this general result is this: nearly all the systems commonly discussed by modal logicians are extensions of K in that they consist of K, with the same rules, plus some extra axioms. These are called “normal systems”. The nice thing about Theorem 6.1 is that it gives us a strategy for constructing soundness proofs for such systems. Consider, for example, the system K + {2φ→φ : φ is an MPL wff} — i.e., system T. To establish soundness for T, all we need to do is show that all the axioms are valid in all reflexive frames; for we may then conclude by Theorem 6.1 that every theorem of T is valid on all reflexive frames. To prove Theorem 6.1, we will first prove two lemmas: Lemma 6.2 All PL and K-axioms are valid on all frames Lemma 6.3 MP and Necessitation preserve validity on any given frame Theorem 6.1 then follows: Assume that every wff in Γ is valid on a given frame 〈W,R〉, and consider any theorem φ of K+Γ. That theorem is a last line in a proof in which each lines is either an axiom, or follows from earlier lines in the proof by MP or NEC. Axioms of K+Γ are either PL axioms, K axioms, or members of Γ. The first two classes of axioms are valid on all frames, by Lemma 6.2; and the final class of formulas are valid on the frame 〈W,R〉. Thus, all axioms in the proof of φ are valid on 〈W,R〉. By Lemma 6.3, the rules of inference in the proof preserve validity on 〈W,R〉. Therefore, φ is valid on 〈W,R〉. It now remains to prove the lemmas. Proof of Lemma 6.2 We already know that the PL axioms are valid under the original definition of PL. But the truth conditions at a world are just like the plain old truth conditions for PL. Thus, the PL axioms are valid on all frames. We need now to show


140

that any K axiom — i.e., any formula of the form 2(φ→ψ)→ (2φ→2ψ) — is valid on any frame. So, let 〈W,R〉 be any frame, and let w be any member of W, and suppose for reductio that this conditional isn’t valid on 〈W,R〉; then there’s some V, and some w in W, such that V(2(φ→ψ)→(2φ→2ψ), w) = 0, which in turn means, by the truth condition for →, that V(2(φ→ψ), w) = 1 V((2φ→2ψ), w) = 0, and so V(2φ, w) = 1 and V(2ψ, w) = 0. But now let’s apply the truth condition for 2 to what we’ve got here: At every v such that Rwv (“accessible from w”), φ→ψ is true At every v accessible from w, φ is true At some v accessible from w, ψ is false But that can’t be, because the conditional φ→ψ is false at a world if its antecedent is true and its consequent is false. Proof of Lemma 6.3 First MP. Let φ and φ→ψ be valid on a frame 〈W,R〉; we must show that ψ is also valid on that frame. That is, where V is any valuation function, and w is any member of W, we must show that V(ψ, w) = 1. Since φ and φ→ψ are valid on this frame, V(φ→ψ, w) = 1, and V(φ, w) = 1; but by the truth condition for →, V(ψ, w) must also be 1. Next NEC. Let φ be valid on a frame 〈W,R〉, let V be any valuation, and let w be any world in W. We must show that V(2φ, w) = 1, which means showing that V(φ, v) = 1, where v is any world accessible from w. But V(φ, v) = 1 for any world v and any valuation V (since φ is valid on this frame). Now the proofs of soundness for the individual systems:

6.5.1

Soundness of K

K’s soundness follows immediately from Theorem 6.1.

6.5.2

Soundness of D

Given Theorem 6.1, since D = K + {the D axioms}, all we must do is show that all the D-axioms are valid on all serial frames.


141

So, let 〈W,R〉 be any serial frame, let V be any valuation function, and let w be any member of W; we must show that V(2φ→3φ, w) = 1. i. The truth condition for → says that the only way for a conditional to be false is for it to have a true antecedent and false consequent. So, let’s assume that the antecedent is true, and show that its consequent must be true as well. So, let’s assume V(2φ, w) = 1 ii. From i, φ is true at every world accessible from w. (Truth condition for 2) iii. But since R is serial, some v is accessible from w. iv. By ii, V(φ, v) = 1. v. But that means that V(3φ, w) = 1 (Truth condition for 3). vi. Thus, V(2φ→3φ, w) = 1 Note that we are not giving axiomatic proofs of things; we’re proving a fact about the system D in the metalanguage. We are free to use whatever pattern of reasoning seems appropriate; the combination of conditional proof, reductio ad absurdum, and free-wheeling intuition used here is perfectly acceptable. Notice that I appealed to the truth condition for the non-primitive connective 3; that’s fine. Thus, every D-axiom is valid in all serial frames. And so, we can conclude from theorem 6.1 that every D-theorem is valid in all serial frames — this is the claim of soundness for D.

6.5.3

Soundness of T

We must show that all T axioms are valid in all reflexive frames. So, we need to show V(2φ→φ, w) = 1, for arbitrary W, R, V, and w ∈ W. In virtue of the truth condition for →, it suffices to show that if 2φ is true at w, then so is φ: i. Assume 2φ is true at w ii. Then φ is true at every world accessible from w (truth condition for 2) iii. But w is accessible from w (reflexivity) iv. So φ is true at w


6.5.4

142

Soundness of B

Choose an arbitrary W, R, V, and w ∈ W; we must show the T and B axioms to be true at w under V, under the assumption that R is reflexive and symmetric. The proof of the previous section shows that the T-axiom is true at w. Now for the B axiom: i. Assume V(32φ, w) = 1. ii. So, V(2φ, v) = 1, for some v such that Rwv. iii. Since Rwv, we have Rv w, by symmetry of R. iv. From ii, we know that φ is true in every world accessible from v. v. So, from iii and iv, φ is true at w.

6.5.5

Soundness of S4

Choose an arbitrary W, R, V, and w ∈ W; we must show the T and S4 axioms to be true at w under V, under the assumption that R is reflexive and transitive. We know from above that the T-axioms are true at w, since R remains reflexive. Now for the S4 axioms: i. Assume 2φ is true at w. So φ is true at every world accessible from w. ii. To show that 22φ is true at w, we must show that 2φ is true at every world accessible from w. Let v be any such world. iii. To show that 2φ is true at v, we must show that φ is true at every world accessible from v. Let u be any such world. iv. By transitivity, since Rwv and Rv u, we have Rw u. v. From i and iv, φ is true at u.

6.5.6

Soundness of S5

Choose an arbitrary W, R, V, and w ∈ W; we must show the T and S5 axioms to be true at w under V, under the assumption that R is reflexive, transitive, and symmetric. We know from above that the T-axioms are true at w, since R remains reflexive. Now for the S5 axioms:


143

i. Assume V(32φ, w) = 1 — so 2φ is true at some world, v, accessible from w. ii. To show V(2φ, w) = 1, we must show that V(φ, u) = 1 for an arbitrarily chosen u such that Rw u. iii. By symmetry, Ru w; since we now have Rwv and Ruw, by transitivity we have Ruv; and by symmetry we have Rv u. iv. From i, φ is true at every world accessible from v v. From iii and iv, we know that φ is true at u. And so we’re done; we now know that soundness holds for all systems in question. The method of countermodels, therefore, is a method for establishing non-theoremhood. If, for example, we can locate a reflexive frame in which a given formula is not valid, we can conclude that the formula is not T-valid, and hence, by soundness, not a T-theorem.

6.6

Completeness of MPL8

We will now prove completeness for each modal system. As with the soundness proof, most of the work will go into developing some general-purpose machinery. At the end we’ll then use the machinery to construct completeness proofs for each system. We’ll be constructing a kind of completeness proof known as a “Henkinproof”, after Leon Henkin, who used similar methods to demonstrate completeness for (nonmodal) predicate logic.

6.6.1

Canonical models

Let us extend our terminology by saying that a formula is valid on a model (as opposed to valid on a frame) iff it is true at every world in that model. For certain systems, S, we’re going to make use of certain kinds of models, canonical models, which will have the following feature: A formula is valid in the canonical model for S iff it is a theorem of S 8

Proof (including the numbering of lemmas and theorems) adapted from Cresswell and Hughes (1996a).


144

That’s an important connection, which the following example brings out. Suppose we can come up with a canonical model for T. Suppose further that we can show that this model has got a reflexive frame. Then, we know that every T-valid formula is valid in that model, by definition of T-validity. But then we know that every T-valid formula is a theorem of T, since the model is canonical. So we would have established completeness for T. We want to construct canonical models for various systems. The trick will be to let the worlds in question be constructed out of sets of formulas of modal logic — remember that worlds are allowed to be anything we like. When we specify the valuation function, we’ll say that a formula is true at a world iff the formula is a member of the set that is the world. Working out this idea will occupy us for awhile.

6.6.2

Maximal consistent sets of wffs

To carry out this idea of constructing worlds as sets of formulas that are true at those worlds, we’ll need to put some constraints on the nature of these sets of wffs. It’s part of the definition of a valuation function that for any wff φ and any world w, either φ or ∼φ is true at the world. That means that any set of wffs that we’re going to call a world had better contain either φ or ∼φ. Moreover, it can’t contain both, since a formula can’t be both true and false at a world. Other constraints must be introduced as well. So, let’s proceed as follows. Let S be any system. A set of wffs, Γ, is S-inconsistent iff for some finite sequence φ1 , …,φn ∈ Γ, `S ∼(φ1 ∧ · · · ∧φn ) In other words, a set is S-inconsistent if it contains some wffs (finite in number) that are provably (in S) contradictory. A set of wffs, Γ, is maximal iff for every wff φ, either φ or ∼φ is a member of Γ A set is maximal S-consistent, then, if it is both maximal and S-consistent. Such sets may be used as worlds, as the following lemma begins to show: Lemma 6.1 Let Γ be a maximal S-consistent set of wffs. Then: 6.1a for any wff φ, exactly one of φ, ∼φ is in Γ


145

6.1b φ→ψ is in Γ iff either φ is not in Γ or ψ is in Γ 6.1c if φ and φ→ψ are both members of Γ then so is ψ Proof of Lemma 6.1: 6.1a: we know from the definition of maximality that at least one of φ or ∼φ is in Γ. But it cannot be that both are in Γ, for then Γ would be S-inconsistent (it would contain the finite subset {φ,∼φ}; but since all modal systems incorporate propositional logic, it is a theorem of S that ∼(φ∧∼φ).) 6.1b. Suppose first that φ→ψ is in Γ, and suppose for reductio that φ is in Γ but ψ is not. Then, by 6.1a, ∼ψ is in Γ; but now Γ is S-inconsistent by containing the subset {φ,φ→ψ,∼ψ}. Suppose for the other direction that either φ is not in Γ or ψ is in Γ, and suppose for reductio that φ→ψ isn’t in Γ. By 6.1a, ∼(φ→ψ) is in Γ. Now, if φ ∈ / Γ then ∼φ ∈ Γ, but then Γ would contain the S-inconsistent subset {∼(φ→ψ),∼φ}. And if on the other hand, ψ ∈ Γ then Γ again contains an S-inconsistent subset: {∼(φ→ψ),ψ}. Either possibility contradicts Γ’s S-consistency. 6.1c. Direct consequence of 6.1b. Another Lemma: Lemma 6.2 Where Γ is any maximal S-consistent set of wffs, 6.2a if `S φ then φ ∈ Γ 6.2b if φ ∈ Γ and `S φ→ψ then ψ ∈ Γ Proof of Lemma 6.2: 6.2a; if `S φ then Γ cannot contain ∼φ, for otherwise it would not be S-consistent. Thus, by maximality, Γ contains φ. 6.2b: if `S φ→ψ then by 6.2a, φ→ψ is in Γ; but then by 6.1c, ψ ∈ Γ.

6.6.3

Maximal consistent extensions

Next let’s show that if we begin with an S-consistent set ∆, we can expand it into a maximal consistent set: Theorem 6.3 Let ∆ be an S-consistent set of wffs. Then there’s some maximal S-consistent set of wffs, Γ, such that ∆ ⊆ Γ Proof of Theorem 6.3: In outline, we’re going to construct Γ as follows. We’re going to start with the formulas in ∆, and we’re then going to go through all the wffs in the language of MPL, φ1 , φ2 ,…, one at a time. For each of these


146

wffs, we’re going to add in either it or its negation, depending on which choice would be S-consistent. After we’re done, we’ll have our set Γ. It will obviously be maximal; it will obviously contain ∆ as a subset; and, we’ll show, it will also be S-consistent. So, let φ1 , φ2 ,…be a list — an infinite list, of course — of all the wffs of MPL.9 Our strategy, recall, is to construct Γ by starting with ∆, and then going through this list one-by-one, at each point adding either φi or ∼φi . Here’s how we do this more carefully. Let’s begin by defining an infinite sequence of sets: i) Γ0 is defined as ∆ ii) Assuming that Γn has been defined, we define Γn+1 to be Γn ∪{φn+1 } if that would be an S-consistent set; otherwise we define Γn+1 to be Γn ∪{∼φn+1 } Note the recursive nature of the definition: the next member of the sequence of sets, Γn+1 is defined as a function of the previous member of the sequence, Γn . Next let’s prove that each member in this sequence — that is, each Γi — is an S-consistent set. We do this inductively, by first showing that Γ0 is S-consistent, and then showing that if Γn is S-consistent, then so will be Γn+1 . 9

We need to be sure that there is some way of arranging all the wffs of MPL into such a list. Here is one method. Consider the following list of the primitive expressions of MPL: ( 1

) ∼ 2 3

→ 4

2 5

P1 6

P2 7

... ...

Since we’ll need to refer to what position an expression has in this list, the positions of the expressions are listed underneath those expressions. (E.g., the position of the 2 is 5.) Now, where φ is any wff, call the rating of φ the sum of the positions of its primitive expressions. We can now construct the listing of all the wffs of MPL by an infinite series of stages: stage 1, stage 2, etc. In stage n, we append to our growing list all the wffs of rating n, in alphabetical order. The notion of alphabetical order here is the usual one, given the ordering of the primitive expressions laid out above. (E.g., just as ‘and’ comes before ‘nad’ in alphabetical order, since ‘a’ precedes ‘n’ in the usual ordering of the English alphabet, ∼2P2 comes before 2∼P2 in alphabetical order since ∼ comes before the 2 in the ordering of the alphabet of MPL. Note that each of these wffs are inserted into the list in stage 15.) In stages 1-5 no wffs are added at all, since every wff must have at least one sentence letter and P1 is the wff with the smallest position. In stage 6 there is one wff: P1 . Thus, the first member of our list of wffs is P1 . In stage 7 there is one wff: P2 , so P2 is the second member of the list. In every subsequent stage there are only finitely many wffs; so each stage adds finitely many wffs to the list; each wff gets added at some stage; so each wff eventually gets added after some finite amount of time to this list.


147

Obviously, Γ0 is S-consistent, since ∆ was stipulated to be S-consistent. Next, suppose that Γn is S-consistent; we must show that Γn+1 is S-consistent. Obviously, if Γn+1 was defined as Γn ∪{φn+1 } then it is S-consistent. Suppose on the other hand that it was defined as Γn ∪{∼φn+1 }; that means that Γn ∪{φn+1 } was S-inconsistent — the conjunction of some finite subset of its members is provably false in S. Since Γn was S-consistent, the finite subset must contain φn+1 , and so there exist ψ1 …ψ m ∈ Γn such that `S ∼(ψ1 ∧ · · · ∧ψ m ∧φn+1 ). Suppose now for reductio that Γn+1 — that is, Γn ∪{∼φn+1 } — is S-inconsistent, and so the conjunction of some finite subset of its members is provably false. Again, the finite subset must contain φn+1 , so there exist χ1 …χ p ∈ Γn such that `S ∼(χ1 ∧ · · · ∧χ p ∧∼φn+1 ). But notice that ∼(ψ1 ∧ · · · ∧ψ m ∧χ1 ∧ · · · ∧χ p ) is a PL consequence of ∼(ψ1 ∧ · · · ∧ψ m ∧φn+1 ) and ∼(χ1 ∧ · · · ∧χ p ∧∼φn+1 ). Any system is closed under (finite) PL-consequence (since the systems contain all PLtheorems, and are closed under modus ponens). Thus, `S ∼(ψ1 ∧ · · · ∧ψ m ∧χ1 ∧ · · · ∧χ p ); but this contradicts the fact that Γn is S-consistent. We have shown that all the sets in our sequence Γi are S-consistent. Let us now define Γ to be the union of all the sets in the infinite sequence — i.e., {φ : φ ∈ Γi for some i }. We must now show that Γ is the set we’re after: that i) ∆ ⊆ Γ, ii) Γ is maximal, and iii) Γ is S-consistent. Any member of ∆ is a member of Γ0 (since Γ0 was defined as ∆), hence is a member of one of the Γi s, and hence is a member of Γ. So ∆ ⊆ Γ. Any wff of MPL is in the list somewhere — i.e., it is φi for some i. But by definition of Γi , either φi or ∼φi is a member of Γi ; and so one of these is a member of Γ. Γ is therefore maximal. Suppose for reductio that Γ is S-inconsistent; there must then exist ψ1 . . . ψ m ∈ Γ such that `S ∼(ψ1 ∧ · · · ∧ψ m ). By definition of Γ, each of these ψi ’s are members of Γ j , for some j . Let k be the largest such j . Note next that, given the way the Γi ’s are constructed, each Γi is a subset of all subsequent ones. Thus, all of the ψi ’s are members of Γk , and thus Γk is S-inconsistent. But that can’t be — we showed that all the Γi ’s are S-consistent. QED.

6.6.4

Consistent sets of wffs in modal systems

We need to start thinking about which worlds in our canonical model will be accessible from which. Given the truth condition for 2, we’ll need to be sure that if ∆ is accessible from Γ, then for every formula 2φ that’s in Γ, φ must be in ∆. In fact, this will be our definition of accessibility. Let’s introduce some


148

notation: 2− (∆) is defined as the set of wffs φ such that 2φ is a member of ∆ Think of this operation as “stripping off the boxes”. Below, we will define accessibility as follows: ∆ is accessible from Γ iff 2− (Γ) ⊆ ∆. We’ll thereby be assured that the 2 statements from various worlds will “mesh”. But we need to be assured that the same will hold for the 3; in order to construct a canonical model, we’ll need to be sure that if we include a world (maximal S-consistent set of wffs) containing ∼2φ (which is, in effect, 3∼φ), we’ll also be able to include some accessible world containing ∼φ. That’s what the next lemma addresses: Lemma 6.4 Where S is any normal10 system of MPL, and ∆ is an S-consistent set of wffs containing ∼2φ, 2− (∆) ∪ {∼φ} is S-consistent. Proof of Lemma 6.4: Let ∆ and S be as described, and suppose for reductio that 2− (∆) ∪ {∼φ} is S-inconsistent; there are then ψ1 …ψn in 2− (∆) such that `S ∼(ψ1 ∧ · · · ∧ψn ∧∼φ). Now begin a proof in S with a proof of ∼(ψ1 ∧ · · · ∧ψn ∧∼φ), and then continue as follows: . . ∼(ψ1 ∧ · · · ∧ψn ∧∼φ) ψ1 →(ψ2 → · · · (ψn →φ) . . . ) 2(ψ1 →(ψ2 → · · · (ψn →φ) . . . ) . . 2ψ1 →(2ψ2 → · · · (2ψn →2φ) . . . ) ∼(2ψ1 ∧ · · · ∧2ψn ∧∼2φ)

PL NEC

K, PL (×n) PL

This proof establishes that `S ∼(2ψ1 ∧ · · · ∧2ψn ∧∼2φ). But since 2ψ1 …2ψn , and ∼2φ are all in ∆, this contradicts ∆’s S-consistency (2ψ1 …2ψn are members of ∆ because ψ1 …ψn are members of 2− (∆).) The proof is done, except for a couple special cases. First: what if ∆ has no wffs of the form 2ψ? Then 2− (∆) is empty, which would mean that none of 10

“Normal” = includes K, recall.


149

the ψi ’s exist. But in that case, the contradiction in 2− (∆)∪ {∼φ} is due to ∼φ alone; that is, `S φ. But by NEC, `S 2φ, which contradicts the claim that ∆ is S-consistent but contains ∼2φ. The second special case is this: what if the contradiction in 2− (∆) ∪ {∼φ} doesn’t involve ∼φ? In that case, we’d have `S ∼(ψ1 ∧ · · · ∧ψn ). But then, given closure under PL-consequence, we’d have `S ∼(ψ1 ∧ · · · ∧ψn ∧∼φ). The proof then proceeds as before. QED.

6.6.5

Canonical models

We’ll now put these lemmas to work; for the point of Theorem 6.3 and Lemma 6.4 is that we’ll be able to construct worlds as maximal consistent sets of wffs that “mesh”, given our definition of the accessibility relation. We’ll now show how to construct the canonical model for a given system, S. We need to do this by specifying 〈W,R,A〉: W: the set of all maximal S-consistent sets of wffs. wRw 0 iff 2− (w) ⊆ w 0 For any sentence letter, φ, and any world, w, A(φ, w) = 1 iff φ ∈ w Consider, now, the valuation V that results from this definition of the canonical model. Given how the assignment A was defined, we know that for any atomic wff, α, V(α, w) = 1 iff α ∈ w. We wish now to show that this holds for all wffs, not just atomic wffs: a wff is true at a world iff it is a member of that world: Theorem 6.5 Where M (= 〈W, R, A〉) is the canonical model for any normal modal system, S, for any wff φ and any w ∈ W, VM (φ, w) = 1 iff φ ∈ w Proof of Theorem 6.5: We’ll use induction. The base case is when φ has zero connectives — i.e., φ is a sentence letter. In that case, the theorem holds given the definition of a canonical model. Now the inductive step. We suppose (ih) that the result holds for φ, ψ, and show that it holds for ∼φ, φ→ψ, and 2φ as well: ∼ : We must show that ∼φ is true at w iff ∼φ ∈ w. i. ∼φ ∈ w iff φ ∈ / w (6.1a)


150

ii. φ ∈ / w iff φ is not true at w (ih) iii. φ is not true at w iff ∼φ is true at w (truth cond. for ∼) iv. so, ∼φ is true at w iff ∼φ ∈ w (i, ii, iii) → : We must show that φ→ψ is true at w iff φ→ψ ∈ w: i. V(φ→ψ, w) = 1 iff either V(φ, w) = 0 or V(ψ, w) = 1 (truth cond for →) ii. So, V(φ→ψ, w) = 1 iff either φ ∈ / w or ψ ∈ w (ih) iii. So, V(φ→ψ, w) = 1 iff φ→ψ ∈ w (6.1b) 2 : We must show that 2φ is true at w iff 2φ ∈ w. First the forwards direction. Assume 2φ is true at w; then φ is true at every w0 such that wRw 0 . By the ih, we have (*) φ is a member of every such w 0 . Now suppose for reductio that 2φ ∈ / w; by 6.1a, ∼2φ ∈ w. Since w is S-consistent, − by Lemma 6.4, 2 (w) ∪ {∼φ} is S-consistent; by Theorem 6.3 it has a maximal S-consistent extension, v. By definition of W, v is a world; since 2− (w) ⊆ v, by definition of R, wRv; and so by (*) v contains φ. But v also contains ∼φ, which contradicts its S-consistency. Now the backwards direction. Assume 2φ ∈ w. Then by definition of R, for every w 0 such that wRw 0 , φ ∈ w 0 . By the ih, φ is true at every such world; hence by the truth condition for 2, 2φ is true at w. QED. What was the point of proving theorem 6.5? The whole idea of a canonical model was to be that a formula is valid on the canonical model for S iff it is a theorem of S. This fact follows immediately from Theorem 6.5: Corollary 6.6: φ is valid in the canonical model for S iff `S φ Proof of Corollary 6.6: Let 〈W, R, A〉 be the canonical model for S. Suppose `S φ. Then, by 6.2a, φ is a member of every maximal S-consistent set, and hence φ ∈ w, for every w ∈ W. By 6.5, φ is true in every w ∈ W, and so is valid in this model. Now for the other direction: suppose 0S φ. Then {∼φ} is S-consistent, and so by theorem 6.3, has a maximal consistent extension; thus, ∼φ ∈ w for some w ∈ W; by theorem 6.5, ∼φ is therefore true at w, and so φ is not true at w, and hence φ is not valid in this model. So, we’ve gotten where we wanted to go: we’ve shown that every system has a canonical model, and that a wff is valid on the canonical model iff it is a theorem of the system. We now use this fact to prove completeness for our various systems:


6.6.6

151

Completeness of systems of MPL

Completeness of K K’s completeness follows immediately. Any K-valid wff is valid in all frames, and thus valid in all models, and thus valid in the canonical model for K, and so, by corollary 6.6, is a theorem of K. For the other systems, all that’s required for completeness is that we show that the accessibility relation in the canonical model has the formal property of the accessibility relation in all the frames for that system. This will be made clear in the proof of completeness for D: Completeness of D Let us show that in the canonical model for D, the accessibility relation, R, is serial. Let w be any world in that model. We showed above that 3(P →P ) is a theorem of D, and so is a member of w by 6.2a, and so is true at w by 6.5. Thus, by the truth condition for 3, there must be some world accessible to w in which P →P is true; and hence there must be some world accessible to w. Now for D’s completeness. Let φ be D-valid. It is then valid in all serial models. But we just showed that the canonical model for D is serial. φ is therefore valid in that model, and hence by 6.6, `D φ. Completeness of T As is plain from the previous section, all we need to do is prove that the accessibility relation in the canonical model for T is reflexive, for then it will follow that every T-valid formula is valid in the canonical model, and hence by 6.6, every T-valid formula is a T-theorem. Let w be any world in the canonical model for T. For any φ, `T 2φ→φ; thus, by 6.2b, it follows that for any φ, if 2φ ∈ w then φ ∈ w. But this is the definition of wRw. Completeness of B The accessibility relation can be shown to be reflexive in the same way as it was shown for T, since every T-theorem is a B-theorem. Now for symmetry: in the canonical model for B, suppose that wRv. We must show that vRw — that is, that for any 2ψ in v, ψ ∈ w. So, suppose that


152

2ψ ∈ v. By 6.5, 2ψ is true at v; since wRv, by the definition of 3 it follows that 32ψ is true at w, and hence is a member of w by 6.5. Since `B 32ψ→ψ, by 6.2b, ψ ∈ w. Completeness of S4 Reflexivity holds still; transitivity remains. Suppose wRv and vRu. We must show wRu — that is, for any 2ψ ∈ w, ψ ∈u. If 2ψ ∈ w, since `S4 2ψ→22ψ, by 6.2b we have 22ψ ∈ w. By 6.5, 22ψ is true at w; hence by the truth condition for 2, 2ψ is true at v; again by the truth condition for 2, ψ is true at u; by 6.5, ψ ∈ u. Completeness of S5 Reflexivity, symmetry, and transitivity hold in virtue of the proofs above, since S5’s theorems include all those of T, B, and S4.

Chapter 7 Variations on Propositional Modal Logic s we have seen, possible worlds are useful for giving a semantics for propositional modal logic. Possible worlds are useful in other areas of logic as well. In this chapter we will briefly examine two other uses for possible worlds: semantics for tense logic, and semantics for intuitionism.

A

7.1 7.1.1

Propositional tense logic1 Philosophical introduction

Propositional modal logic concerned the logic of the non-truth-functional sentential operators “it is necessary that” and “it is possible that”. Another set of sentential operators that can be similarly treated are propositional tense operators, such as “it will be the case that”, “it has always been the case that”, etc. A full logical treatment of natural language obviously requires that we pay attention to temporal notions. It isn’t so obvious, though, that we can’t just use plain old predicate logic to treat temporal notions. This was the strategy of many early logicians, such as Quine.2 Quine’s method is roughly this: 1 2

See Gamut (1991b, section 2.4); Cresswell and Hughes (1996a, pp. 127-134). See, for example, Quine (1953).

153

CHAPTER 7. VARIATIONS ON PROPOSITIONAL MODAL LOGIC154 Everyone who is now an adult was once a child ∀x(Axn → ∃t [t

Logic for Philosophy

Logic for Philosophy

Wittgenstein's Philosophy of Logic

Philosophy of logic

Logic, Mathematics and Philosophy

Philosophy of Logic: 2nd Edition

Philosophy of Logic: 2nd Edition

International Congress for Logic, Methodology and Philosophy of Science 1960

International Congress for Logic, Methodology, and Philosophy of Science

New Foundations For Logic

Logic for computer scientists

Logic for mathematicians

Modal Logic for Philosophers

Logic For Everyone

Logic for Mathematicians

Logic for Everyone

Philosophy of Logic: An Anthology (Blackwell Philosophy Anthologies)

Philosophy of Logic: An Anthology (Blackwell Philosophy Antologies)

Logic, Logic, and Logic

Logic, logic, and logic

Logic, Methodology and Philosophy of Science IV

Logic, Logic, and Logic

Logic, Methodology and Philosophy of Science IX

Introduction to logic and its philosophy

Logic, Methodology and Philosophy of Science III

Phenomenology, Logic, and the Philosophy of Mathematics

Before Logic (Suny Series in Philosophy)

Categorial frameworks (Library of philosophy and logic)

Logic and philosophy. A modern introduction

Phenomenology, Logic, and the Philosophy of Mathematics

Collected Papers on Mathematics, Logic, and Philosophy

Logic for Philosophy