Khác biệt giữa bản sửa đổi của “Đại số Boole”

Nội dung được xóa Nội dung được thêm vào
Không có tóm lược sửa đổi
n →‎Ví dụ: replaced: → (4) using AWB
Dòng 147:
 
* The set of all subsets of ''S'' that are either finite or [[cofinite]] is a Boolean algebra, an [[algebra of sets]].
* Starting with the [[propositional calculus]] with κ sentence symbols, form the [[Lindenbaum-Tarski algebra|Lindenbaum algebra]] (that is, the set of sentences in the propositional calculus modulo [[tautology (logic)|tautology]]). This construction yields a Boolean algebra. It is in fact the [[free Boolean algebra]] on κ generators. A truth assignment in propositional calculus is then a Boolean algebra homomorphism from this algebra to the two-element Boolean algebra.
* Given any [[linearly ordered]] set ''L'' with a least element, the interval algebra is the smallest algebra of subsets of ''L'' containing all of the half-open intervals [''a'', ''b'') such that ''a'' is in ''L'' and ''b'' is either in ''L'' or equal to ∞. Interval algebras are useful in the study of [[Lindenbaum-Tarski algebra]]s; every countable Boolean algebra is isomorphic to an interval algebra.
 
[[File:Lattice T 30.svg|thumb|x150px|[[Hasse diagram]] of the Boolean algebra of divisors of 30.]]