哥德尔不完备性定理抽走了数学家的逻辑美信仰，数学界出现了信仰危机。
Godel theorem made mathematicians lose their belief of logic beauty, the crisis of belief appeared in mathematical field.
利用中介逻辑的完备性，本文证明了紧致性定理，即一理论有模型当且仅当其任一有穷子集有模型。
The compact theorem is proved, which states that theory T has model if and only if any finite subset of T has model.
之后，美籍逻辑学家歌德尔一阶谓词演算的完备性定理，这标志着现代逻辑基础部分的完成。
After this, American Logician Kurt Godel proved the completeness theory of predicate calculus. This means the completion of the base of Modern Logic.
由此可见罗尔微分中值定理可以是实数的完备性的直接推论。
This implies that Rolles Theorem is the direct consequence of completeness of real numbers.
本文的目的是：为基本的一阶时态逻辑建立一个完备性定理。
The aim of this article is to establish the completeness theorem of elementary first-order temporal logic.
工作哥德尔表明，任何有用的系统算法可以是一致的和完整的：见哥德尔的不完备性定理。
Thework of Kurt Gödel has shown that no useful system of arithmetic can beboth consistent and complete: see Gödel's incompleteness theorems.
提出改进算法，改进算法的理论基础是直接相连和间接相连定理，它具有交换机的发现完备性并且可以对哑设备进行处理。
Compared with the original algorithm, this improved algorithm can discovery more devices, and can decreases the requirements of AFT of switches.
提出改进算法，改进算法的理论基础是直接相连和间接相连定理，它具有交换机的发现完备性并且可以对哑设备进行处理。
Compared with the original algorithm, this improved algorithm can discovery more devices, and can decreases the requirements of AFT of switches.
应用推荐