Legend has it that quantifiers cannot scope out of finite clauses. But whileislands for quantifier raising might exist, clauses are not that: We identifya novel environment which productively facilitates scoping universal quantifiersout embedded clauses, involving the manipulation event structure. With thehelp perfect on an embedding verb and certain adverbials presuppose abuildup towards a res...

Drawing on recent work in inquisitive semantics, this paper presents a new perspective on modals and quantifiers, which has the potential to address a number of challenges that have been raised for standard approaches to such operators. To illustrate the new perspective, we present an inquisitive take on the semantics of attitude verbs, and on quantifiers taking scope out of questions.

In this paper, we describe how quantifiers can be generated in a text generation system. By taking advantage of discourse and ontological information, quantified expressions can replace entities in a text, making the text more fluent and concise. In addition to avoiding ambiguities between distributive and collective readings in universal quantification generation, we will also show how differe...

We present two proofs, one proof-theoretic and one model-theoretic, showing that adding the ß ^-collection axioms to any bounded first-order theory R of arithmetic yields an extension which is V ̂ -conservative over R. Preliminaries. A theory of arithmetic R contains the nonlogic symbols 0, S, +, ■, and < . R may contain further nonlogical symbols; in particular S2 is a theory of arithmetic [1]....

In this paper we studied the interpretation of sentences with Dutch universal quantifiers alle ( all ) and elke each in collective, distributive cumulative situations. first experiment, 25 adults 30 children from 5 6 years old performed a truth-value judgement task. Adults show similar interpretations for collective distributive, but perform different cumulative. As follow-up preference Partici...

Fräıssé studied countable structures S through analysis of the age of S, i.e., the set of all finitely generated substructures of S. We investigate the effectiveness of his analysis, considering effectively presented lists of finitely generated structures and asking when such a list is the age of a computable structure. We focus particularly on the Fräıssé limit. We also show that degree spectr...