Please build Truth Tables to show that the following formulas express logical laws (they are always true)

((qp) p) q (show the truth table)

(p q) (pq) (show the truth table)

Let us prove that

(p q) (pq)

is a logical law, i.e. it is always true. (show the truth table)

We will assume (p q) (pq) can be false, and show that this assumption leads to a Contradiction. (show the contradiction table)

show 1=true or 0=false for the foowing table information

Assume (p q) (pq)=0

p q= [

(pq)= [1]

pq= [3]

p = [2]

q= [2]

p= [4]

q= [5]

pq= [6,7]

what is the contradiction (fun fact it always includes the last portion)

Let us prove that

((pq) (rq)) (pr)

Is a logical law, i.e. it is always true.

We will assume that ((pq) (rq)) (pr)(show the truth table)

can be false, and show that our assumption leads to a Contradiction(show the contradiction table)

Suppose our propositional formula has four variables. Please draw a Decision Tree to construct all possible combinations for the truth values for these variables. (please show a decision tree)

Liar paradox sentence cannot be true and cannot be false. That is why it is called a paradox. Prove this fact by Contradiction. Assume that Liar Paradox sentence is true, and show that it leads to the conclusion that it is false. Assume, that it is false, show that this assumption leads to the conclusion that it is true. (please show the liar paradox table alongside the contradiction table)

WARNING: If you use standfords website I am going to report you, and you will be wiped off this website I know the secret website che.gg so don't mess with me. Please write on pieces of paper, and explain your reasoning.