查询词典 countability

The author uses I-fuzzy quasi-coincident neighborhood system to introduce the concepts of I-fuzzy first countability and I-fuzzy second countability, and proves the degree to second countability in each of I-fuzzy topological space must be less than that to first countability, and gives the equivalent characterations about the continuity of function by convergence of sequences in first countable I-fuzzy topological spaces.

作者利用方进明在[4]中提出的I-fuzzy重域系引入了I-fuzzy拓扑空间的第一可数性和第二可数性的概念，证明了一个I-fuzzy拓扑空间空间是第二可数的I-fuzzy拓扑空间的程度一定小于它是第一可数的I-fuzzy拓扑空间的程度，并且在第一可数的I-fuzzy拓扑空间中对映射的连续性进行了等价刻画。

The third section is the research about I-fuzzy first countability and I-fuzzy second countability in I-fuzzy topological spaces.

第三部分是关于I-fuzzy拓扑空间中I-fuzzy第一可数性和I-fuzzy第二可数性的研究。

15 Visibility and countability in Creative Industry, Wen Wei Po.

看得到，数得到的创意工业，文汇报。

The aim of this paper is to study the countability on I-fuzzy topological spaces.

本文主要是研究I-fuzzy拓扑空间中的可数性，提出I-fuzzy第一可数性、I-fuzzy第二可数性、I-fuzzy可分性、I-fuzzy Lindelf性等几种可数性的概念，界定了它们的特征性质，给出了它们之间的关系，还在第一可数I-fuzzy拓扑空间中用多值序列收敛对映射连续性进行刻画，更为重要的是得到了I-fuzzy拓扑空间中的I-fuzzy Lindelf定理。

The fifth section is the reseach about countable productive property of I-fuzzy first countability in I-fuzzy topological space.

第五部分是关于I-fuzzy拓扑空间中I-fuzzy第一可数性的可乘性的研究。

The author proves the infimum of the degree to I-fuzzy first countability in each of I-fuzzy topilogical spaces is less than that in their productive space.

作者证明了可数个I-fuzzy拓扑空间I-fuzzy第一可数的程度的下确界一定小于它们的积空间的I-fuzzy第一可数的程度。

There are the seeming paradoxes of countability and uncountability

粗略地讲，悖论可分为可数性悖论和不可数性悖论。

The author introduces background about generation of countability in topology and status about the research and the development of count-ability on lattice-valued topological spaces, and gives the main problems to be soled.

文章由六部分组成：第一部分是前言，作者简单介绍了拓扑空间中可数性的产生背景，格值拓扑空间可数性的研究发展情况，给出本文主要的研究问题。

A number of properties of countable topological space were given systematically, such as its countability, separability, compactness and connectedness, including their proofs on the basis of the nature of topological space, real number space and corresponding theorems.

摘要在可数补拓扑空间的拓扑性质的研究基础上，系统的给出了可数补拓扑空间的可数性，分离性，紧致性，连通性等性质，并给予证明。

The disquisition brings forward three principle in combination arithmetic designing and combination arithmetic choice. There is currency, countability and less information redundancy. And the disquisition analyses the relation of them.

本文提出了在组合算法设计和组合算法选择方面所应当遵循的三个原则，即通用性、可计算性和较少的信息冗余量，并初步分析了它们之间的相互关系。

The dissecting of samples in group2 were difficult. The root of pulmonary artery and ascending aorta failed to be unfolded because fibrous tissue was tough, right and left fibrous trigone were too firm to be solved by hand. Cardiac muscle fibers couldn't be stripped along myofibrillar trajectory since they were prone to break because of their friability.

组2的心脏解剖困难，表现为纤维组织坚韧，游离肺动脉非常困难；徒手无法松解左、右纤维三角，肺动脉和主动脉根部的游离非常困难；心肌纤维坚硬、质脆，解剖时容易断离成碎块，无法沿纤维走行方向剥离。

We have battled against the odds in a province that has become increasingly violent.

我们对在一个争夺日益激烈省的可能性。