2.6 Propositional Equivalence
Computational Thinking & Algorithms
Propositional equivalence is a concept in propositional logic. It explains when two logical expressions have the same meaning. Even if expressions look different, they may give the same result. Propositional equivalence is checked using truth tables. If two expressions have the same truth values in all cases, they are equivalent. The symbol “≡” is used to show equivalence. Propositional equivalence improves clarity in reasoning (as shown in Figure 2.6).
Describe this diagram
Venn key: A AND NOT B (hatched beige); B AND NOT A (hatched blue); Neither A nor B (white); A AND B (not included) (hatched beige). Truth table rows (A, B, Expression 1, Expression 2): F F F F; F T T T; T F T T; T T F F. Therefore line: (A AND NOT B) OR (B AND NOT A), a double arrow, (A OR B) AND (NOT A OR NOT B).