Complete Boolean algebra
http://dbpedia.org/resource/Complete_Boolean_algebra
순서론에서 완비 불 대수(完備Boole代數, 영어: complete Boolean algebra)는 완비 격자인 불 대수이다.
rdf:langString
在数学中，完全布尔代数是所有子集都有上确界的布尔代数。完全布尔代数在力迫理论中有重要作用。任何布尔代数A都有一A是其子代数的最小的完全布尔代数。作为偏序集合，这种 A 的补全叫做。
rdf:langString
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. Every Boolean algebra A has an essentially unique completion, which is a complete Boolean algebra containing A such that every element is the supremum of some subset of A. As a partially ordered set, this completion of A is the Dedekind–MacNeille completion.
rdf:langString
rdf:langString
Complete Boolean algebra
rdf:langString
완비 불 대수
rdf:langString
完全布尔代数
xsd:integer
1839944
xsd:integer
1109979689
rdf:langString
D.A.
rdf:langString
b/b016920
rdf:langString
Vladimirov
rdf:langString
Boolean algebra
rdf:langString
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. Every Boolean algebra A has an essentially unique completion, which is a complete Boolean algebra containing A such that every element is the supremum of some subset of A. As a partially ordered set, this completion of A is the Dedekind–MacNeille completion. More generally, if κ is a cardinal then a Boolean algebra is called κ-complete if every subset of cardinality less than κ has a supremum.
rdf:langString
순서론에서 완비 불 대수(完備Boole代數, 영어: complete Boolean algebra)는 완비 격자인 불 대수이다.
rdf:langString
在数学中，完全布尔代数是所有子集都有上确界的布尔代数。完全布尔代数在力迫理论中有重要作用。任何布尔代数A都有一A是其子代数的最小的完全布尔代数。作为偏序集合，这种 A 的补全叫做。
xsd:nonNegativeInteger
9553