s-完备,s-completion
1)s-completions-完备
1.We investigated the properties of s-completion by the set MH(G), and obtained some new conditions for the solvability of finite groups.利用集合MH(G)={M|M是不包含H的G之极大子群}研究有限群G的极大子群s-完备的性质,得到有限群G可解的一些新判据。
2.In this paper,we attempted to study the solvability of finite groups by using s-completions of maximal subgroups,and received several necessary and sufficient conditions about the solvability of a finite group.该文尝试用极大子群的s-完备来研究有限群的可解性,并得到了有限群可解的几个充分必要条件。
2)s-θ-completions-θ-完备
1.The s-θ-completions of Maximal Subgroups and the Solvability of Finite Groups极大子群的s-θ-完备与有限群的可解性
2.On the s-θ-completions of maximal subgroups and the π-solvability of a finite group有限群极大子群的s-θ-完备与π-可解性
英文短句/例句

1.On the s-θ-completions of maximal subgroups and the π-solvability of a finite group有限群极大子群的s-θ-完备与π-可解性
2.S-θ-Completions of the Maximal Subgroups and the Solvability of Finite Groups;极大子群的S-θ-完备与有限群的可解性
3.On h-Completion and θ-Completion for Maxmial Subgroups;有限群极大子群的h-完备与θ-完备
4.The S(n)-closed and S(n)-θ-closed Properties of θ-complexθ-复形的S(n)-闭性质及S(n)-θ-闭性质
5.The Category of S-dcpos and Congruences on S-latticesS-定向完备偏序集范畴和S-格同余关系
6.A Study on Ω-closed Sets, Ω_s-closed Sets and Strong (θ,s)-continuous Functions;关于Ω-闭集、Ω_s-闭集和强(θ,s)-连续映射的研究
7.Strong S completely regular and strong S completely normal spaces;强S-完全正则与强S-完全正规空间
8.After 14 days' hard travel, the cars of 2005 China Police Car Relay Race were able to arrive smoothly at its final destination, Zhuhai of Guangdong on August 9th.曛泄??炱?道?θ
9.Spare parts(s,S)inventories system based on Phase-type distribution and Markovian arrival process基于PH分布和MAP的备件(s,S)库存模型
10.That is, they will increase from delta to theta and then to alpha and finally, when the alarm goes off, into beta.即将从δ脑电波至θ脑电波、α脑电波,最后当人们完全清醒时为β脑电波。
11.Study on Information System of Equipment with C/S and B/S Mode;基于C/S与B/S混合模式的装备信息系统研究
12.Construction of an enzyme-coupled system consisting of (R)-and (S)-specific carbonyl reductases for one-step preparation of (S)-1-phenyl-1,2-ethanediol(R)与(S)-羰基还原酶偶联一步法制备(S)-苯乙二醇
13.How to Realize Data Integrity with C/S;基于C/S模式数据完整性约束的实现
14.The S(n)-factoring Numbet for a Complete Bipartite Graph;完全二部图的S~((n))={K_i:1≤i≤n}-因子数
15.Forθ phase transition, it is not suitable to selectθ as the order parameter.对于θ变,选取θ为序参量是不合适的。
16.Specifications of 600 bit/s TDM equipment for telegraph transmissionGB/T11052-1989600bit/s电报时分复用设备技术要求
17.Rapid Detection of S-HpAg by ELISA;酶联免疫S-HpAg快速诊断试剂盒的制备
18.Study on Selection of Reserving Harbor for Coal Transport of S Group;S公司煤炭运输备用港选择方案研究
相关短句/例句

s-θ-completions-θ-完备
1.The s-θ-completions of Maximal Subgroups and the Solvability of Finite Groups极大子群的s-θ-完备与有限群的可解性
2.On the s-θ-completions of maximal subgroups and the π-solvability of a finite group有限群极大子群的s-θ-完备与π-可解性
3)S-dcposS-定向完备偏序集
1.In this paper, some theoretical properties of Category Pos-S will be extended to thecategory of S-dcpos.基于序半群的S-系理论,本篇硕士论文将S-偏序集的一些结论推广到了S-定向完备偏序集和S-格上,主要研究了S-定向完备偏序集范畴和S-格同余关系。
4)completion[英][k?m'pli:?n][美][k?m'pli??n]完备
1.The Judgment of Inverse M-Matrix Completion Based on Digraph and Its Algorithm Design & Realization;基于有向图的逆M矩阵完备的判定及其算法的设计与实现
2.In the paper, the completion problems of the partial matrices are discussed.对此类型矩阵的完备问题进行研究,给出它的完备定理以及具体的算法,根据此算法可以很容易的得到三对角线部分逆M矩阵的完备式。
3.A known result on the Deskins completion is extended by using“θ-pairs”and a key error in the proof of the known result is corrected in passing.以θ-子群偶为工具推广了关于Deskins完备的一个已知结果,顺便指出该已知结果论证中的一个关键性错误。
5)completeness[英][k?m'pli:tnis][美][k?m'plitn?s]完备
6)complete[英][k?m'pli:t][美][k?m'plit]完备
1.Compactness and Completeness of Fuzzy Normed Linear Space;模糊赋范线性空间的紧性与完备性
2.Complete Algorithm of Quick Heuristic Attribute Reduction Based on Indiscernibility Degree基于不可区分度的启发式快速完备约简算法
3.In order to probe into the properties of frequency spectrum for a group of parametric curves, a class of orthogonal complete piecewise k-degree polynomials in L 2[0,1],called U-system, is introduced.为了探索参数曲线图组的频谱性质,引进一类属于L2[0,1]的正交完备分片k次多项式系统(简称U系统)。
延伸阅读

哥德尔不完备性定理哥德尔不完备性定理Gdel'sincompletenesstheorem数学家K.哥德尔于1931年证明的两个定理。第一不完备性定理:任意一个包含算术系统在内的形式系统中,都存在一个命题,它在这个系统中既不能被证明也不能被否定。第二不完备性定理:任意一个包含算术系统的形式系统自身不能证明它本身的无矛盾性。哥德尔的不完备性定理使希尔伯特证明数论系统无矛盾性的方案归于失败。但哥德尔的证明中所用到的方法却开创了递归论的研究。哥德尔不完备性定理中所指出的不可判定的命题是理论的而不是自然的命题。1977年,J.帕里斯给出了一个自然的命题,这个命题在数论中是不可判定的。这又引起人们寻找这类问题的兴趣。