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)
We propose a compositional analysis for sentences of the kind "You only have to go to the North End to get good cheese", referred to as the Sufficiency Modal Construction in the recent literature. We argue that the SMC is ambiguous depending on the kind of ordering induced by only. So is the exceptive construction – its cross-linguistic counterpart. Only is treated as inducing either a 'comparative possibility' scale or an 'implication-based' partial order on propositions. The properties of the 'comparative possibility' scale explain the absence of the prejacent presupposition that is usually associated with only. By integrating the scalarity into the semantics of the SMC, we explain the polarity facts observed in both variants of the construction. The sufficiency meaning component is argued to be due to a pragmatic inference.
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.
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 interpretation of traces
(2004)
This paper argues that parts of the lexical content of an A-bar moved phrase must be interpreted in the base position of movement. The argument is based on a study of deletion of a phrase that contains the base position of movement. I show that deletion licensing is sensitive to the content of the moved phrase. In this way, I corroborate and extend conclusions based on Condition C reconstruction by N. Chomsky and D. Fox. My result provides semantic evidence for the existence of traces and gives semantic content to the A/A-bar distinction.
The paper investigates the interpretation of the Romanian subjunctive B (subjB) mood when it is embedded under the propositional attitude verb crede (believe). SubjB is analyzed as a single package of three distinct presuppositions: temporal de se, dissociation and propositional de se. I show that subjB is the temporal analogue of null PRO in the individual domain: it allows only for a de se reading. Dissociation enables us to show that subjB always takes scope over a negation embedded in a belief report. Propositional de se derives this empirical generalization. The introduction of centered propositions (generalizing centered worlds), together with propositional de se, dissociation and the belief 'introspection' principles, derives the fact that subjB belief reports (unlike their indicative counterparts) are infelicitous with embedded probabil.
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.
This article develops a Gricean account for the computation of scalar implicatures in cases where one scalar term is in the scope of another. It shows that a cross-product of two quantitative scales yields the appropriate scale for many such cases. One exception is cases involving disjunction. For these, I propose an analysis that makes use of a novel, partially ordered quantitative scale for disjunction and capitalizes on the idea that implicatures may have different epistemic status.
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
The interactive verification system VeriFun is based on a polymorphic call-by-value functional language and on a first-order logic with initial model semantics w.r.t. constructors. It is designed to perform automatic induction proofs and can also deal with partial functions. This paper provides a reconstruction of the corresponding logic and semantics using the standard treatment of undefinedness which adapts and improves the VeriFun-logic by allowing reasoning on nonterminating expressions and functions. Equality of expressions is defined as contextual equivalence based on observing termination in all closing contexts. The reconstruction shows that several restrictions of the VeriFun framework can easily be removed, by natural generalizations: mutual recursive functions, abstractions in the data values, and formulas with arbitrary quantifier prefix can be formulated. The main results of this paper are: an extended set of deduction rules usable in VeriFun under the adapted semantics is proved to be correct, i.e. they respect the observational equivalence in all extensions of a program. We also show that certain classes of theorems are conservative under extensions, like universally quantified equations. Also other special classes of theorems are analyzed for conservativity.