封閉集英文

• 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
  函數系的完備性判定問題是多值邏輯理論中基本而重要的問題，同時也是自動機理論，多值邏輯網絡中必須解決的問題，此問題的解決依賴于定出多值邏輯函數集中的所有極大封閉集(準完備集) 。