Relationships between Specified and Underspecified Quantification by the Theory of Acyclic Recursion

• LOUKANOVA, Roussanka ^[1]
  1. [1] Stockholm University

     Stockholm University

     Suecia

     
• Localización: ADCAIJ: Advances in Distributed Computing and Artificial Intelligence Journal, ISSN-e 2255-2863, Vol. 5, Nº. 4, 2016, págs. 19-42
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • The paper introduces a technique for representing quantifier relations that can have different scope order depending on context. 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 lambda-abstractions and reduction steps. The purpose of the technique is to represent underspecified order of quantification, in the absence of a context and corresponding information about the order. Furthermore, it is used to represent subclasses of larger classes of relations depending on order of quantification or specific relations.