Answer to Question #74437 in Discrete Mathematics for minhas

Question

: Prove without using truth table in three different ways : [ 15 marks ] ￢( p → q ) → ￢q ≡ T Q # 8 : Prove using logical equivalences : [ 15 marks ] (a) 1 → p ≡ p where p is any proposition. (b) p → 0 ≡ ￢p where p is any proposition. (c) ¬ (p ∨ ¬ (p ∧ q)) is a contradiction. Q # 9 : Determine whether the following expression has/have mistake(s).If they do , identify them and correct them.Remember there may be no mistake.If you say there is no mistake then prove it: [ 20 marks ] (a) p → q ≠ q → p (b) ￢( x y ) ( x y ) ∨ ∧ ∨ ≡ F (c) 0 → p ≡ 1 where p is any proposition. (d) p → T = T where p is any proposition.