| 1. | An algebraic proof of completeness theorem of first - order logic
一阶逻辑完备性定理的代数证明 |
| 2. | Generating sat instances from first - order formulas
由一阶逻辑公式得到命题逻辑可满足性问题实例 |
| 3. | An axiomatics for first - order logic
经典一阶逻辑的希尔伯特型系统 |
| 4. | Proving several theorems in first order logic based on back - and - forth method
向前向后法证明一阶逻辑的几个定理 |
| 5. | It may be said that the way by which for explaining existential issue is preferably successful
可以说，利用一阶逻辑解释存在问题的方法是比较成功的。 |
| 6. | R . cori & d . lascar : mathematical logic ? a course with exercises , part i . oxford university press , 2001
陈慕泽余俊伟：数理逻辑基础? ?一阶逻辑与一阶理论，中国人民大学出版社2003 。 |
| 7. | First - order rule mining technique based on first - order logic is often called as inductive logic programming ( ilp )
基于一阶逻辑的一阶规则挖掘技术常被称作归纳逻辑程序设计( ilp ) 。 |
| 8. | The aim we establish the logic frame bofl ( boolean operator fuzzy logic ) is to solve the innate limitation of the first - order logic
布尔算子模糊逻辑(简称bofl )就是为了试图解决一阶逻辑的这些局限性而建立的逻辑框架。 |
| 9. | The familiar semantics for first - order logic is extensional in that it is involved in individual objects rather than in any property entities
摘要熟知的一阶逻辑语义因为只论及个体对象而不涉及属性实体而被认为是外延的。 |
| 10. | Is generalized to be valued in complete weak complemented lattices . for finite linearlyordered weak complemented lattice , some properties on elementary extension of models for
的一阶逻辑的二值弱模型推广到取值于完备弱可补格上。 |
