<?xml version="1.0" standalone="yes"?>
<Paper uid="P92-1031">
  <Title>CONNECTION RELATIONS AND QUANTIFIER SCOPE</Title>
  <Section position="6" start_page="246" end_page="247" type="concl">
    <SectionTitle>
3. CONCLUDING REMARKS
</SectionTitle>
    <Paragraph position="0"> A cognitively adequate method for dealing with sentences that are ambiguous with regard to quantifier scope has been described in this paper. An underdetermined scope-ambiguous representation is assigned to a scope-ambiguous sentence and then extended by additional conditions from context and world knowledge, which further specify the meaning of the sentence. Scope determination in this procedure can be seen as a mere byproduct. The quantifier scope is completely determined when the representation which was generated in this way corresponds to an interpretation with a fixed scope. Of course, this only works if there is scope-determining information; if not, one continues to work with the scope-ambiguous representation.</Paragraph>
    <Paragraph position="1"> I use the language of second-order predicate logic here, but not the whole second-order logic, since I need deduction rules for scope derivation, but not deduction rules for second-order predicate logic (which cannot be completely stated). One could even use the formalism for scope determination alone and then translate the obtained readings into a first-order formalism. However, the formalism lends itself very easily to  representation and processing of the derived semantic knowledge as well.</Paragraph>
  </Section>
class="xml-element"></Paper>