- 更多网络例句与可证公式相关的网络例句 [注：此内容来源于网络，仅供参考]
-
Based on the two normal forms, the decidability theorem in L is then proved and a deduction-based decision algorithm P is designed. The time complexity O(n3) of P is much less than the complexity O(2n) of the true value table method and the complexity O(n5) of HAL based on the tactic scheme.
首先定义了消解复杂性的两种范式：最简范式和文字范式，在此基础上采用演绎方法证明了L中的可判定性定理，并设计了命题公式的演绎判定算法P。P的时间复杂度为O(n^3)，远远小于基于真值表法的O(2^n)和基于策略方案HAL的O(n^5)。
-
It is shown that two-component Wadati-Konno-Ichikawa equation, i.e. a generalization of the wellknown WKI equation is obtained from the motion of space curves in Euclidean geometry, and it is exactly a system for the graph of the curves when the curve motion is governed by the two-component modified Korteweg-de Vries flow. At the same time, a n-component generalization to the WKI equation is obtained. Also, starting from the motion of curves, mKdV and its symmetry recursion operator is exhibited explicitly; two- and n-component mKdV systems are obtained. It is shown that WKI systems are gauge equivalent to mKdV systems. The two-component WKI equation admits an infinity number of conservation laws and a recursion formula for the conserved densities is given by considering an eigenvalue problem together with introducing an appropriate transformation.
在二维和三维欧氏空间上，我们从空间曲线运动出发，推导出了mKdV方程以及它的用以生成高阶对称的递归算子；推导出了多元mKdV方程以及二元和多元WKI方程，并证明了WKI系统和mKdV系统的规范等价性；尔后，通过考虑特征值问题，并引入一个恰当变换，给出了二元WKI方程的用以计算无穷多守恒密度的递归公式，从而证明了二元WKI方程的守恒可积性；系统地分析了两种mKdV方程的Painleve性质，并分别给出了两种不同形式的二元和n元mKdV方程的共振点出现的规律。
- 更多网络解释与可证公式相关的网络解释 [注：此内容来源于网络，仅供参考]
-
provability：可证性
protuberant 凸的 | provability 可证性 | provable formula 可证公式
-
provable formula：可证公式
provable 可证媚;可证的 | provable formula 可证公式 | prove 证明论证
-
provable：可证媚;可证的
provability 可证迷 | provable 可证媚;可证的 | provable formula 可证公式
-
testability：可检验性
衡量一种理论的科学地位的标准是它的可证伪性(falsifiability)或可反驳性(refutability)或可检验性(testability),而不是它的可证实性. 科学是在不断证伪过程中持续发展的,科学发展的模式如下公式所示:境由心造,理念犹如人脑这架超级计算机的"程序",