Bfh-sts: Created page with "= Idempotent laws = The idempotent laws state that combining a proposition with itself using either conjunction or disjunction does not change its truth value. == Statements == * p ∧ p ≡ p * p ∨ p ≡ p == Explanation == A proposition combined with itself is logically equivalent to the proposition alone. == Examples == * "I study AND I study" is logically the same as "I study". * "I study OR I study" is also logically the same as "I study". == Truth Table (Con..."

2025-10-20T13:29:34Z

Created page with "= Idempotent laws = The idempotent laws state that combining a proposition with itself using either conjunction or disjunction does not change its truth value. == Statements == * p ∧ p ≡ p * p ∨ p ≡ p == Explanation == A proposition combined with itself is logically equivalent to the proposition alone. == Examples == * "I study AND I study" is logically the same as "I study". * "I study OR I study" is also logically the same as "I study". == Truth Table (Con..."

New page

= Idempotent laws =

The idempotent laws state that combining a proposition with itself using either conjunction or disjunction does not change its truth value.

== Statements ==
* p ∧ p ≡ p
* p ∨ p ≡ p

== Explanation ==
A proposition combined with itself is logically equivalent to the proposition alone.

== Examples ==
* "I study AND I study" is logically the same as "I study".
* "I study OR I study" is also logically the same as "I study".

== Truth Table (Conjunction) ==
{| class="wikitable"
! p !! p ∧ p
|-
| T || T
|-
| F || F
|}

== Truth Table (Disjunction) ==
{| class="wikitable"
! p !! p ∨ p
|-
| T || T
|-
| F || F
|}

[[Category:Propositional logic (Aussagenlogik)]]
[[Category: Diskrete Mathematik I (BZG1155pa) 25/26]]

Idempotent laws - Revision history