量词消去

完全二叉树的一阶理论已被证明具有量词消去的性质，进而计算了完全二叉树模型中元素的CB秩。

The first-order theory of a complete binary tree is decidable by the quantifier elimination , we also know the CB rank of elements of a complete binary tree .

二次参数实整混合线性优化的量词消去法

Parametric Quadratic Mixed Real - Integer Optimization By Quantifier Elimination

这一算法依赖于Hilbert第17问题的一系列经典研究结果以及实闭域上量词消去的柱形代数剖分算法。

The algorithm is based on a series of research results of Hilbert 17th problem and Cylindrical Algebraic Decomposition .

量词消去法在完全理论证明中的应用

Application of Elimination of Quantifiers in the Proof of Complete Theory

素数阶群理论的量词消去算法及其上界

Algorithmic Quantifier Elimination and Its Upper Bound for the Theory of Groups of Prime Orders

完全二叉树的量词消去

Quantifier Elimination for Complete Binary Trees

量词消去法已经成为计算机科学和代数模型论中最有力的研究工具之一。

The method of quantifier elimination has been one of the powerful tools in the computer science and algebraic model theory .

利用理论的代数素模型和简单闭性质，给出了完全稠密二叉偏序理论可量词消去的新的简短的证明。

Based on the theoretic model of algebraical prime and simple closed properties , a new short proof for quantifier elimination of the theory of complete dense binary orders was presented .

清楚地叙述了自然推理系统中的存在量词消去规则和全称量词引入规则满足的条件，而这些条件在许多离散数学教科书中叙述得相当含糊。

The conditions satisfied for the existential instantiation and the universal generalization in the natural deduction system are described clear , whereas they are described rather vaguely in many textbooks on discrete mathematics .

与某些教科书中存在量词消去规则只能用于无自由变元的公式不同，按照本文给出的条件，存在量词消去规则也可以用于有自由变元的公式，因而增强了系统的推理能力。

Contrasting with that the existential instantiation in some textbooks is used only for formulas without free variables , according to the condition we given , it may be also used for formulas with free variables and the ability to reason has increased . Freedom freedom ;