2. 3. Prove that each of the following wffs is a tautology with the truth table....

Transcribed Image Text:

2. 3. Prove that each of the following wffs is a tautology with the truth table. ((ay)^(31)) (a ((avB) ⇒ 7) (BV)) V (a⇒ y) a ⇒ (3⇒ a) a. b. BV 2 C. d. c. f. g. h. j. Tk) (a⇒ (B⇒y)) ((a⇒3) ⇒ (a⇒ y)) (~B~a) ⇒ ((~3⇒a) ⇒ 3) 3) v (3a) 3) ((a^y) ⇒ (BAY)) m. n. 0. P. (a (a (a (a^ß⇒y) ⇒ (a^~y⇒~ B) (a⇒ (8⇒ (8⇒ a))) a ⇒ (33) (a (3)) ↔ (α⇒ (~B~ y)) ((a^3)^(ay)) ⇒ (y^B) ((av 3) ^ (ay)) ⇒ (VB) (a⇒ (8⇒y)) ⇒ (8⇒ (a⇒7)) (a⇒ (8^y)) ((a⇒B) ^ (ay)) Prove that each of the wffs in Question 2 is a theorem with a formal proof, (BA~B)) ⇒~a 2. 3. Prove that each of the following wffs is a tautology with the truth table. ((ay)^(31)) (a ((avB) ⇒ 7) (BV)) V (a⇒ y) a ⇒ (3⇒ a) a. b. BV 2 C. d. c. f. g. h. j. Tk) (a⇒ (B⇒y)) ((a⇒3) ⇒ (a⇒ y)) (~B~a) ⇒ ((~3⇒a) ⇒ 3) 3) v (3a) 3) ((a^y) ⇒ (BAY)) m. n. 0. P. (a (a (a (a^ß⇒y) ⇒ (a^~y⇒~ B) (a⇒ (8⇒ (8⇒ a))) a ⇒ (33) (a (3)) ↔ (α⇒ (~B~ y)) ((a^3)^(ay)) ⇒ (y^B) ((av 3) ^ (ay)) ⇒ (VB) (a⇒ (8⇒y)) ⇒ (8⇒ (a⇒7)) (a⇒ (8^y)) ((a⇒B) ^ (ay)) Prove that each of the wffs in Question 2 is a theorem with a formal proof, (BA~B)) ⇒~a

Answer rating: 100% (QA)

To prove that each of the following wffs is a tautology with the truth table a 4 8 g v L 0 ... View the full answer