查询词典 theorem

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

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广义文字)的方法，把α-归结原理转换成矩阵的列变换。

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语义的关系语义完全性定理，由此通过将关系语义转化为代数语义从而亦推得其代数语义完全性定理。

The central goal of this work is trying to generalize the above result to the Higgs version case, which should be helpful to the study of some question, say variants of the Kobayashi-Hitchin correspondence. The theorem to be proved here is the followingTheorem 02: Let M be a compact complex manifold of dimension m with a Hermitian standard metric g and let be a Higgs bundle over M.

本文的一个主要的目的是把上面的定理推广到E是—Higgs向量丛的情形；这一结果的意义在于在研究与Kobayashi-Hitchin correspondence相关的问题，如考虑Kobayashi-Hitchin correspondence的形变展现它的作用。

In this paper, we introduce the algorithm of Schoof-Elkies-Atkin to compute the order of elliptic curves over finite fields. We give out a fast algorithm to compute the division polynomial f〓 and a primitive point of order 2〓. This paper also gives an improved algorithm in computing elliptic curve scalar multiplication. Using the method of complex multiplication, we find good elliptic curves for use in cryptosystems, and implemented ElGamal public-key scheme based on elliptic curves. As a co-product, we also realized the algorithm to determine primes using Goldwasser-Kilian's theorem. Lastly, the elliptic curve method of integer factorization is discussed. By making some improvement and through properly selected parameters, we successfully factored an integer of 55 digits, which is the product of two 28-digit primes.

本文介绍了计算有限域上椭圆曲线群的阶的Schoof-Elkies-Atkin算法，在具体处理算法过程中，我们给出了计算除多项式f〓的快速算法和寻找2〓阶本原点的快速算法；标量乘法是有关椭圆曲线算法中的最基本运算，本文对[Koe96]中的椭圆曲线标量乘法作了改进，提高了其运算速度；椭圆曲线的参数的选择直接影向到椭圆曲线密码体的安全性，文中利用复乘方法构造了具有良好密码特性的椭圆曲线，并实现了椭圆曲线上ElGamal公钥体制；文中还给出了利用Goldwasser-Kilian定理和椭圆曲线的复乘方法进行素数的确定判别算法；最后讨论了利用椭圆曲线分解整数的方法并进行了某些改进，在PC机上分解了两个28位素数之积的55位整数。

We have no common name for a mime of Sophron or Xenarchus and a Socratic Conversation; and we should still be without one even if the imitation in the two instances were in trimeters or elegiacs or some other kind of verse--though it is the way with people to tack on 'poet' to the name of a metre, and talk of elegiac-poets and epic-poets, thinking that they call them poets not by reason of the imitative nature of their work, but indiscriminately by reason of the metre they write in.

索夫农 、森那库斯和苏格拉底式的对话采用的模仿没有一个公共的名称；三音步诗、挽歌体或其他类型的诗的模仿也没有——人们把&诗人&这一名词和格律名称结合到一起，称之为挽歌体诗人或者史诗诗人，他们被称为诗人，似乎只是因为遵守格律写作，而非他们作品的模仿本质。

The relationship between communicative competence and grammar teaching should be that of the ends and the means.

交际能力和语法的关系应该是目标与途径的关系。