完备性

基本解释 (translations)

sigmacompleteness

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

In this paper,a systematic direct perturbation method of dark solitons is found.Having analyzed the mistakes in earlier works on perturbation method for dark solitonsand essence of the direct perturbation method for bright solitons,we notice that to in-troduce the adjoint solutions of the squared Jost solutions and to prove the completenessare crucial to the problem.Giving up the unnecessary scheme of introducing the adjointoperator in the bright soliton case,we directly find the adjoint solutions by meetingthe demand for the orthogonality that inner product of the squared Jost solutions andits adjoint should be proportional to a δ function in the case of continuous spectra.The corresponding adjoint operator is thus found.Taking into account the reductiontransformation,we find a correct description for the completeness of the squared Jostsolutions and directly verify its validity with explicit expressions of the squared Jostsolutions.

本论文建立了系统的暗孤子直接微扰方法，在对前人关于暗孤子微扰方法的错误以及亮孤子直接微扰方法的本质作了充分的分析后，认识到引入平方Jost解的伴随解和证明完备性是问题的关键，撇开过去亮孤子情况首先引入伴随算子的非必要作法，直接从平方Jost解与其伴随解的内积在连续谱时正比于δ函数这一正交性要求出发，找出了伴随解，同时得出了应有的伴随算子，在考虑到约化变换性后，得到了暗孤子情况的平方Jost解的完备性的正确表述，并在单个暗孤子的情况利用平方Jost解的显式直接验证了它的正确性。

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的完备性定理。

At completeness in theory, we give the base of mathematical morphology-complete lattice, and some nature of complete lattice.

作为理论上的完备性，我们给出了数学形态的代数学基础——完备格理论，并简单的介绍了完备格及其性质。

The details of proving the completeness theorem of formula system L~*, which is given by Prof. Wang, are reviewed, and the proving of strong completeness about L~* is analyzed and revised.

考察了形式系统*完备性的现有证明过程，并对其中所涉及的R0代数同构问题进行了研究，分析了关于*系统强完备性证明中的错误并给出了一个全新的修正证明。

We introduce the uniform Hausdorff metric H on the space 〓 offuzzy complex numbers and investigate the topological structure of 〓.We show the completeness of 〓 and study on 〓 limits of thesequence of fuzzy complex numbers,metrical and leverwise convergence,and relation between metrical convergence and leverwise convergence.Weprove the equivalence theorem of metrical convergence and leverwiseconvergence on 〓.

在模糊复数空间〓上引进一致Hausdorff度量H，讨论了模糊复数空间的拓扑结构，证明了的完备性，并在完备的模糊复数度量空间上研究了模糊复数列的极限、度量收敛和水平收敛，讨论了度量收敛与水平收敛之间的关系，在上证明了度量收敛与水平收敛的等价性定理。

The method used to check for completeness is based on a set of sufficient conditions proposed by Guttag and Horning We weakened the definition of the measure function and the conditions under which an extension function can be converted to constructors and generators.

完备性的验证方法是，以Guttag-Horning的一组完备性充分条件为基础，放宽其中测度函数的定义，以及扩充函数可以转为生成函数与构造函数的判别条件，拓广了充分条件的适用范围。

In this thesis, we study the problem from the angle of completion of shareholders' voting rights, and prove that the reason of disequilibrium in Chinese stock market is that the incompletion of the shareholders' voting rights.

本文在推导出股票市场均衡条件的基础上，通过对股东投票权完备性与投资者行为选择关系的研究，揭示了中国股票投资者投票权的非完备性及其所导致的投资者投机一致性行为选择。

The relation between the completeness of several local convex topology in normed vector space and that of induction topology of its unit ball was pointed out in this paper.

本文指出了赋范线性空间上的一些局部凸拓扑的完备性与它的单位球上相应的诱导拓扑的完备性之间的关系。

Because the data categoricalness rules of architecture products are embodied in theCADM described by IDEF1X, the data categoricalness rules are directly established according to the relationship, which is described by the IDEF1X, among the data entity of CADM described by the IDEF1X. Then every item of data which is in the form of CADM criterion and stored in the database is checked according to the categoricalness rules, so that the data categoricalness of C~4ISR system architecture is executed.3. The verification methods of system accessibility based on CADM are studied.

2研究了基于CADM的数据完备性验证方法由于体系结构产品中数据元素的完备性规则已经完全表现在用IDEF1X描述的CADM模型中，所以论文根据IDEF1X对CADM数据实体之间关系的描述，直接建立了数据元素的完备性规则，然后根据完备性规则对以CADM规范存放在数据库中的每条数据进行检查，以此对C~4ISR系统体系结构数据进行完备性验证。

The research involves constructing network error model, choosing interpolation method, computing and validating integrity index for error correction, calculating user protection level.

算法主要包括网络系统完备性算法和用户完备性算法，内容包括网络误差模型的建立、插值算法的选择、误差改正数完备性指标的计算、完备性指标的验证和用户保护水平的计算等。

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

axiom of completeness：完备性公理

axiom of choice 选择公理 | axiom of completeness 完备性公理 | axiom of comprehension 概括公理

axiom of completeness：完备性公设;完备性公理

832,"axiom of closure","闭合公设;闭合公理" | 833,"axiom of completeness","完备性公设;完备性公理" | 834,"axiom of congruence","全等公设;全等公理"

completeness of axiom systems：公理系统的完备性

表现系的完备性 completeness for representations | 公理系统的完备性 completeness of axiom systems | 推理规则的完备性 completeness of rules of inference

completeness theorem：完备性定理

可靠性定理 soundness theorem | 完备性定理 completeness theorem | 紧致性定理 compactness theorem

completeness：完备性

这个原理,爱因斯坦称之为"完备性"(completeness),向量子力学的最本质特性发起了挑战. 1951年,当我刚拿到博士学位并在普林斯顿高级研究所做博士后的时候,戴维是普林斯顿大学的助理教授. 我们俩都是单身汉,常常在傍晚绕着普林斯顿散步,

weak completeness：弱完备性

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

completeness of exponential family：指数族的完备性

完全性;完备性 completeness | 指数族的完备性 completeness of exponential family | 顺序统计量的完备性 completeness of order statistics

incompleteness：不完备性

哥德尔(Kurt Godel)1931年在>中提出了两个不完备性(incompleteness)定理并证明了第一个而给出了第二个的证明梗概.

sigmacompleteness：完备性

sigma space 空间 | sigmacompleteness 完备性 | sigmafield of sets 集的域

topological completeness：拓扑完备性

topological circle 拓扑圆 | topological completeness 拓扑完备性 | topological complex 拓扑复形