diff options
author | Louie S <lshprung@yahoo.com> | 2020-04-03 10:10:59 -0700 |
---|---|---|
committer | Louie S <lshprung@yahoo.com> | 2020-04-03 10:10:59 -0700 |
commit | f5b740bca69154e8f6435078cad1a7c092243790 (patch) | |
tree | ec7cafda7162e5969744b2c675c07366eab0b3cd /1.3.md | |
parent | 2b577a10662b06039333184044b0d372060976db (diff) |
Post-class 04/03
Diffstat (limited to '1.3.md')
-rw-r--r-- | 1.3.md | 30 |
1 files changed, 30 insertions, 0 deletions
@@ -99,3 +99,33 @@ Truth Table: - with a truth table - by (3) 3. Use table of Common Equivalences (see link above) + +--- + +# Using the Table of Common Equivalences + +- Ex. Show `(p^q)->(p->q)` is a tautology without a truth table + - We are goint to solve this using a proof + - **Goal**: `(p^q)->(p->q)≡T` + +|Proof: (p^q)->(p->q)|Reason| +|--------------------|------| +|≡(p^q)->(┓p∨q) |Implication| +|≡┓(p^q)∨(┓p∨q) |Implication| +|≡(┓p∨┓q)∨(┓p∨q) |De Morgan| +|≡┓p∨(┓q∨(┓p∨q)) |Associative| +|≡┓p∨(┓q∨(q∨┓p)) |Commutative| +|≡┓p∨((┓q∨q)∨┓p)) |Associative| +|≡┓p∨(T∨┓p)) |Negation| +|≡┓p∨T |Domination| +|≡T |Domination| + +- Why use this method? + - This method is useful for compound propositions with many propositions + +- `n` propositions -> truth table has 2^n rows + - e.g 5 propositions -> truth table has 32 rows (!) + +--- + +[1.4 ->](1.4.md) |