Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Inclusion_(Boolean_algebra)> ?p ?o. }
Showing items 1 to 11 of
11
with 100 items per page.
- Inclusion_(Boolean_algebra) abstract "In Boolean algebra (structure), the inclusion relation is defined as and is the Boolean analogue to the subset relation in set theory. Inclusion is a partial order.The inclusion relation can be expressed in many ways: The inclusion relation has a natural interpretation in various Boolean algebras: in the subset algebra, the subset relation; in arithmetic Boolean algebra, divisibility; in the algebra of propositions, material implication; in the two-element algebra, the set { (0,0), (0,1), (1,1) }.Some useful properties of the inclusion relation are: The inclusion relation may be used to define Boolean intervals such that A Boolean algebra whose carrier set is restricted to the elements in an interval is itself a Boolean algebra.".
- Inclusion_(Boolean_algebra) wikiPageID "40153832".
- Inclusion_(Boolean_algebra) wikiPageRevisionID "567164022".
- Inclusion_(Boolean_algebra) subject Category:Boolean_algebra.
- Inclusion_(Boolean_algebra) comment "In Boolean algebra (structure), the inclusion relation is defined as and is the Boolean analogue to the subset relation in set theory.".
- Inclusion_(Boolean_algebra) label "Inclusion (Boolean algebra)".
- Inclusion_(Boolean_algebra) sameAs m.0wy38pr.
- Inclusion_(Boolean_algebra) sameAs Q16989976.
- Inclusion_(Boolean_algebra) sameAs Q16989976.
- Inclusion_(Boolean_algebra) wasDerivedFrom Inclusion_(Boolean_algebra)?oldid=567164022.
- Inclusion_(Boolean_algebra) isPrimaryTopicOf Inclusion_(Boolean_algebra).