Whamit!

The Weekly Newsletter of MIT Linguistics

Issue of Monday, February 24th, 2025

Colloquium 02/28 — Michela Ippolito (Toronto)

Speaker: Michela Ippolito (University of Toronto)
Title: What makes rhetorical questions rhetorical
Time: Friday 02/28 at 3:30-5pm
Location: 32-141

Abstract:

The question of what is special about rhetorical questions has been subject to debate for quite some time. One prominent view is that what makes rhetorical questions rhetorical is that they, unlike canonical questions, bear a special relation with the common ground: some theories propose that a rhetorical question is a question whose answer is in the common ground (e.g. Caponigro and Sprouse 2007); some theories propose that a rhetorical question presupposes that its answer is in the common ground (e.g. Biezma and Rawlins 2017); other theories propose a more intricare relation with the common ground (Farkas (2024)). In this talk I discuss some types of rhetorical questions which I argue challenge “common ground” theories of rhetorical questions and discuss how one might go about developing a different theory of rhetoricity.

Syntax Square 02/25 - Elise Newman (MIT)

Speaker: Elise Newman (MIT)
Title: Referendum on nominal licensing
Time: Tuesday, February 25th, 1pm - 2pm
Location: 32-D461

Abstract: Come one, come all to a very informal discussion about nominal licensing! When I say “nominal licensing”, I’m referring to one aspect of debates about case theory, namely whether case theory is about the distribution of nominals or just about their morphology. This is related to the “head-licensing vs. dependent case theory” debate, but not identical to it — whether heads are responsible for assigning case or not, we still need to separately figure out whether the outcome is a set of predictions about where nominals can be, or a set of predictions about what they should sound like (or both).

I’m not an expert on this topic, and you don’t need to be an expert on this topic to participate! The goal is to learn from each other and crowd source examples and literature. I will prepare some discussion points and examples, and share some details of the model of case that I tend to use (with some of its problems). Please come share yours with us and try to think of good test cases to tease the two theories apart!

LingLunch 2/27 - Omri Doron, Danny Fox, and Jad Wehbe (MIT)

Speaker: Omri Doron, Danny Fox, and Jad Wehbe (MIT)
Title: Assertion, Presupposition and Local Accommodation
Time: Thursday, February 27th, 12:30pm - 2pm
Location: 32-D461

Abstract: Sudo (2012) provides important evidence that trivalent (or partial) semantics is not rich enough to account for certain presupposition projection phenomena. Specifically, he observes that presuppositions triggered by different lexical items project differently in the same environment. These differences could not follow from any recipe for presupposition projection, if the input for projection is the trivalent semantic value of the relevant constituents. In fact, the differences cannot even be described. Sudo shows, however, that the facts can be described in 2-dimensional semantics by a rule that considers both the assertion and the presupposition of the relevant expressions. This argument was strengthened in later literature, with the observation that certain sentences, but not others, can be affirmed when their presupposition is known to be false (beginning with Cummins et al. 2013). It has been pointed out that the observed patterns can further support Sudo’s conclusion, as they suggest that it is sensible to ask whether the assertive component of an expression entails its presupposition – a question that is meaningful under 2d-semantics but not under Trivalence. Moreover, it has been pointed out that the assertions needed in the two domains (projection and affirmation) are the same.

We find the arguments compelling and the correlation between the two diagnostics very informative. There are, however, three important questions that we want to investigate. First, to describe the projection facts, Sudo needs to depart from predictive theories of presupposition projection (Strong Kleene, Local Context, Transparency) in favor of what seem to us to be ad hoc statements. The question is whether there is a way to modify Sudo’s proposal so that it is compatible with predictive theories of projection (Q1). The Second question, Q2, is whether the lexical stipulations that are commonly invoked to yield 2d-semantics can be eliminated in favor of a general algorithm that would allow us to keep to the more impoverished (and more predictive) trivalent semantics. And finally, there is a second correlation hinted at in the literature (Zehr and Schwarz, 2018), which we think is highly informative, namely that a presupposition can be cancelled (by Local Accommodation) only when it is entailed by the assertion (that hard triggers yield assertions and presuppositions that are logically independent, and that presuppositions are entailed by assertions in the case of soft triggers). So our third question, Q3, is whether there is a way to account for this new correlation. We, of course, hope that there could be affirmative answers to all three questions. To address Q3 affirmatively, we propose that there is no process of presupposition cancellation of the sort suggested by Heim. (Local Accommodation does not exist nor does the A operator invoked in Trivalent Semantics.) Instead there is a process of presupposition weakening, PW, that weakens the presupposition of a sentence S<p,A> (a sentence S with presupposition p and Assertion A): PW(S<p,A>) = S<a>.

It is an automatic consequence that PW leads to surface cancelation iff the assertion entails the presupposition. (Only in such a case is A → p a tautology.) We propose, moreover, to derive PW from the general theory of presupposition, on the assumption that the assertion can be parsed as a separate conjunct and evaluated “before” the presupposition (drawing on the representation in Schlenker 2008 and on the flexible view on incrementality argued for in Chemla and Schlenker 2012). This affirmative answer to Q3 turns out to provide an affirmative answer to Q1 as well. To answer Q2 we develop the algorithm proposed and rejected by Zehr and Schwarz (2018) based on a third correlation, namely that hard triggers are precisely those that can be deleted while maintaining (Strawson) equivalence. (We argue that apparent exceptions that worried Zehr and Schwarz can be accommodated with reasonable auxiliary assumptions.) Finally, if time allows for this, we will argue that the emerging perspective can make sense of otherwise puzzling conditional presuppositions, such as those identified by Schlenker for co-speech gestures.

MIT @ UMass Amherst colloquium

Our colleague Danny Fox presented joint work with students Omri Doron (6th year) and Jad Wehbe (5th year) at a colloquium at UMass Amherst, entitled “Assertion, Presupposition and Local Accommodation”. You can read the abstract here.