The Semantics of Questions Introductory remarks

Similar documents
Two Reconstruction Puzzles Yael Sharvit University of Connecticut

Exhaustively as Cell Identification

Two Reconstruction Puzzles Yael Sharvit University of Connecticut

Karttunen Semantics. Last week. LING 147. Semantics of Questions Week 4 Yimei Xiang September 22, I. Intensionality

Ling 98a: The Meaning of Negation (Week 5)

Spring 2018 Ling 620 Introduction to Semantics of Questions: Questions as Sets of Propositions (Hamblin 1973, Karttunen 1977)

Wh-islands in degree questions: A semantic approach

Exhaustive interpretations: what to say and what not to say

Presuppositions (introductory comments)

Spring 2017 Ling 620 Eliminating Res-Movement : An Introduction to Concept Generators

A compositional semantics for wh-ever free relatives 1 Aron Hirsch Massachusetts Institute of Technology

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

list readings of conjoined singular which -phrases

Sensitivity to false answers in interpreting questions under attitudes. Yimei Xiang

Indicative conditionals

564 Lecture 25 Nov. 23, Continuing note on presuppositional vs. nonpresuppositional dets.

Hamblin Semantics & Focus

Homogeneity and Plurals: From the Strongest Meaning Hypothesis to Supervaluations

Too Many Alternatives: Density, Symmetry and Other Predicaments

Intensional semantics: worlds, modals, conditionals

Solving the dilemma between uniqueness and mention some * Yimei Xiang. Harvard University

(5) Ú who á = people context = {John, Mary, } cf. Ú John á = John. knowing who bought what Syntax/Semantics of Questions, March 23, 1999

Semantics 2 Part 1: Relative Clauses and Variables

Association with traces & the copy theory of movement 1

Introducing a hybrid categorial approach

Must... stay... strong!

Semantics and Generative Grammar. Quantificational DPs, Part 2: Quantificational DPs in Non-Subject Position and Pronominal Binding 1

Fox/Menendez-Benito 11/14/06. Wrapping up discussion on Kratzer 2005 (inconclusively!)

Hedging Your Ifs and Vice Versa

March 2, 2007 Menéndez-Benito. Quick Introduction to the Semantics of Modals 1

Spring 2017 Ling 620. An Introduction to the Semantics of Tense 1

Parasitic Scope (Barker 2007) Semantics Seminar 11/10/08

Introduction to Pragmatics

Basics of conversational implicatures

Exhaustive interpretation of complex sentences

DEGREE QUANTIFIERS, POSITION OF MERGER EFFECTS WITH THEIR RESTRICTORS, AND CONSERVATIVITY

Composing questions: A hybrid categorial approach

Description Logics. Foundations of Propositional Logic. franconi. Enrico Franconi

Presupposition and Montague Grammar (Krahmer 1998, Ch. 5)

Semantics and Generative Grammar. A Little Bit on Adverbs and Events

Spring 2018 Ling 620 The Basics of Intensional Semantics, Part 1: The Motivation for Intensions and How to Formalize Them 1

Generalized Quantifiers & Categorial Approaches & Intensionality

Proseminar on Semantic Theory Fall 2010 Ling 720. Remko Scha (1981/1984): Distributive, Collective and Cumulative Quantification

Peter Hallman, University of Vienna

Partitioning Logical Space

Semantics and Generative Grammar. An Introduction to Intensional Semantics 1

CAS LX 522 Syntax I Fall 2000 October 10, 2000 Week 5: Case Theory and θ Theory. θ-theory continued

Embedded interrogatives: the role of false answers

Section 2.1: Introduction to the Logic of Quantified Statements

Introduction to the semantics of questions

CS1021. Why logic? Logic about inference or argument. Start from assumptions or axioms. Make deductions according to rules of reasoning.

Two sets of alternatives for numerals

Proseminar on Semantic Theory Fall 2010 Ling 720. The Basics of Plurals: Part 2 Distributivity and Indefinite Plurals

Chapter 2. Mention-some questions Introduction

Modal Logics. Most applications of modal logic require a refined version of basic modal logic.

Proseminar on Semantic Theory Fall 2010 Ling 720 The Basics of Plurals: Part 1 1 The Meaning of Plural NPs and the Nature of Predication Over Plurals

Monads as a Solution for Generalized Opacity

Breaking de Morgan s law in counterfactual antecedents

Similarity: towards a unified account of scalar implicatures, free choice permission and presupposition projection

COMP219: Artificial Intelligence. Lecture 19: Logic for KR

A modal analysis of presupposition and modal subordination

LIN1032 Formal Foundations for Linguistics

FREE CHOICE AND EXHAUSTIFICATION: AN ACCOUNT OF

Bar-Hillel and the Division of Labor in Language

(7) a. [ PP to John], Mary gave the book t [PP]. b. [ VP fix the car], I wonder whether she will t [VP].

Semantics I, Rutgers University Week 3-1 Yimei Xiang September 17, Predicate logic

Intermediate Logic. Natural Deduction for TFL

1 Classical scalar implicature

CS 2800: Logic and Computation Fall 2010 (Lecture 13)

triviality results for probabilistic modals

Introduction to Semantics. The Formalization of Meaning 1

Introduction to Semantics. Common Nouns and Adjectives in Predicate Position 1

Logic: Propositional Logic (Part I)

A Review of the Essentials of Extensional Semantics 1

INTRODUCTION TO LOGIC. Propositional Logic. Examples of syntactic claims

Overview. Knowledge-Based Agents. Introduction. COMP219: Artificial Intelligence. Lecture 19: Logic for KR

Comparative superlatives in relative clauses

09 Modal Logic II. CS 3234: Logic and Formal Systems. October 14, Martin Henz and Aquinas Hobor

Scalar Implicatures: Are There Any?

Economy and Embedded Exhaustification Danny Fox and Benjamin Spector

Global Approach to Scalar Implicatures in DRT*

Proseminar on Semantic Theory Fall 2013 Ling 720 First Order (Predicate) Logic: Syntax and Natural Deduction 1

TEMPORAL AND CIRCUMSTANTIAL DEPENDENCE IN COUNTERFACTUAL MODALS. DORIT ABUSCH Department of Lingusitics Cornell University

cis32-ai lecture # 18 mon-3-apr-2006

Two kinds of long-distance indefinites Bernhard Schwarz The University of Texas at Austin

a. Rachel is {taller / more intelligent} than Stephanie (is). a. Rachel is the {tallest / most intelligent} (student in my class).

Introduction to Semantics. Pronouns and Variable Assignments. We ve seen that implicatures are crucially related to context.

COMP219: Artificial Intelligence. Lecture 19: Logic for KR

Syntax Semantics Tableau Completeness Free Logic The Adequacy of First-Order Logic. Predicate Logic. Daniel Bonevac.

Spring 2017 Ling 620. The Semantics of Modals, Part 2: The Modal Base 1

INTENSIONS MARCUS KRACHT

Quantifiers in than-clauses

CHAPTER 4 CLASSICAL PROPOSITIONAL SEMANTICS

Mathematical Logic Part Three

QUANTIFICATIONAL READINGS OF INDEFINITES

KB Agents and Propositional Logic

Boolean AND and the Semantic Correlates of Gradable Adjectives

Spring 2017 Ling 620 Conditionals as Modal Modifiers Conditional Constructions: Some Basic Terminology, Questions, and Assumptions

Mat 243 Exam 1 Review

On Concealed Questions

Transcription:

MIT, September-October 2012 1 1. Goals for this class The Semantics of Questions Introductory remarks (1) a. Which boy (among John, Bill and Fred) read the book? Uniqueness presupposition (UP): exactly one boy came to the party. b. Which boy (among John, Bill and Fred) read which book? No UP (at least under one reading). 1. To account for the distribution of UPs (taking Dayal s (1996) account of UP in (a) as a starting point, rejecting her account of (b), and instead providing a way to generalize from (a) to (b) based on the assumption (common in the literature and elsewhere in Dayal) that multiple questions can denote second order questions. 2. To discuss potential ramifications for quantificational variability in questions. 3. To discuss similarities between the properties of (1)b and pair-list readings that arise through universal quantification (of, e.g., which book did every boy read?) 4. To discuss constraints on pair list readings: the fact that they arise only with universal quantifiers, though other quantifiers seem to be able to outscope questions when they are embedded (Szabolsci 1997). 5. To draw consequences for superiority, and in particular exceptions to superiority (given the perspective of Golan 1993) 6. To discuss consequences for the distribution of covert wh movement. 2. Goals for today 1. To introduce Groenendijk & Stokhof s (G&S s) assumption about the meaning of questions. 2. To develop a modification of Karttunen s system that yields G&S s semantics (by embedding K s CPs under an Ans operator). 3. To introduce Dayal s notion of Ans and explain why it makes the right prediction for (1)a, but the wrong prediction for (1)b. 4. To discuss a possible account for constraints on pair-list reading (goal 4 above) within G&S s approach to the semantics of questions (an account which I will later have to reject). 3. Two very basic desiderata for the semantics of questions a. To distinguish between appropriate and inappropriate answers to a question. b. To account for the truth conditions of sentences that embed questions, e.g. John knows who came. 4. Questions denote their complete true answer (G&S) (2) Possible Hypothesis: a. The meaning of an indicative sentence is a recipe for determining a truth value based on facts (a function from worlds to truth values, a.k.a. a proposition) b. The meaning of a question is a recipe for demining an answer based on facts (a function from worlds to propositions, if an answer is a proposition).

MIT, September-October 2012 2 (3) Question Intension [[who came]] = λw. the proposition that serves as the (complete) true answer to the question who came in w. (4) Question Extension [[who came]] w = [[who came]] (w) = the proposition that serves as the What is the proposition that serves as the (complete) true answer to the question who came? There are a few approaches here, but first let s see how the general perspective might provide a framework for meeting the two basic desiderata: (5) a. S is an appropriate response to a question Q by a speaker x if S is the strongest sentence such that for all w compatible with x s beliefs, [[Q]] w {w: [[S]] w =1} a'. S is an appropriate response to a question if S is not a tautology and w ([[Q]] w {w: [[S]] w =1}. Equiv. if S is not a tautology and it s logically possible for there to be an individual x such that S is an appropriate response to Q by x b. [[John knows who came]] w = 1 iff [[knows]] w ([[who came]] w )( [[John]] w ) = 1 Issue to return to: non-veridical predicates such as John is certain who came, John and Mary agree on who came. Here we might adopt Egré and Spector s position. Here s a simplificaiton (6) Let V be a verb of type <st,et>: [[x V who came]] w = 1 iff w'[[v]] w ([[who came]] w' )( [[John]] w ) = 1 5. Two options for complete answer 1 (7) Ans-Weak: [[who came]] w0 = λw p {that x came: x is a person in w 0 and x came in w 0 }[p(w)=1] =λw p {that x came: x is a person in w 0 and x came in w 0 }[p(w)=p(w 0 )] Ans-strong: 2 [[who came]] w0 = λw p {that x came: x is a person in w 0 }[p(w) =p(w 0 )] 1 Based on Heim (1994) 2 I am ignoring the reading that would result from the de-dicto interpretation of the wh-phrase. See Rullmann and Beck (1999), Sharvit (2002) and references therein.

MIT, September-October 2012 3 6. Karttunen s assumptions about the syntax semantics interface 3 (8) [[C int ]] = λpα.λqα.p=q (*i.e., the relation of identity*) In order to avoid any appeal to a special composition rule (or a special meaning for a whfeature), we will assume that one argument of q is saturated by a variable bound by a lamda abstractor: (9) who came? λp [who λx [[C int p] λw. x came w ]] Denotation (in a world w 0 ): λp. [[someone]] w0 (λx. p = λw. x came in w) (*[[someone]] = [[who]]*) In set notation {λw. x came in w: x a person in w 0 } (10) who read what? λp [who λx what λy [[C int p] λw. x read w y]] Denotation (in a world w 0 ): λp. [[someone]] w0 (λx. [[something]] w0 λy p = λw. x read y in w) In set notation {λw. x read y in w: x a person in w 0 and y is a thing in w 0 } (11) Question: How do we get the variable p and abstraction over p? Possible answers: a. Movement of a semantically vacuous element (as in the formation of relative clauses), which leaves a trace of type st. b. Movement of an operator which takes question denotations as its argument. So questions denote a set of propositions, not the complete true answer (which we ve assumed is a proposition) 7. Karttunen meets G&S Let s enrich the logical form by introducing the operator Ans. And for the sake of explicitness, let s assume that Ans is the operator that is base generated in the argument position of C int and moves to yield lambda abstraction (12) who came? Ans λp [who λx [[C int p] λw. x came w ]] meaning (with someone interpreted de re): [[Ans]] ({λw. x came in w: x a person in w 0 }) (13) a. [[Ans-Weak]] = λq.λw.λw'. p Q[p(w)=1 p(w') =1] b. [[Ans-Strong]] = λq.λw.λw'. p Q[p(w)=p(w')] 3 Based on various class notes of Irene Heim s.

MIT, September-October 2012 4 (14) Resulting Meanings a. Ans-Weak: λw.λw'. p ({λw. x came in w: x a person in w 0 }) [p(w)=1 p(w') =1] a. Ans-Strong: λw.λw'. p ({λw. x came in w: x a person in w 0 }) [p(w)=p(w')] Advantages of Ans-Strong: 1. Provides the right meaning for sentences such as John knows who came. 2. We can provide so called negative responses to questions (e.g., John didn t come in response to who came?). Under Ans-Weak (in conjunction with (4)a) they should not be appropriate. More generally, G&S show that the notion of a partition (of logical space, or the common ground) is a useful tool in describing what is relevant given a question. The meaning in (14)b (in contrast to (14)a) provides a partition of logical space [into equivalence classes], which we might think of as a more suitable question meaning. Homework: Show that (14)b is an equivalence relation, whereas (14)a is not. 3. Makes it possible for us to adopt Egré and Spector s account of non-veridical predicates. Homework: -Show that (6) is way too weak under Ans-Weak. Advantages of Ans-Weak (Heim 1994): Might provide the right meaning for sentences such as John was surprised by who came. For alternatives to Heim s perspectives on surprise, see Egré and Spector 2007, and George 2011. 8. Dayal s notion of Ans 8.1. An Account of the uniqueness presupposition of (1)a (bad result for (1)b) (1)a. Which boy (among John, Bill and Fred) came to the party? Uniqueness presupposition (UP): exactly one boy came to the party. This presupposition is triggered by Ans. (15) a. [[Ans-Weak Dayal ]] = Max inf = λq.λw: p Q (p = [[Ans-Weak]] (Q)(w)). [[Ans-Weak]] (Q)(w)

MIT, September-October 2012 5 b. [[Ans-Strong Dayal ]] = λq.λw.λw' [Max inf (Q)(w) = Max inf (Q)(w')] We thus predict a UP for all wh-questions with singular restrictors: (16) a. [[which girl came]] w0 = {λw. x came in w: x [[girl]] w0 } b. [[which girl read which book]] w0 = {λw. x read y in w: x [[girl]] w0 & y [[book]] w0 } Conclusion: Good result for simple wh-questions. Bad result for multiple wh-questions. 8.2. An Account of neagive islands and their obviation Abrusán (2007), Abrusán and Spector (2012), Fox and Hackl (2006), Schwarz and Shimoyama (2010). (17) *How much money did you not bring to the US Q = {λw. you did not bring d much money to the US: d a degree} w(max inf (Q)(w) is not defined) (18) How much money are you not allowed to bring to the US Q = {λw. you are not allowed bring d much money to the US: d a degree} w(max inf (Q)(w) is defined) (19) *How much money are you not required to bring to the US Q = {λw. you are not required to bring d much money to the US: d a degree} w(max inf (Q)(w) is not defined) Relevant logical facts (see Fox 2007): even if w(max inf (Q)(w) is not defined), Max inf (BOX(Q))(w) will still be defined in some world (as long as Q contains a consistent proposition). If w(max inf (Q)(w) is not defined), then w(max inf (DIAMOND(Q))(w) is not defined), Where BOX(Q) is the result of point-wise composition of Q with a universal modal = {λw. w'(r(w,w') p(w') =1): p Q} for some accessibility relation R DIAMOND(Q) is the result of point-wise composition of Q with an existential modal = {λw. w'(r(w,w') & p(w') =1): p Q} for some accessibility relation R General Question to Ask: Is there a language with Ans overt? Possibility: Japanese Q- particle (Miyagawa 2001, 2005, Yoshida 2012). 9. Karttunen refuses to meet G&S For what we ve done up to now, it is not necessary to introduce Ans into the logical form. We can view Ans as part of the pragmatics of answering questions as well as part of the meaning of question embedding predicates. This is the position taken in Heim (1994).

MIT, September-October 2012 6 10. Quantifying into questions (G&S) A possible reason to introduce Ans into the LF is that it can provide a landing-site for QR (the one used by G&S to account for pair-list readings) (20) what did every boy read? λwλw' Every boy λx. Ans w,w' λp [what λy [[C int p] λw''. x read w'' y]] where (for convenience) Ans here is a different currying of Ans-Strong Dayal (21) [[Ans]] = λw.λw'.λq. [Max inf (Q)(w) = Max inf (Q)(w')] 11. Szabolsci s Problem and a possible way of dealing with part of it 11.1. Quantifying into matrix questions is restricted 11.2. Quantifying into embedded questions is not restricted in the same way 11.3. A possible explanation (22) Constraint on Question: A question Q is acceptable only if it denotes an equivalence relation. Intuition: an answer to a matrix question Q is an indication of the cell in the partition induced by Q that the actual world belongs to.

MIT, September-October 2012 7 PARTITION = λq <s,st> : Q is an equivalence relation. {λw.q(w)(w'): w' W} The function that yields the set of equivalence relations under Q. (23) Back to (6): Let V be a verb of type <st,et>: [[x V Q]] w = 1 iff p PARTITION(Q)[[V]] w (p)( [[x]] w ) = 1 Homework: a. Show that λwλw' Every boy λx. Ans w,w' λp [what λy [[C int p] λw''. x read w'' y]] denotes an equivalence relation b. Show that λwλw' more than 3 boys λx. Ans w,w' λp [what λy [[C int p] λw''. x read w'' y]] does not denote an equivalence relation assume more than 3 boys has a distributive meaning: [[more than 3 boys]] = λp et. There is a set B of cardinality 4 such that b B P(b)=1. c. Show that λwλw' no boy λx. Ans w,w' λp [what λy [[C int p] λw''. x read w'' y]] does not denote an equivalence relation d. Assume that the boys are J B and F and that in w 0 John read W&P, Bill read BK, and Fred read AK (and no body else read anything). What would be the answer in w 0 to the question derived by QR of no boy above Ans: λwλw' no boy λx. Ans w,w' λp [what λy [[C int p] λw''. x read w'' y]] 12. Summary -There are reasons to believe that at some level we need a function from a set of propositions to its most informative true member Dayal s Ans. 1. Ans accounts for negative islands 2. Ans accounts for the uniqueness presupposition of which boy came? -If Ans is represented at LF, we have a location for QR and thus a possible account for the pair list reading of which book did every boy read? We also have a way of thinking about the fact that pair-list arises only with universal quantifiers. Remaining Questions: 1. What accounts for the disappearance of uniqueness in which boy read which book? 2. What is the relationship between the pair-list reading of which boy read which book and the pair-list reading of which book did every boy read?