https://bsccs.stoney-wiki.com/w/index.php?action=history&feed=atom&title=Absorption_lawsAbsorption laws - Revision history2026-05-04T20:07:48ZRevision history for this page on the wikiMediaWiki 1.39.6https://bsccs.stoney-wiki.com/w/index.php?title=Absorption_laws&diff=41&oldid=prevBfh-sts: Created page with "= Absorption laws = The absorption laws show how certain combinations of conjunction and disjunction can be simplified by "absorbing" one proposition into another. == Statements == * p ∨ (p ∧ q) ≡ p * p ∧ (p ∨ q) ≡ p == Explanation == Adding extra conditions that are already implied by ''p'' does not change the truth value. These laws allow expressions to be reduced in complexity. == Examples == * "I study OR (I study AND I rest)" is logically equivalen..."2025-10-20T13:31:21Z<p>Created page with "= Absorption laws = The absorption laws show how certain combinations of conjunction and disjunction can be simplified by "absorbing" one proposition into another. == Statements == * p ∨ (p ∧ q) ≡ p * p ∧ (p ∨ q) ≡ p == Explanation == Adding extra conditions that are already implied by ''p'' does not change the truth value. These laws allow expressions to be reduced in complexity. == Examples == * "I study OR (I study AND I rest)" is logically equivalen..."</p>
<p><b>New page</b></p><div>= Absorption laws =<br />
<br />
The absorption laws show how certain combinations of conjunction and disjunction can be simplified by "absorbing" one proposition into another.<br />
<br />
== Statements ==<br />
* p ∨ (p ∧ q) ≡ p<br />
* p ∧ (p ∨ q) ≡ p<br />
<br />
== Explanation ==<br />
Adding extra conditions that are already implied by ''p'' does not change the truth value. <br />
These laws allow expressions to be reduced in complexity.<br />
<br />
== Examples ==<br />
* "I study OR (I study AND I rest)" is logically equivalent to "I study".<br />
* "I study AND (I study OR I rest)" is logically equivalent to "I study".<br />
<br />
== Truth Table (First Law) ==<br />
{| class="wikitable"<br />
! p !! q !! p ∧ q !! p ∨ (p ∧ q)<br />
|-<br />
| T || T || T || T<br />
|-<br />
| T || F || F || T<br />
|-<br />
| F || T || F || F<br />
|-<br />
| F || F || F || F<br />
|}<br />
<br />
== Truth Table (Second Law) ==<br />
{| class="wikitable"<br />
! p !! q !! p ∨ q !! p ∧ (p ∨ q)<br />
|-<br />
| T || T || T || T<br />
|-<br />
| T || F || T || T<br />
|-<br />
| F || T || T || F<br />
|-<br />
| F || F || F || F<br />
|}<br />
<br />
[[Category:Propositional logic (Aussagenlogik)]]<br />
[[Category: Diskrete Mathematik I (BZG1155pa) 25/26]]</div>Bfh-sts