please in java or python truth tables for the following...please
#1
p -> q
q -> r
therefor: p -> r
#2
p -> (q or r)
q and ~r
Therefore: p
#3
p or q
(p and q) -> r
q and ~r
Therefor: ~p
Please in java or python truth tables for the following...please #1 p -> q q -> r therefor:...
Python working code
P) Problem 5 A truth table on three variables p, q, r has 23 assignments (ti, t2, t3) where ty, t2, t3 e {T,ㅘ. Show that the following statements are equivalent by constructing the truth tables of each statement and showing that the resulting truth values are the same.
1. Use a truth table in canonical form below to show that ¬p∧q and ¬p∧¬q are not equivalent. Feel free to make necessary adjustments to the table. p q p∧q ¬p ¬q ¬p∧q ¬p∧¬q 2. Tell whether the following two expressions are equivalent by constructing their truth tables in canonical form. You may make necessary adjustments to the table provided below. Is p∨q∧rlogically equivalent to p∨q∧p∨r? p q r q∧r p∨q p∨r 3. Prove or Disprove (make sure to show...
please answer
4. [3 marks] Using truth-table, determine whether p Therefore, they are not. (q ) and p q r) are equivalent.
prove the equivalence without using truth tables P → (Q → S) ≡ (P ∧ Q) → S.
QUESTION 2 a. Let p and q be the statements. i Construct the truth table for (-p V q) ^ q and (-p) v q. What do you notice about the truth tables? Based on this result, a creative student concludes that you can always interchange V and A without changing the truth table. Is the student, right? ii. Construct the truth tables for (-p VG) A p and (-p) v p. What do you think of the rule formulated...
4. Use truth tables to determine whether the following two statements are logically equivalent. (P+Q)^(~Q) and ~ (PVQ)
Prove the following is a tautology (without using a truth table) [(p →q) (q + r)] → (p → r)
3. (Logic) Answer the following questions:
Construct the truth table for (p rightarrow r) (q rightarrow r) doubleheadarrow (p q) rightarrow r Is the following argument valid? (r s) (q s) s rightarrow (p r) rightarrow t) t rightarrow (s r) p rightarrow r
1. Use full-truth table method to check if the following argument is valid -p•(qv-I), (p=q). (qvr)>p 1: p=(-q=r) 2. Use short-cut truth table method to check if the following argument is valid p=(r v (p.-9). [=(qv(re-p)) 1:9= (pv (q.-1))
please complete each section
4. Use truth tables to establish each of the following logical equivalencies deal- ing with biconditional statements: (a) (P Q) (P - Q) A (Q - P) (b) (PQ) (Q + P) (c) (P Q) (~P »-Q)