weak completeness

weak completeness的基本解释

-

弱完备性

与weak completeness相关的网络例句 [注：此内容来源于网络，仅供参考]

Then we deeply studied the completeness of LP . Consequently, we established:(1) The completeness theorem of LP with truth-value in finite Lukasiewiczchain;(2) The completeness theorem of LP with truth-value in complete and atomic lattice implication algebras;(3) The completeness theorem of LP with truth-value in injective lattice implication algebras.

建立了：（1）基于Lukasiewicz有限链的格值命题逻辑系统LP的完备性定理；（2）基于完备的且原子的格蕴涵代数的格值命题逻辑系统LP的完备性定理；（3）基于内射的格蕴涵代数的格值命题逻辑系统LP的完备性定理。

For an abitrary set X, appropriate order relations on WCL (the set of all weak closure operators), WIN (the set of all weak interior operators), WOU (the set of all weak exterior operators), WB (the set of all weak boundary operators), WD (the set of all weak derived operators), WD*(the set of all weak difference derived operators), WR (the set of all weak remote neighborhood system operators) and WN (the set of all weak neighborhood system operators) can be defined respectively, which make WCL, WIN, WOU, WB, WD, WD*, WR and WN to be complete lattices that are ismorphic to CS(X,CS is the set of all closure systems on X.

证明了可以在WCL(X上的弱闭包算子的全体)、 WIN(X上的弱内部算子的全体)、 WOU (X上的弱外部算子的全体)、 WB (X上的弱边界算子的全体)、WD、 WD*(X上的弱差导算子的全体)、 WR(X上的弱远域系算子的全体)和WN(X上的弱邻域系算子的全体)上定义适当的序关系，使它们成为与CS(X，〖JX-*5[JX*5]同构的完备格其中CS(X是给定集合X上的闭包系统的全体。

It is known from the experimental outcome that the sound frequency in attached area with defect is high and with completeness is low; the intensity in attached area with defect is weak and with completeness is strong.

经实验结果可得知瓷砖黏贴缺陷处之声音频率较高，而黏贴完整处之声音频率较低；瓷砖黏贴缺陷处之黏著强度较小，而黏贴完整处之黏著强度较大。

与weak completeness相关的网络解释 [注：此内容来源于网络，仅供参考]

weak completeness：弱完备性

weak closure 弱闭包 | weak completeness 弱完备性 | weak continuity 弱连续性