封闭集的英文

• closed set

• "封闭"英文翻译    seal off; seal
• "集"英文翻译    gather; assemble; collect
• "封闭集团" 英文翻译 :    closed bloc
• "闭集" 英文翻译 :    [数学] closed set; topologically closed set
• "闭集合" 英文翻译 :    closed set
• "积闭集" 英文翻译 :    multiplicatively closed set
• "紧闭集" 英文翻译 :    compact closed set
• "弱闭集" 英文翻译 :    weakly closed set
• "封闭" 英文翻译 :    1.(密闭;关住使不能通行) seal off; seal (up) 用蜡封闭瓶口 seal a bottle with wax;被严密封闭be kept tightly sealed; 封闭机场 close an airport; 封闭的市场 self-enclosed market2.(查封) close (down) 一家出版社被封闭了。 one publishing house was closed down
• "非空闭集" 英文翻译 :    nonempty closed set
• "局部闭集" 英文翻译 :    locally closed set
• "绝对凸闭集" 英文翻译 :    absolutely convex closed set
• "模糊闭集" 英文翻译 :    fuzzy closed set
• "上闭集合" 英文翻译 :    upper set
• "下闭集合" 英文翻译 :    upper set
• "相对闭集" 英文翻译 :    relative closed set; relatively closed set; relatively-closed set
• "有界闭集" 英文翻译 :    bounded closed set
• "正则闭集" 英文翻译 :    regular closed set
• "密闭集输流程" 英文翻译 :    closed layout of gathering system
• "非相容素闭集合" 英文翻译 :    irredundant prime closed set
• "连续统一体闭集" 英文翻译 :    continuum
• "完全不连通闭集" 英文翻译 :    totally disconnected closed set
• "堵塞,封闭" 英文翻译 :    occlude
• "对……封闭" 英文翻译 :    turn one’s back on
• "封闭 ，堵塞" 英文翻译 :    stemming

• Some results on decision for minimal covering of regular separable function sets in partial k - valued logic
  值逻辑中正则可离函数集的极大封闭集之最小覆盖判定的一些结果
• The main work of this thesis is decision on minimal covering of precomplete classes in partial multiple - valued logic
  本文研究的是部分多值逻辑中极大封闭集之最小覆盖的判定问题。
• Another important problem in multiple - valued logic completeness theory is decision for sheffer functions , which reduced to determining the minimal covering of precomplete classes in multiple - valued logic
  多值逻辑完备性理论中的另一重要问题是sheffer函数的判定问题，此问题可归结为定出所有极大封闭集(准完备集)的最小覆盖。
• In chapter 3 , we attempt to study the function sets when m = 3 , and obtain the conclusion that one kind of full symmetric function sets must be the component part of the minimal covering of precomplete classes
  第三章对保三元关系函数集的判定作了初步尝试，并得出一类三元完满对称函数集在p _ k ~ *极大封闭集之最小覆盖中必须出现的结论。
• In multiple - valued logic theory , completeness theory of function sets is an important and fundamental problem , it is also the problem which must be solved in automata theory and multiple - valued logic network . the solution of this problem depends on determining all the precomplete classes in multiple - valued logic function sets
  函数系的完备性判定问题是多值逻辑理论中基本而重要的问题，同时也是自动机理论，多值逻辑网络中必须解决的问题，此问题的解决依赖于定出多值逻辑函数集中的所有极大封闭集(准完备集) 。