查询词典 completeness

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三值命题逻辑系统中公式的真度理论。

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子句逻辑，并证明了可靠性和完备性定理，这为建立一类基于格值逻辑这种非经典逻辑的人工智能语言将产生重要的作用。

Compared with Plotkin's work, a reduction closed CPS language is defined in which all continuations are explicitly expressed as functional encodings and it is simpler to prove both the soundness and completeness directions of simulation theorem.

与Plotkin的工作比较，工作特点在于，给出了一个CPS归约闭语言，该语言中所有继续都可以用函数形式表达，且模拟定理的可靠性和完备性方向证明更为简单。

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.

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

Algebraic semantics ; Barcan formula ; Kripke's relational semantics ; nested domains ; Kripke's special semantic ; completeness theorem

代数语义； Barcan－公式； Kripke的关系语义；嵌套论域；狭义Kripke语义；完全性定理

In this paper we acquaint the reader first with the algebraic semantics which is corre-sponding to the Kripke's semantic having nested domaius. By an application of the completenesstheorem on relational semantics of the quantified normal modal systems with nested domains proved in Hughes and Cresswell's method to prove a completeness theorem on relational algebraic semantics of those system. Next for normal systems with semantics which admits arbi-trarily variable domains we use Henkin's method to prove a c...

本文首先讨论嵌套论域语义的相应代数语义并由Hughes和Cresswell在［5］中建立的关于具有嵌套论域的正规量词模态系统的关系语义完全性定理推出其相应的代数语义完全性定理：然后对于具有任意可变论域语义的正规系统，我们用Henkin方法给出其关于狭义Kripke语义的关系语义完全性定理，由此通过将关系语义转化为代数语义从而亦推得其代数语义完全性定理。

This one mode pays close attention to network credence foundation of the businessman very much.

这一模式非常关注商人的网络信用基础。

Cell morphology of bacterial ghost of Pasteurella multocida was observed by scanning electron microscopy and inactivation ratio was estimated by CFU analysi.

扫描电镜观察多杀性巴氏杆菌细菌幽灵和菌落形成单位评价遗传灭活率。