1) the rule of elimination of the universal quantifier
全称量词消去规则
2) the rule of elimination of the existential quantifier
存在量词消去规则
3) quantifier elimination
量词消去
1.
It is shown that if ring theory is added to a new theory which has quantifier elimination,any model of this new theory is an inductive ring.
证明了环理论扩充到具有量词消去理论时,其任意模型都是归纳环,而且带有一阶可定义序关系的环理论扩充到具有量词消去时,其模型是双向归纳环。
2.
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.
利用理论的代数素模型和简单闭性质,给出了完全稠密二叉偏序理论可量词消去的新的简短的证明。
3.
Basing on the model-theoretic properties of having algebraically prime models and being simply closed for first-order theories,we present new proofs for quantifier elimination of theories of complete forked trees,including theory of complete k(k<ω)-ary trees and of complete infinite-ary trees, which simplify original proofs extremely.
利用理论的代数素模型和简单闭性质,我们给出了完全k(k<ω)-叉树理论和完全无穷叉树理论可量词消去的新的证明,很大程度上简化了原有证明。
4) universal quantifier
全称量词
1.
Taking three relations for example, applyin some relevant theories to discrete mathematics, this article converses the query of the universal quantifier problem into the query of equivalent existential quantifier, then to achieve it in SQL.
以三个关系为例，应用离散数学的有关理论，把具有全称量词的查询问题转换成等价的存在量词的直询问题，并用SQL语言予以实现
2.
Data query for proposition with universal quantifier and data query for implication proposition are two categories of the most practical and difficult data queries.
带有全称量词命题与蕴含命题的数据查询是数据库应用系统中最实用的两类查询,但也是最难的两种数据查询。
3.
However,they are not universal quantifiers per se as they do not require exhaustive inclusion.
但是它们不同于逻辑上的全称量词,只要求达到一定程度,不要求全部。
5) complete quantifier elimination
量词消去法
1.
The following new theorems are obtained: Theorem 1 The Theory of Boolean algebra without atomic elements has a complete quantifier elimination i.
得到了下面的新定理 :定理 1 无原子布氏代数理论Δ具有完全的量词消去法 ,也就是说每一个式子都Δ等价于一个开式子 。
6) elimination of quantifier
量词的消去
补充资料：全称量词
全称量词
universal quantifier i$ universal quantor
全称量词【.面versaiq，姗d五er或~ersal qUantor;Bce06川“ocT“kBa“Topl 一个逻辑算子，用来形成“对于所有x”的表示式所组成的命题.在形式语言中全称量词最常见的表示式记作丫x，(V汉)，或者(x).也可以用记号(Ax)，八、，自、，fl、等.B.E.n:HeK。撰【补注】亦见量词(甲坦ntifier). 罗里波译王世强校
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条