Update README.md

README.md

@@ -44,19 +44,19 @@ Alice is happy.
 Alice is not happy.
 ```
 
-The expected answer for the following example is they are logically equivalent which is 1. Use constraposition law `(A <=> not not A)` to show that following example is true.
+The expected answer for the following example is they are logically equivalent which is 1. Use double negation law `(A <=> not not A)` to show that following example is true.
 ```
 Alice is happy.
 Alice is not sad.
 ```
 
-The expected answer for the following example is they are logically inequivalent which is 0. Use double negation law `(If A then B <=> not A or B)` to show that following example is false. The `or` in `not A or B` refer to the the meaning of `otherwise` in natural language.
+The expected answer for the following example is they are logically inequivalent which is 0. Use implication law `(If A then B <=> not A or B)` to show that following example is false. The `or` in `not A or B` refer to the the meaning of `otherwise` in natural language.
 ```
 If Alan is kind, then Bob is clever.
 Alan is kind or Bob is clever.
 ```
 
-The expected answer for the following example is they are logically equivalent which is 1. Use constraposition law `(If A then B <=> not A or B)` to show that following example is true. The `or` in `not A or B` refer to the the meaning of `otherwise` in natural language.
+The expected answer for the following example is they are logically equivalent which is 1. Use implication law `(If A then B <=> not A or B)` to show that following example is true. The `or` in `not A or B` refer to the the meaning of `otherwise` in natural language.
 ```
 If Alan is kind, then Bob is clever.
 Alan is not kind or Bob is clever.