The familiar semantics for first - order logic is extensional in that it is involved in individual objects rather than in any property entities 摘要熟知的一阶逻辑语义因为只论及个体对象而不涉及属性实体而被认为是外延的。
Is generalized to be valued in complete weak complemented lattices . for finite linearlyordered weak complemented lattice , some properties on elementary extension of models for 的一阶逻辑的二值弱模型推广到取值于完备弱可补格上。
Firstly , a formal model of tpm is built using first - order logic language . then logic reasoning is made on the formal model 首先,在论文中用一阶逻辑语言建立可信平台模块api的形式化模型,然后对建立的形式化模型进行逻辑推理分析。
The paper explores the conditions of reasoning rules for predication logic based on logic relationship associating with employing counter - examples 摘要基于一阶逻辑相关概念的内涵，结合恰当的反例，探析了一阶逻辑推理规则成立的条件。
In view of the importance of equality , the thesis proposes the paramodulaton in bofl . at beginning , we give the equality axiom set and the reflexive axiom set 接着把一阶逻辑中的调解法推广到bofl中并给出bofl中的相等公理集和反身公理集。
Through the intensional interpretation , first - order language gets more close to the semantics of natural language , and is truly neutral to all kinds of subject matter 比之于外延语义的解释，内涵语义的解释使一阶语言更接近于自然语言的语义，而且也使一阶逻辑对各种题材真正保持了逻辑的中立性。
But besides being characterized by the extensional semantics , first - order logic can be characterized soundly and completely by such an intensional semantics that includes nothing but the property entities 相对于这一外延语义，一阶逻辑还可为其中只含属性实体而不含个体对象的内涵语义一致且完备地刻画。
The two - valued weak model of the first order logic with generalized quantifier q is generalized to be valued in complete weak complemented lattices . for finite linearly - ordered weak complemented lattice , the omitting type theorem is proved 将带广义量词q的一阶逻辑的二值弱模型推广到取值于完备弱可补格上，对有限的线性序弱可补格证明了省略型定理。
Then a simple e - dealing system is devised to show the thoughts of the protocol . in order to formalize and verify the protocol , bzl logic model is built , which based on first - order logic and introduces many - sorted , dynamic and non - monotony logic 为了形式化验证数字现金的安全性，本文在经典一阶逻辑的基础上，吸取了多类逻辑、动态逻辑和非单调逻辑的思想，提出了bzl逻辑模型。
In the end the thesis compares its work to relative work . and draw a few advantages as follow : firstly , the paramodulation in bofl is more concise and nature . its form is unified with the paramodulation in first - order logic 最后，我们把本文的工作与相关工作进行比较，得到如下几点优于现有算子模糊逻辑中的调解方法的结论：首先， bofl中的调解十分简洁自然，在形式上与一阶逻辑中的调解法是统一的。
