Abstract
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.
Publisher
Ediciones Universidad de Salamanca
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Semantics of Propositional Attitudes in Type-Theory of Algorithms;Lecture Notes in Computer Science;2024
2. Restricted Computations and Parameters in Type-Theory of Acyclic Recursion;ADCAIJ: Advances in Distributed Computing and Artificial Intelligence Journal;2023-07-20
3. Logic Operators and Quantifiers in Type-Theory of Algorithms;Lecture Notes in Computer Science;2023
4. Proposing to Use Artificial Neural Networks for NoSQL Attack Detection;Distributed Computing and Artificial Intelligence, Special Sessions, 17th International Conference;2020-07-29
5. Algorithmic Eta-reduction in Type-theory of Acyclic Recursion;Proceedings of the 12th International Conference on Agents and Artificial Intelligence;2020