Refine
Document Type
- Part of a Book (23)
- Working Paper (14)
- Article (2)
- Doctoral Thesis (2)
Language
- English (41)
Has Fulltext
- yes (41)
Is part of the Bibliography
- no (41)
Keywords
- Formale Semantik (41) (remove)
Institute
- Informatik (11)
- Neuere Philologien (1)
This paper revisits the question of whether propositions in situation semantics must be persistent (Kratzer (1989)). It shows that ignoring persistence causes empirical problems to theories which use quantification over minimal situations as a solution for donkey anaphora (Elbourne (2005)), while at the same time modifying these theories to incorporate persistence makes them incompatible with the use of situations for contextual restriction (Kratzer (2004)).
The paper investigates the interaction of focus and adverbial quantification in Hausa, a Chadic tone language spoken in West Africa. The discussion focuses on similarities and differences between intonation and tone languages concerning the way in which adverbial quantifiers (AQs) and focus particles (FPs) associate with focus constituents. It is shown that the association of AQs with focused elements does not differ fundamentally in intonation and tone languages such as Hausa, despite the fact that focus marking in Hausa works quite differently. This may hint at the existence of a universal mechanism behind the interpretation of adverbial quantifiers across languages. From a theoretical perspective, the Hausa data can be taken as evidence in favour of pragmatic approaches to the focus-sensitivity of AQs, such as e.g. Beaver & Clark (2003).
Russian predicate cleft constructions have the surprising property of being associated with adversative clauses of the opposite polarity. I argue that clefts are associated with adversative clauses because they have the semantics of S-Topics in Büring's (1997, 2000) sense of the term. It is shown that the polarity of the adversative clause is obligatorily opposed to that of the cleft because the use of a cleft gives rise to a relevance-based pragmatic scale. The ordering principle according to which these scale
Dealing with alternatives
(2006)
Traditionally, pure additive particles and scalar additive particles are both characterized by an existential presupposition. They differ insofar as the set of alternatives that is built is unordered for the former, and ordered for the latter, which carry the so-called scalar presupposition. As a result, the two characterisations cannot be cumulated, an impossibility that is at odds with the fact that several languages exhibit this combination of readings for a single item. The discussion of Italian neanche '(n)either/(not) even', an item that can both be additive and scalar, allows us to expose the connection between the oppositions non-ordered vs ordered set of alternatives and verified vs accommodated existential presupposition by adding content to the traditional view that the set of alternatives is made up of 'relevant' items in the context. The question of how to characterise this item is set against the backdrop of a more general discussion of the network of additive particles found in Italian.
This paper looks at sentences with "quantificational indefinites," discussed by Diesing (1992) and others. I propose that these sentences generate sets of alternatives of the form {p, not p and it's possible that p}, which restrict the quantification by an extension of familiar focus principles. For example, in the sentence "I usually read a book about slugs" (on the relevant reading), "usually" quantifies over pairs <x,t> such that x is a book about slugs, t is a time interval, and one alternative is true from the set {I read x at t, I can but do not read x at t}. In addition to accounting for a well-known contrast between creation and non-creation verbs, this also explains a second contrast that Diesing’s analysis cannot account for.
The expressions few and a few are typically considered to be separate quantifiers. I challenge this assumption, showing that with the appropriate definition of few, a few can be derived compositionally as a + few. The core of the analysis is a proposal that few has a denotation as a one-place predicate which incorporates a negation operator. From this, argument interpretations can be derived for expressions such as few students and a few students, differing only in the scope of negation. I show that this approach adequately captures the interpretive differences between few and a few. I further show that other such pairs are blocked by a constraint against the vacuous application of a.
Band II von II
Band I von II
This paper presents two experimental studies investigating the processing of presupposed content. Both studies employ the German additive particle auch (too). In the first study, participants were given a questionnaire containing bi-clausal, ambiguous sentences with 'auch' in the second clause. The presupposition introduced by auch was only satisfied on one of the two readings of the sentence, and this reading corresponded to a syntactically dispreferred parse of the sentence. The prospect of having the auch-presupposition satisfied made participants choose this syntactically dispreferred reading more frequently than in a control condition. The second study used the self-paced-reading paradigm and compared the reading times on clauses containing auch, which differed in whether the presupposition of auch was satisfied or not. Participants read the clause more slowly when the presupposition was not satisfied. It is argued that the two studies show that presuppositions play an important role in online sentence comprehension and affect the choice of syntactic analysis. Some theoretical implications of these findings for semantic theory and dynamic accounts of presuppositions as well as for theories of semantic processing are discussed.
This paper shows the equivalence of applicative similarity and contextual approximation, and hence also of bisimilarity and contextual equivalence, in the deterministic call-by-need lambda calculus with letrec. Bisimilarity simplifies equivalence proofs in the calculus and opens a way for more convenient correctness proofs for program transformations. Although this property may be a natural one to expect, to the best of our knowledge, this paper is the first one providing a proof. The proof technique is to transfer the contextual approximation into Abramsky's lazy lambda calculus by a fully abstract and surjective translation. This also shows that the natural embedding of Abramsky's lazy lambda calculus into the call-by-need lambda calculus with letrec is an isomorphism between the respective term-models.We show that the equivalence property proven in this paper transfers to a call-by-need letrec calculus developed by Ariola and Felleisen.