查询词典 completeness theorem

Then we deeply studied the completeness of LP . Consequently, we established:(1) The completeness theorem of LP with truth-value in finite Lukasiewiczchain;(2) The completeness theorem of LP with truth-value in complete and atomic lattice implication algebras;(3) The completeness theorem of LP with truth-value in injective lattice implication algebras.

建立了：（1）基于Lukasiewicz有限链的格值命题逻辑系统LP的完备性定理；（2）基于完备的且原子的格蕴涵代数的格值命题逻辑系统LP的完备性定理；（3）基于内射的格蕴涵代数的格值命题逻辑系统LP的完备性定理。

In the paper we generalize the while-rule in Hoare calculus to an infinite one and then present a sufficient condition much weaker than the expressiveness for Cook'2 relative completeness theorem with respect to our new axiomatic system.

程序推理使用的抽象机器与物理机器的差距降低了推理的精确度，为了缩小这个差距，本文提出了一个带位级别抽象的新抽象机，在这个机器里，二进制整数以纯语法的方式被表示成位矢量而不是非负整数。

The completeness theorem of this method were proved at last.

最后， 证明了该方法的完备性。

At last, we give two simplified proof for the necessary lemma in order to prove the completeness theorem of PI resolving.

第二部分：基于均匀概率的思想，给出了Godel和Kleene三值命题逻辑系统中公式的真度理论。

The details of proving the completeness theorem of formula system L~*, which is given by Prof. Wang, are reviewed, and the proving of strong completeness about L~* is analyzed and revised.

考察了形式系统*完备性的现有证明过程，并对其中所涉及的R0代数同构问题进行了研究，分析了关于*系统强完备性证明中的错误并给出了一个全新的修正证明。

Completeness Theorem showsthat syntactic and semantic consequences coincide in the case of the predicatelogic.

完全性定理表明一阶谓词逻辑的语法后承和语义后承是重合的，它标志着一阶逻辑的成熟。

Because Horn-clause logic theory is of significance in both respects of theory and application, We especially studied lattice-valued Horn-clause logic with truth-value in lattice implication algebra, and the soundness and completeness theorem have been proved.

经典逻辑中，Horn子句逻辑理论具有广泛的应用，因而，本文中特别建立了基于格蕴涵代数的格值-类Horn子句逻辑，并证明了可靠性和完备性定理，这为建立一类基于格值逻辑这种非经典逻辑的人工智能语言将产生重要的作用。

The soundness and completeness theorem of this method were proved at last. 5. The a-automated reasoning method based on the a-resolution principle of LP was discussed, the author given a method to describe the set of simple generalized clauses (veriables and non-subregular 1 - IBSFs are only contained) by using a matrix, and translated the a-resolution of two clauses to column operations of this matrix.

最后，证明了该方法的可靠性和完备性； 5、对格值命题逻辑系统LP中基于α-归结原理的α-自动推理方法进行了研究，给出了用符号矩阵表示一类简单的广义子句集合(只含命题变元和非正则1-IESF广义文字)的方法，把α-归结原理转换成矩阵的列变换。

The soundness and completeness theorem of this method were proved at last. This part consists of the following points: 1. The properties of the indecomposable extremely simple form of LP were discussed, the theorem shown that every logical formula of LP was equals of a generalized conjunction normal form. 2. The method for judging a logical formula is a indecomposable extremely simple form or not was discussed, the necessary and sufficient conditions of a logical formula with not more than three implicative connective being a indecomposable extremely simple form was given. 3. The α-resolution fields of the indecomposable extremely simple form of LP were discussed, some elementary results were obtained. 4. The automated reasoning method based on the resolution principle of classical logic was discussed, the author given a method to describe the set of clauses by using a matrix, and translated the resolution of two clauses to column operations of this matrix.

二、关于格值命题逻辑系统LP中α-自动推理方法的研究 1、对LP中不可分极简式的性质进行了研究，证明了LP中任何一个格值逻辑公式等值于一个广义合取范式； 2、对LP中不可分极简式的判定方法进行了研究，讨论了含有不超过3个蕴涵运算的格值逻辑式为不可分极简式的充分必要条件； 3、对LP中不可分极简式的α-归结域进行了研究，得到了一些基本结果； 4、对经典逻辑中基于归结原理的自动推理方法进行了研究，给出了用符号矩阵表示子句集合的一种方法，把不同的归结过程转换成矩阵的列变换。

Refering to the Godel's in completeness theorem,the logic implication of paramārtha truth can be rationally interpreted.

玄奘所传唯识学的唯识无境说仍有所本于陈那的《观所缘缘论》，该论主张所缘缘为识体起现时内蕴。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。