<?xml version="1.0" standalone="yes"?>
<Paper uid="E83-1001">
  <Title>ABSTRACT CONTROL STRUCTURES AND THE SEMANTICS OF QUANTIFIERS</Title>
  <Section position="2" start_page="0" end_page="0" type="intro">
    <SectionTitle>
ABSTRACT
</SectionTitle>
    <Paragraph position="0"> Intuitively, a Ruantifier is any word or phrase that expresses a meaning that answers one of the questions &amp;quot;How many?&amp;quot; or &amp;quot;How much?&amp;quot; Typical English examples include all, no, many, few, some but not many, all but at most a ver~ few, wherever, whoever, whoever there is, and also, it can be argued, 0nly (Keenan, 1971), also (Cushing, 1978b), and the (Chomsky, 1977). In this paper we review an empirically motivated analysis of such meanings (Cushing, 1976; 1982a) and draw out its computational significance. For purposes of illustration, we focus our attention on the meanings expressed by the English words whatever and some, commonly represented, respectively, by the symbols &amp;quot;~&amp;quot; and &amp;quot;3&amp;quot;, but most of what we say will generalize to the other meanings of this class.</Paragraph>
    <Paragraph position="1"> In Section I, we review the notion of satisfaction in a model, through which logical formulas are customarily imbued implicitly with meaning. In Section 2, we discuss quantifier relativizatlon, a notion that becomes important for meanings other than ~ and 3. In Section 3, we use these two notions to characterize quantifier meanings as structured functions of a certain sort. In Section 4, we discuss the computational significance of that analysis. In Section 5, we elaborate on this significance by outlining a notion of abstract control structure that the analysis instantiates.</Paragraph>
  </Section>
class="xml-element"></Paper>