Relationships between Specified and Underspecified Quantification by the Theory of Acyclic Recursion
2016 (English)In: ADCAIJ: Advances in Distributed Computing and Artificial Intelligence Journal, ISSN 2255-2863, Vol. 5, no 4, 19-42 p.Article in journal (Refereed) Published
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.
Place, publisher, year, edition, pages
2016. Vol. 5, no 4, 19-42 p.
recursion, type-theory, semantics, algorithms, denotation, reduction, quantifiers, underspecification
Computer and Information Science Mathematics Computer Science Language Technology (Computational Linguistics)
Research subject Computer Science; Computing Science; Computational Linguistics; Mathematical Logic; Mathematics
IdentifiersURN: urn:nbn:se:su:diva-141001DOI: 10.14201/ADCAIJ2016541942OAI: oai:DiVA.org:su-141001DiVA: diva2:1085158