标准命题演算系统定理 standard proposition calculations system theorems
引入了可分命题和可分命题定理，利用该定理统一证明数学分析中的定理，极大简化了这些定理的证明过程。
This article is to introduce separable proposition and separable proposition theorem, then to prove theorems in real number field by using separable proposition in a union form.
高德的不完备定理的主要结论是，所有的逻辑体系都会存在无法证明或证伪的命题。 因此，所有的逻辑体系都不“完备”。
The main conclusion of Gödel’s incompleteness theorems is that all logical systems will have statements that cannot be proven or disproven; therefore, all logical systems must be “incomplete.”
其次，为使此定理的应用变得直接简便，我们还给出了关于拓扑空间（组）之间同伦等价的几个命题。
Secondly, in order to favor utilizing this theorem, several propositions are given on the homotopy equivalence between two topological space sets.
应用推荐