Modal concord Conditionals Disjunction Superlative and comparative quantifiers. At least et al. Bart Geurts. Bart Geurts: At least et al.



Similar documents
SAND: Relation between the Database and Printed Maps

CHAPTER 2. Logic. 1. Logic Definitions. Notation: Variables are used to represent propositions. The most common variables used are p, q, and r.

Invalidity in Predicate Logic

YOU DON T SAY? KENT BACH

STAT 315: HOW TO CHOOSE A DISTRIBUTION FOR A RANDOM VARIABLE

The compositional semantics of same

CHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs

Last time we had arrived at the following provisional interpretation of Aquinas second way:

I should have been ill

Review. Bayesianism and Reliability. Today s Class

Propositional Logic. A proposition is a declarative sentence (a sentence that declares a fact) that is either true or false, but not both.

Handout #1: Mathematical Reasoning

Martin Aher. Modals in Legal Language

DEDUCTIVE & INDUCTIVE REASONING

POSITIVE POLARITY ITEMS:

Mathematical Induction

COMPARATIVES WITHOUT DEGREES: A NEW APPROACH. FRIEDERIKE MOLTMANN IHPST, Paris fmoltmann@univ-paris1.fr

How To Answer The Question Of If There Is A God Or Not In The World

An Innocent Investigation

CROSS EXAMINATION OF AN EXPERT WITNESS IN A CHILD SEXUAL ABUSE CASE. Mark Montgomery

We will learn the Python programming language. Why? Because it is easy to learn and many people write programs in Python so we can share.

def: An axiom is a statement that is assumed to be true, or in the case of a mathematical system, is used to specify the system.

IAI : Knowledge Representation

Lecture 8 The Subjective Theory of Betting on Theories

Logic in general. Inference rules and theorem proving

CHAPTER 7 ARGUMENTS WITH DEFIITIONAL AND MISSING PREMISES

Lecture 2. What is the Normative Role of Logic?

CLARIN project DiscAn :

THE EMOTIONAL VALUE OF PAID FOR MAGAZINES. Intomart GfK 2013 Emotionele Waarde Betaald vs. Gratis Tijdschrift April

Estudios de Asia y Africa Idiomas Modernas I What you should have learnt from Face2Face

Lecture Notes in Discrete Mathematics. Marcel B. Finan Arkansas Tech University c All Rights Reserved

Jgst. 7/8 How to make a nice and lively interview (1)

Semantics and Generative Grammar. Quantificational DPs, Part 3: Covert Movement vs. Type Shifting 1

Lecture 13 of 41. More Propositional and Predicate Logic

A Few Basics of Probability

3. Mathematical Induction

A Short Course in Logic Zeno s Paradox

2. The Language of First-order Logic

P1. All of the students will understand validity P2. You are one of the students C. You will understand validity

Optimizing Description Logic Subsumption

Things That Might Not Have Been Michael Nelson University of California at Riverside

On the Paradox of the Question

University of Lethbridge - Department of Economics ECON Introduction to Microeconomics Instructor: Michael G. Lanyi. Lab #4

Introduction. My thesis is summarized in my title, No. God, No Laws : the concept of a law of Nature cannot be

Secrets to Automation Success. A White Paper by Paul Merrill, Consultant and Trainer at Beaufort Fairmont, LLC

The 10 Most Costly Mistakes You Can Make When Selling Your Home

Lecture 9 Maher on Inductive Probability

Math 55: Discrete Mathematics

LANGUAGE! 4 th Edition, Levels A C, correlated to the South Carolina College and Career Readiness Standards, Grades 3 5

Comme Chez Moi: At home with the Belgians

Microsoft Get It Done Survey of Office Workers

Dutch Mortgage Market Pricing On the NMa report. Marco Haan University of Groningen November 18, 2011

Writing Essays. SAS 25 W11 Karen Kostan, Margaret Swisher

Predicate Logic Review

SBC Bet Butler Special & FAQ

Healthy lunch ideas. Sample ISE I Controlled Written examination tasks Candidate answers, assessments and rationale

UNBOUND ANAPHORIC PRONOUNS: E-TYPE, DYNAMIC, AND STRUCTURED-PROPOSITIONS APPROACHES

TeachingEnglish Lesson plans

ISAAC LEVI JAAKKO HINTIKKA

On wh-exclamatives and noteworthiness

Tips for writing good use cases.

1/9. Locke 1: Critique of Innate Ideas

Basic Probability. Probability: The part of Mathematics devoted to quantify uncertainty

Journal of Philosophy, Inc.

Brillig Systems Making Projects Successful

Beyond Propositional Logic Lukasiewicz s System

Figure 4-1 Price Quantity Quantity Per Pair Demanded Supplied $ $ $ $ $10 2 8

You should read this chapter if you need to review or learn about

My name is Sheila Neuburger and I graduated from the University of Toronto, Factor- Inwentash Faculty of Social Work in 1979.

Spring 2012 Ling 753 Every versus Each: Some Observations and Proposals. 1. Introduction: Some Reflections on the Meaning of Each

Traveling in A- and B- Time

10.4 Traditional Subject Predicate Propositions

General training instructions 1. Each child first answers a question on the booklet, then they go on to discuss the answers and explain in a small

Guidelines for Effective Business Writing: Concise, Persuasive, Correct in Tone and Inviting to Read

>

Overview of the TACITUS Project

Cambridge International Examinations Cambridge International General Certificate of Secondary Education

VISUAL GUIDE to. RX Scripting. for Roulette Xtreme - System Designer 2.0

A Client s Guide to Personal Injury Mediation

2 When is a 2-Digit Number the Sum of the Squares of its Digits?

Basic ESXi Networking

Unit 18: Present Perfect Tense vs. Past Tense

CS510 Software Engineering

Math 3000 Section 003 Intro to Abstract Math Homework 2

Business Definitions for Data Management Professionals

A. Arguments are made up of statements, which can be either true or false. Which of the following are statements?

5544 = = = Now we have to find a divisor of 693. We can try 3, and 693 = 3 231,and we keep dividing by 3 to get: 1

Specification and Analysis of Contracts Lecture 1 Introduction

Transcription:

At least et al. Bart Geurts

The story in a nutshell Superlative quantifiers ( at least 7 wombats ) are quite different from comparative ones ( more than 6 opossums ). Superlative quantifiers are modal expressions. In important ways, they resemble conditionals and disjunctions (which are modal expressions, too, naturally). So the plan is as follows: Background Modal concord Conditionals Disjunction Superlative vs. comparative quantifiers

Modal concord

Modal concord [1] Hij moet zeker in Brussel zijn. he must certainly in Brussels be Compositional reading: I suppose he has to be in Brussels. Concord reading: He (definitely) has to be in Brussels. [2] Hij moet misschien in Brussel zijn. he must perhaps in Brussels be Compositional reading: Perhaps he has to be in Brussels. Concord reading: none [3] Ze zou misschien wel eens dronken kunnen zijn. she could maybe wel eens drunk can be Compositional reading:... (she is drunk) [not available] Concord reading: (she is drunk)

A concise phenomenology of modal concord Modal concord items: beslist definitely, zeker certainly, wellicht probably, misschien possibly, etc. MC items can stand on their own: [1] Ze zou misschien dronken kunnen zijn. she could perhaps drunk can be [2] Ze is misschien dronken. she is perhaps drunk She might be drunk. MC items don t license each other: [3]?Ze heeft misschien mogelijkerwijs een delirium. she has maybe maybe a delirium

A concise phenomenology of modal concord MC items impose constraints on their licensers regarding force ( vs. ) and type (e.g. epistemic vs. deontic). Consequently, there are no MC readings for: [1] De kleine dinosaurus moet misschien weggaan. the little dinosaur must perhaps go-away Perhaps the little dinosaur has to go away. [2] Je mag verplicht een ijsje eten. you may obligatorily an ice cream eat You are allowed to obligatorily eat an ice cream.

Conditionals

The Lewis-Kratzer doctrine There is no two-place if... then connective in the logical forms for natural languages. If-clauses are devices for restricting the domains of various operators. Whenever there is no explicit operator, we have to posit one. [Kratzer 1991] Proposed exegesis: There are two strategies for dealing with if-clauses: [O] An if-clause may restrict the domain of an overt operator. [C] An if-clause may restrict the domain of a covert operator. Every conditional sentence with an overt modal is ambiguous.

Reframing the proposed exegesis An if-clause introduces a tacit operator M which: [O] may be unified with an overt operator N, if one is present ( modal concord), or [C] may be left to stand on its own, in which case M defaults to epistemic necessity ( compositional construal of MC items). Again, every conditional sentence with an overt modal in it will be ambiguous.

... and ambiguous they are [1] If you re myopic, you should use contraceptives. (O) In all deontically accessible worlds in which you are myopic, you use contraceptives. [ ] (C) In all epistemically accessible worlds in which you are myopic, you should use contraceptives. [ ] [2] If Fred takes a biscuit, he may take two. [deontic] (O) Fred is allowed to take two biscuits. [ ] (C) I don t know how many biscuits Fred is allowed to take, but if he takes one, then that settles the matter, for then he is allowed to take two. [ ]

Inferential properties of conditionals The modal vs. the truth-functional account On a truth-functional construal, the following argument is valid: Plato wasn t Belgian If Plato was Belgian, Aristotle was Dutch On the modal account, it isn t. The following is valid on the default (epistemic) construal of the if-clause: If Plato was Belgian, Aristotle was Dutch Plato was Belgian Aristotle was Dutch

Disjunction

Disjunctions as modals Zimmermann 2000 Geurts 2005 Basic idea: A disjunction is actually a conjunction of alternatives: S 1 or S 2 means (really means) Maybe S 1 and maybe S 2. The interpretation of a disjunction begins with a rather abstract lexical meaning, which is restricted by various kinds of semantico-pragmatic constraints. The context-dependence of modal expressions plays a crucial role in the story. E.g. Alice might grow taller.

Disjunctions as modals Zimmermann 2000 Geurts 2005 The general form of a modal proposition is AMB, where M is a quantifier whose domain is A. Hence: A B, A B, etc. The logical form of S 1 or S 2 is: A 1 M 1 B 1 A 2 M 2 B 2 M 1/2 may be either overt or covert. The domain of M 1/2 is determined by the context. Further constraints: Disjointness: A 1 B 1 A 2 B 2 = Exhaustivity: C (A 1 B 1 ) (A 2 B 2 ) where C is the background set furnished by the context.

C-readings and O-readings [1] You may do this or you may do that. The tacit modal operators introduced by or either fuse with the overt modals, or else default to epistemic possibility: (O) A B A B You have permission to do this and you have permission to do that. (C) A B C A B C It may be that you have permission to do this and it may be that you have permission to do that.

Inferential properties of disjunctions The modal vs. the truth-functional account On a truth-functional construal, the following argument is valid: Plato was Belgian Either Plato was Belgian or Aristotle was Dutch On the modal account, it isn t. The following is valid on the default construal of or : Either Plato was Belgian or Aristotle was Dutch Plato was Belgian Aristotle was Dutch

Superlative and comparative quantifiers positive feedback to: bart.geurts@phil.ru.nl negative feedback to: rick.nouwen@let.uu.nl

Superlative and comparative quantifiers Superlative quantifiers: at least/most 4 sheep Comparative: more/fewer than 5 camels It is usually assumed that these quantifiers are interdefinable: at least 7 bath ducks = more than 6 bath ducks at most 7 bath ducks = fewer than 8 bath ducks Not so!

Superlative vs. comparative quantifiers NPs in superlative quantifiers may have specific readings: [1] I will invite at most 2 people, namely Jack and Jill. Jack and Jill will be invited. [2] I will invite fewer than 3 people, namely Jack and Jill. Jack and Jill will be invited. [3] I will invite fewer than 2 people, namely Jack and Jill. Inferential properties: [4] Barney ate 3 apples. Barney ate fewer than 4 apples. Barney ate at most 3 apples. Barney ate more than 2 apples. Barney ate at least 3 apples. By and large, the distribution of superlative quantifiers is much more restricted than that of their comparative counterparts.

Distributional restrictions Downward entailing contexts [1] Bach wrote {at least/most // more/fewer than} 27 fugues. [2] Bach didn t write {?at least/most // more/fewer than} 27 fugues. [3] No composer wrote {?at least/most // more/fewer than} 27 fugues. [4] Few composers wrote {?at least/most // more/fewer than} 27 fugues. Note that the variants with the superlative quantifiers, though infelicitous, are still interpretable.

Distributional restrictions Quantifiers [1] {All / Nearly all / Most /?Some /?About seven / None} (of the) children ate at least/most 2 sandwiches. [2] There were so many/few chocolates left that {everybody / almost everybody / most guests /?about seven guests / no one} got at least/most 3. [3] Before going to bed, she {always / nearly always / usually /?often / occasionally / rarely / never } says at least/most 4 prayers.

Outline of a proposal The standard analysis of comparative quantifiers is correct. Superlative quantifiers are modals: [1] Wilbur published at least 5 novels. x[#x = 5 Nx Pwx] x[#x > 5 Nx Pwx] [2] Wilbur published at most 5 novels. x[#x = 5 Nx Pwx] x[#x > 5 Nx Pwx] The modal operators are of the same type, and epistemic by default.

Fleshing out the proposal The two conjuncts introduced by the quantifier do not have the same status: primary operator x[#x = 5 Nx Pwx] } {{ } principal message x[#x > 5 Nx Pwx] If a superlative quantifier combines with an overt modal whose force is the same as that of its primary operator, the two operators will fuse by default ( modal concord O-reading). Otherwise, we will have a double modal ( compositional reading C-reading). The modal operators contributed by the quantifier are epistemic by default, hence will prefer to take wide scope.

Examples [1] You may take at most three chocolates. (O) x[cx #x = 3 Tyx] x[cx #x > 3 Tyx] (C) x[cx #x = 3 Tyx] x[cx #x > 3 Tyx] [2] You must take at least three chocolates. (O) x[cx #x = 3 Tyx] x[cx #x > 3 Tyx] (C) x[cx #x = 3 Tyx] x[cx #x > 3 Tyx] [3] You may take at least three chocolates. (O) (C) x[cx #x = 3 Tyx] x[cx #x > 3 Tyx] [4] You must take at most three chocolates. (O) (C) x[cx #x = 3 Tyx] x[cx #x > 3 Tyx]

Inferential properties Superlative vs. comparative quantifiers Barney ate 3 apples. [1] Barney ate fewer than 4 apples. [2] Barney ate at most 3 apples. [3] Barney ate more than 2 apples. [4] Barney ate at least 3 apples.

Modal modifiers If the modal analysis is correct, it makes sense that superlative modifiers sometimes alternate with overt modals: [1] Hij heeft voor zeker zes kranten gewerkt. he has for certainly six newspapers worked He has worked for at least six newspapers. [2] Hij heeft voor misschien drie kranten gewerkt. he has for maybe three newspapers worked He has worked for at most three newspapers.

Distributional restrictions If the modal analysis is correct, there should be restrictions on the distribution of superlative quantifiers just as there are on the distribution of bona fide modals (and epistemic ones in particular): {Each / Most /?About five / None} of the guests... [1]... may have dispatched the butler. [2]... had at least 3 cocktails. [3] Nabokov might not have written Lolita. (Only wide scope for.) [4] Nabokov didn t write at least/most 3 novels.

To be tested Implications for psychology Superlative quantifiers deviate from comparative ones in that: they are more complex, they are acquired later, and they license fewer inferences.

Summing up Superlative quantifiers are modal expressions, as witness: similar patterns of compositional and modal concord readings, similar inference patterns, and similar distributional restrictions.