Question

In: Advanced Math

Construct the truth-table for the following propositional formulas. In each case, explain whether the formula is...

Construct the truth-table for the following propositional formulas. In each case, explain whether the formula is a tautology, a contradiction, or neither. (Explain how you arrive at this conclusion.) (a) ¬((p → ¬p) → ¬p) (b) (p → (q ∧ r)) → (¬r → ¬p) (c) (p → ¬q) → ¬(¬p → q)

Solutions

Expert Solution

If the truth table gives only TRUE values then the proposition is called Tautology

If the truth table gives only FALSE values then the proposition is called Contradiction

If the truth table gives neither tautology nor contradiction then it is called as contingency

  1. ¬((p → ¬p) → ¬p)

P

Q

¬p

¬q

p → ¬p

(p → ¬p) → ¬p

¬((p → ¬p) → ¬p)

T

T

F

F

F

T

F

T

F

F

T

F

T

F

F

T

T

F

T

T

F

F

F

T

T

T

T

F

So this was a contradiction

  1. (p → (q ∧ r)) → (¬r → ¬p)

P

Q

R

¬p

¬r

(q ∧ r)

(p → (q ∧ r))

(¬r → ¬p)

(p → (q ∧ r)) → (¬r → ¬p)

T

T

T

F

F

T

T

T

T

T

T

F

F

T

T

T

F

F

T

F

T

F

F

T

T

T

T

T

F

F

F

T

F

F

F

T

F

T

T

T

F

T

T

T

T

F

T

F

T

T

T

T

T

T

F

F

T

T

F

T

T

T

T

F

F

F

T

T

F

T

T

T

So this was a contingency

  1. (p → ¬q) → ¬(¬p → q)

P

Q

¬p

¬q

p → ¬q

¬p → q

¬(¬p → q)

(p → ¬q) → ¬(¬p → q)

T

T

F

F

F

T

F

T

T

F

F

T

T

T

F

F

F

T

T

F

T

F

T

T

F

F

T

T

T

F

T

T

So this was a contingency


Related Solutions

1. For each of the following propositions construct a truth table and indicate whether it is...
1. For each of the following propositions construct a truth table and indicate whether it is a tautology (i.e., it’s always true), a contradiction (it’s never true), or a contingency (its truth depends on the truth of the variables). Also specify whether it is a logical equivalence or not. Note: There should be a column for every operator. There should be three columns to show work for a biconditional. a) (P Λ ¬Q) ⇔ ¬(P ⇒ Q) b) (¬? V¬?)...
Q2) (a) construct a truth table for the following function: ?(?, ?, ?) = (?? +...
Q2) (a) construct a truth table for the following function: ?(?, ?, ?) = (?? + ?̅?) ̅̅̅ + ?? (b) Use the truth table of (a) to write the function F in sum of minterms form. (c) Expand the function ?(?, ?, ?) = ? + ?̅? to product of Maxterms form. (d) Simplify the following function using K-Map. ?(?, , ?, ?, ?) = ?̅? + ?? + ?̅? + ??̅?
Construct a truth table for the statement [q∨(~r∧p)]→~p. Complete the truth table below by filling in...
Construct a truth table for the statement [q∨(~r∧p)]→~p. Complete the truth table below by filling in the blanks. (T or F) p q r ~r ~r∧p q∨(~r∧p) ~p [q∨(~r∧p)]→~p T T T T T F T F T T F F
1)  Recall, a truth table for a proposition involving propositional symbols p and q uses four rows...
1)  Recall, a truth table for a proposition involving propositional symbols p and q uses four rows for the cases p true, q true, p true, q false, p false, q true and p false, q false (in that order). For example  the outcome for p v ¬q  is  T, T, F, T  since the expression is only false when q is true but p is false. Of course, we have the same outcome for any logically equivalent proposition including ¬(¬p ∧ q), (¬p ∧...
Consider the following propositional formula: (((A ^ B) -> C) ^ ((A ^ C) -> D))...
Consider the following propositional formula: (((A ^ B) -> C) ^ ((A ^ C) -> D)) -> ((A ^ B) -> D) Perform the following tasks for this formula: Convert this formula into CNF form and write a numbered list of all clauses obtained from this formula.
Neurons: Please construct a Neural Network for the following logic, NAND Truth table for NAND function...
Neurons: Please construct a Neural Network for the following logic, NAND Truth table for NAND function i1 i2 output 0 0 1 0 1 1 1 0 1 1 1 0
Write a C++ program to construct the truth table of P ∨¬(Q ∧ R) If you...
Write a C++ program to construct the truth table of P ∨¬(Q ∧ R) If you could include comments to explain the code that would be much appreciated!!! :) Thank you so much!
this is Discrete mathematics problem. Translate the following English sentences into propositional formulas. Remember to def...
this is Discrete mathematics problem. Translate the following English sentences into propositional formulas. Remember to def ne your atomic propositions! (a) Either the suspect wore gloves, or he didn't touch the doorknob. (b) I will eat my tie if the Cubs win the World Series. (c) It smelled funny, but he ate it anyway. (d) The people will give up their arms only when the tyrant resigns and we get our money back. (e) All prizes will be awarded provided...
Complete the following table by calculating the missing entries. In each case indicate whether the solution...
Complete the following table by calculating the missing entries. In each case indicate whether the solution is acidic or basic. pHpH pOHpOH [H+][H+] [OH−][OH−] Acidic or basic? 5.30 2.16 4.7×10−10 MM 8.3×10−2 MM I need help on each row of these.
Propositional Logic Is the following formula in Conjunctive Normal Form? Why? Why not? (¬A) n (A...
Propositional Logic Is the following formula in Conjunctive Normal Form? Why? Why not? (¬A) n (A u B) n ¬(A u B) where A and B are propositional variables.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT