英文字典中文字典


英文字典中文字典51ZiDian.com



中文字典辞典   英文字典 a   b   c   d   e   f   g   h   i   j   k   l   m   n   o   p   q   r   s   t   u   v   w   x   y   z       







请输入英文单字,中文词皆可:

sterna    
sternum的复数形

sternum的复数形

Sterna
n 1: a genus of Sterninae [synonym: {Sterna}, {genus Sterna}]


请选择你想看的字典辞典:
单词字典翻译
Sterna查看 Sterna 在百度字典中的解释百度英翻中〔查看〕
Sterna查看 Sterna 在Google字典中的解释Google英翻中〔查看〕
Sterna查看 Sterna 在Yahoo字典中的解释Yahoo英翻中〔查看〕





安装中文字典英文字典查询工具!


中文字典英文字典工具:
选择颜色:
输入中英文单字

































































英文字典中文字典相关资料:


  • Complete Boolean algebra - Wikipedia
    In mathematics, a complete Boolean algebra is a Boolean algebra in which every subset has a supremum (least upper bound) Complete Boolean algebras are used to construct Boolean-valued models of set theory in the theory of forcing
  • Boolean algebra - Encyclopedia of Mathematics
    A Boolean algebra $ X $ is called complete if any set $ E \subset X $ has an upper bound $ \sup E $ and a lower bound $ \inf E $ This is equivalent to $ \mathfrak O (X) $ being extremal (cf Extremally-disconnected space )
  • complete Boolean algebra - PlanetMath. org
    If κ = ℵ 0, the first aleph number, then it is called a countably complete Boolean algebra Any complete Boolean algebra is κ -complete, and any κ -complete is λ -complete for any λ ≤ κ
  • complete Boolean algebra in nLab - ncatlab. org
    A complete Boolean algebra is a complete lattice that is also a Boolean algebra Since lattice homomorphisms of Boolean algebras automatically preserves the Boolean structure, the complete Boolean algebras form a full subcategory CompBoolAlg of CompLat
  • Preservation of completeness under isomorphisms between Boolean . . .
    A Boolean algebra $\mathcal{B}:=(B,\leq,\lor,\land,^c,0,1)$ is said to be complete if every non-empty subset of $B$ has a greatest lower bound (g l b) Prove that a Boolean algebra that is isomorphic to a complete Boolean algebra is complete
  • COMPLETE BOOLEAN ALGEBRAS - Springer
    For a Boolean algebra : to be complete (O'-complete), it is necessary and sufficient that each subset (respectively, each countable subset) of : possess an infimum To prove, observe that the element u == CinfCE is the supremum of E for all E c :
  • Boolean Algebra - Department of Computer Science
    Boolean Algebra Philipp Koehn 30 August 2019 Philipp Koehn Computer Systems Fundamentals: Boolean Algebra 30 August 2019 Core Boolean Operators 1 AND ORNOT ^_ : A B A and B CNF: Complete Operation 19 A B C OUT Expression 0 0 0 0 not ((not A) and (not B) and (not C)) 0 1 0 1 1 0 0 0 not (A and (not B) and (not C)) 1 1 0 0 not (A and B and





中文字典-英文字典  2005-2009