Underspecified Quantification by the Theory of Acyclic Recursion

摘要

The paper introduces a technique for representing quantifier relations that can have different scope order depending on context and agents. The technique is demonstrated by classes of terms denoting relations, where each of the arguments of a relation term is bound by a different quantifier. We represent a formalization of linking quantifiers with the corresponding argument slots that they bind, across λ-abstractions. The purpose of the technique is to represent underspecified order of quantification, for computationally efficient and adequate representation of scope ambiguity in the absence of context and corresponding information about the order. Furthermore, the technique is used to represent subclasses of larger classes of relations depending on order of quantification or specific relations.