🔗1. 🔗Use truth tables to determine whether or not the following pairs of statements are logically equivalent. 🔗 🔗“(∼P)∨Q” and “P⇒Q”. 🔗“P⇔Q” and “(∼P)⇔(∼Q)”. 🔗“P⇒(Q∨R)” and “P⇒((∼Q)⇒R)”. 🔗“(P∨Q)⇒R” and “(P⇒R)∧(Q⇒R)”. 🔗“P⇒(Q∨R)” and “(Q∧R)⇒P”.
🔗2. 🔗Use the logical equivalences given in Theorem 4.2.3 and Theorem 4.2.7 to negate the following sentences. 🔗 🔗 8 is even and 5 is prime. 🔗If n is a multiple of 4 and ,6, then it is a multiple of .24. 🔗If n is not a multiple of ,10, then it is a multiple of 2 but is not a multiple of .5. 🔗.3≤x≤6. 🔗A real number x is less than −2 or greater than 2 if its square is greater than .4. 🔗If a function f is differentiable everywhere then whenever x∈R is a local maximum of f we have .f′(x)=0.
🔗3. 🔗Show that the following pairs of statements are logically equivalent using Theorem 4.2.3. 🔗 🔗 P⟺Q and (∼P)⟺(∼Q) 🔗 P⟹(Q∨R) and P⟹((∼Q)⟹R) 🔗 (P∨Q)⟹R and (P⟹R)∧(Q⟹R)