In algebra, the absorption law or absorption identity is an identity linking a pair of binary operations. Two binary operations, ¤ and ⁂, are said to be connected by the absorption law if: a ¤ (a ⁂ b) = a ⁂ (a ¤ b) = a. A set equipped with two commutative and associative binary operations ("join") and.

What is absorption law logic?

Absorption is a valid argument form and rule of inference of propositional logic. The rule states that if implies , then implies and . The rule makes it possible to introduce conjunctions to proofs. It is called the law of absorption because the term is "absorbed" by the term in the consequent.

What are the two absorption law used in Boolean algebra?

Absorptive Law – This law enables a reduction in a complicated expression to a simpler one by absorbing like terms. Associative Law – This law allows the removal of brackets from an expression and regrouping of the variables.