countably
英 [ˈkaʊntəbli]
美 [ˈkaʊntəbəli]
adv. 可数地
双语例句
- Discusses the computational problem about union of countable infinite of countably infinite sets.
讨论了可数无穷个可数无穷集合的并的计算问题。 - Countably order complete vector lattice
可数有序完备向量格 - Countably metacompactness are characterized in terms of semi open cover, point wise W refinement, monotonically increasing cover and cushioned refinement.
利用半开复盖、定向开复盖、单调递增开复盖、点态W加细和垫状加细等刻画了可数亚紧性。 - Addition and Multiplication Operation Rules of Countably Fuzzy Cardinal Number
可数Fuzzy基数的加法与乘法运算法则 - Deduces the operational formula of the function between the third power Cartesian product of the natural number set N& N × N × N and N, and further researches into complex computation of countably infinite sets.
文中推导出了自然数集合N的三次笛卡尔积运算&N×N×N与自然数集合N之间的双射函数运算公式，对可数无穷集合的复杂计算作了进一步研究。 - Hilbert Nullstellensatz of Countably Generated Algebras
可数生成代数上的Hilbert零点定理 - We prove that: ( PMEA) Every Countably mcso ( mcta-) compact Space with weak character
本文证明：（PMEA）可数中紧（亚紧）、弱特征弱特征 - On Self-adjoint Extensions of Symmetric Differential Operators With Countably Infinite Deficiency Indices
亏指数为可数无穷的对称微分算子的自伴扩张 - The ∑-products of generalized countably compact spaces
广义序列紧空间的∑－积 - Continuous Convex Games with Countably Many Players
具有可数个局中人的连续凸对策 - Fixed-sets of Correspondences on Countably Compact Spaces
关于可数紧空间上对应的不变集 - Research on visual presentation of complex mapping family with countably infinite critical points using computer
可数无穷多极值点复映射族计算机图形化研究 - Properties of Countably Fuzzy Compact Sets
可数Fuzzy紧集的性质 - And the proofs are shown under two different cases of finite varieties and countably infinite ones.
并分有限簇和可数无限簇两种情况给以证明。 - For example, as a special kind of countably infinite mixture, Ferguson ( 1983) pointed out the identifiability of Dirichlet process mixture model was yet unsolved and ambiguous.
例如，Ferguson（1983）指出Dirichlet过程先验的混合模型，作为一个可数无穷混合的特例，其可识别性尚未解决。 - We also try to generate some conveniently-applied sufficient conditions for identifiability of countably infinite mixtures.
另外，对可数无穷混合的可识别性问题，我们试图提出某些更加方便验证的充分条件。