Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Complete_Boolean_algebra> ?p ?o }
Showing triples 1 to 71 of
71
with 100 triples per page.
- Complete_Boolean_algebra abstract "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.".
- Complete_Boolean_algebra wikiPageID "1839944".
- Complete_Boolean_algebra wikiPageLength "9277".
- Complete_Boolean_algebra wikiPageOutDegree "37".
- Complete_Boolean_algebra wikiPageRevisionID "674713811".
- Complete_Boolean_algebra wikiPageWikiLink Adjoint_functors.
- Complete_Boolean_algebra wikiPageWikiLink Algebra_of_sets.
- Complete_Boolean_algebra wikiPageWikiLink Axiom_of_Choice.
- Complete_Boolean_algebra wikiPageWikiLink Axiom_of_choice.
- Complete_Boolean_algebra wikiPageWikiLink Baire_set.
- Complete_Boolean_algebra wikiPageWikiLink Base_(topology).
- Complete_Boolean_algebra wikiPageWikiLink Boolean-valued_model.
- Complete_Boolean_algebra wikiPageWikiLink Boolean_algebra_(structure).
- Complete_Boolean_algebra wikiPageWikiLink Cantor_algebra.
- Complete_Boolean_algebra wikiPageWikiLink Category:Boolean_algebra.
- Complete_Boolean_algebra wikiPageWikiLink Category:Forcing_(mathematics).
- Complete_Boolean_algebra wikiPageWikiLink Category:Order_theory.
- Complete_Boolean_algebra wikiPageWikiLink Collapsing_algebra.
- Complete_Boolean_algebra wikiPageWikiLink Complete_Heyting_algebra.
- Complete_Boolean_algebra wikiPageWikiLink Complete_lattice.
- Complete_Boolean_algebra wikiPageWikiLink Dedekind–MacNeille_completion.
- Complete_Boolean_algebra wikiPageWikiLink Equivalence_class.
- Complete_Boolean_algebra wikiPageWikiLink Equivalence_relation.
- Complete_Boolean_algebra wikiPageWikiLink Extremally_disconnected.
- Complete_Boolean_algebra wikiPageWikiLink Extremally_disconnected_space.
- Complete_Boolean_algebra wikiPageWikiLink Finite_set.
- Complete_Boolean_algebra wikiPageWikiLink Forcing_(mathematics).
- Complete_Boolean_algebra wikiPageWikiLink Freyds_adjoint_functor_theorem.
- Complete_Boolean_algebra wikiPageWikiLink Generic_extension.
- Complete_Boolean_algebra wikiPageWikiLink Glossary_of_topology.
- Complete_Boolean_algebra wikiPageWikiLink Infimum.
- Complete_Boolean_algebra wikiPageWikiLink Infimum_and_supremum.
- Complete_Boolean_algebra wikiPageWikiLink Infinite_de-Morgans_laws.
- Complete_Boolean_algebra wikiPageWikiLink Mathematics.
- Complete_Boolean_algebra wikiPageWikiLink Meager_set.
- Complete_Boolean_algebra wikiPageWikiLink Meagre_set.
- Complete_Boolean_algebra wikiPageWikiLink Natural_number.
- Complete_Boolean_algebra wikiPageWikiLink Partially_ordered_set.
- Complete_Boolean_algebra wikiPageWikiLink Poset.
- Complete_Boolean_algebra wikiPageWikiLink Random_algebra.
- Complete_Boolean_algebra wikiPageWikiLink Regular_open_set.
- Complete_Boolean_algebra wikiPageWikiLink Stone_space.
- Complete_Boolean_algebra wikiPageWikiLink Stones_representation_theorem_for_Boolean_algebras.
- Complete_Boolean_algebra wikiPageWikiLink Subset.
- Complete_Boolean_algebra wikiPageWikiLink Supremum.
- Complete_Boolean_algebra wikiPageWikiLink Symmetric_difference.
- Complete_Boolean_algebra wikiPageWikiLink Topological_space.
- Complete_Boolean_algebra wikiPageWikiLinkText "Complete Boolean algebra".
- Complete_Boolean_algebra wikiPageWikiLinkText "complete Boolean algebra".
- Complete_Boolean_algebra wikiPageWikiLinkText "complete".
- Complete_Boolean_algebra first "D.A.".
- Complete_Boolean_algebra hasPhotoCollection Complete_Boolean_algebra.
- Complete_Boolean_algebra id "b/b016920".
- Complete_Boolean_algebra last "Vladimirov".
- Complete_Boolean_algebra title "Boolean algebra".
- Complete_Boolean_algebra wikiPageUsesTemplate Template:About.
- Complete_Boolean_algebra wikiPageUsesTemplate Template:Citation.
- Complete_Boolean_algebra wikiPageUsesTemplate Template:Springer.
- Complete_Boolean_algebra subject Category:Boolean_algebra.
- Complete_Boolean_algebra subject Category:Forcing_(mathematics).
- Complete_Boolean_algebra subject Category:Order_theory.
- Complete_Boolean_algebra hypernym Algebra.
- Complete_Boolean_algebra type Field.
- Complete_Boolean_algebra comment "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.".
- Complete_Boolean_algebra label "Complete Boolean algebra".
- Complete_Boolean_algebra sameAs m.0600m_.
- Complete_Boolean_algebra sameAs Q5156447.
- Complete_Boolean_algebra sameAs Q5156447.
- Complete_Boolean_algebra sameAs 完全布尔代数.
- Complete_Boolean_algebra wasDerivedFrom Complete_Boolean_algebra?oldid=674713811.
- Complete_Boolean_algebra isPrimaryTopicOf Complete_Boolean_algebra.