Inclusion (Boolean algebra)
id:
inclusion-boolean-algebra-279-7192275
title:
Inclusion (Boolean algebra)
text:
In Boolean algebra, the inclusion relation a ≤ b is defined as a b ′ = 0 and is the Boolean analogue to the subset relation in set theory. Inclusion is a partial order. The inclusion relation a < b can be expressed in many ways: a < b a b ′ = 0 a ′ + b = 1 b ′ < a ′ a + b = b a b = a 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 impl
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Inclusion_(Boolean_algebra)
date created:
date modified:
2022-07-05T20:42:45Z
main entity:
{"identifier":"Q16989976","url":"https://www.wikidata.org/entity/Q16989976"}
image:
fields total:
13
integrity:
13