Question

UIC 5. (20 pt.) Use the laws of propositional logic to prove that the following compound propositions are tautologies. a. (5 pt.) (p^ q) → (q V r) b. (5 pt) P)Ag)- Vg)A(A-r)- c. (10 pt.) Additional Topics: Satisfiability (10 pt.) A compound proposition is said to be satisfiable if there is an assignment of truth values to its variables that makes it true. For example. p ^ q is true when p = T and q = T;thus, pAqissatsfiable. When no such assignment exists, the compound proposition is said to be unsatisfiable. For example, p ^-p is always false: thus, p ^-p is unsatisfiable. To show that a compound proposition is satisfiable, we need to find at least one assignment of truth values to its variables that makes it true. However, to show that a compound proposition is unsatisfiable, we need to show that every assignment of truth values to its variables makes it false 6. (10 pt., 2.5 pt. each) Determine whether each of the following compound propositions is satisfiable. Justify your answer.
0 0
Add a comment Improve this question Transcribed image text
Answer #1

Swite he ro Swicheroo lauTF F2-fw) mp 6,pvg) ny, (PVN4) ①n®n@ TF T r

Add a comment
Answer #2
Determine whether each of these compound propositions is satisfiable of unsatisfiable
answered by: Tala
Add a comment
Know the answer?
Add Answer to:
UIC 5. (20 pt.) Use the laws of propositional logic to prove that the following compound...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • 10 points (bonus) A propositional formula on n variables, P(ri,2,... ,Tn) is satisfiable if there exists...

    10 points (bonus) A propositional formula on n variables, P(ri,2,... ,Tn) is satisfiable if there exists an assignment of truth values (true or false) to its variables such that it evaluates to true. (a) Give an algorithm (pseudocode) that, given a formula P determines if it is satisfiable or not. Analyze your algorithm. b) Suppose that we are given a free" algorithm A that, given P and a partial assignment of truth values (that is, some variables are set to...

  • Problem 1.3. (a) Verify by truth table that ( P Q ) V(QP) (1.2) is valid...

    Problem 1.3. (a) Verify by truth table that ( P Q ) V(QP) (1.2) is valid (b) A propositional statement is satisfiable if and only if there is an assignment of truth values to its variables which make the statement true. Explain why PE-P (1.3) is not satisfiable. (c) A set of propositional formulas P, ..., Pk is consistent if and only if there is an environment in which they are all true. Write a formula, S, so that the...

  • true and false propositions with quantifiers. Answer the following questions in the space provided below. 1....

    true and false propositions with quantifiers. Answer the following questions in the space provided below. 1. For each proposition below, first determine its truth value, then negate the proposition and simplify (using De Morgan's laws) to eliminate all – symbols. All variables are from the domain of integers. (a) 3.0, x2 <. (b) Vr, ((x2 = 0) + (0 = 0)). (c) 3. Vy (2 > 0) (y >0 <y)). 2. Consider the predicates defined below. Take the domain to...

  • 14. True or False Aa Aa Use your knowledge of natural deduction in propositional logic and your knowledge of the rules of implication to determine wichof the following statements are true. Place a ch...

    14. True or False Aa Aa Use your knowledge of natural deduction in propositional logic and your knowledge of the rules of implication to determine wichof the following statements are true. Place a check mark in the box beside each true statement. You cannot apply any rules of implication to parts of whole lines The addition (Add) rule always yields a disjunction as its conclusion. Addition (Add) allows you to connect together with a dot the propositions on any previous...

  • Check is 2-CNF satisfiable? Return one of its satisfying assignments.

    The input is a Boolean formula in 2-CNF, given as a string of symbols.Example: p /\ (p -> q) /\ (p -> ~r) /\ (~r \/ ~s) /\ (s \/ ~q)1) check whether the given 2-CNF is satisfiable.2) given a 2-CNF, report that it is not satisfiable or return one of its satisfying assignments.Solution in Python3For the first task, you should implement a function called is_satisfiable, which takes the string with the 2-CNF as an argument and returns either True (satisfiable) or False (not satisfiable). The second task...

  • Logic Quiz 5 Show these two compound propositions to be true or false 1. Rome is the capital of I...

    Logic Quiz 5 Show these two compound propositions to be true or false 1. Rome is the capital of Italy or Paris is the capital of England 2. If London is not the capital of Italy then Stockholm is the capital of Italy 3. 4. Given that A, B, C, are true statements and X, Y, Z are false, show that the following two statements (a and b) are true or false (Xv Y)AXvZ) a) b) I(B C)v (CAB) Prove...

  • Answer the following questions in the space provided below. 1. For each proposition below, first determine...

    Answer the following questions in the space provided below. 1. For each proposition below, first determine its truth value, then negate the proposition and simplify (using DeMorgan's laws) to eliminate all – symbols. All variables are from the domain of integers. (a) 3x, 22 <2. (b) Vx, ((:22 = 0) + (x = 0)). (e) 3xWy((x > 0) (y > 0 + x Sy)). 2. Consider the predicates defined below. Take the domain to be the positive integers. P(x): x...

  • Exercise 23. I have the answer and it makes sense to me but I don't understand...

    Exercise 23. I have the answer and it makes sense to me but I don't understand what the contradiction is here. ,so Pis false. Thus values for P and Q that makes B false. Therefore B is not a R). We have seen in Example 2.24 Then tautology Exercise 21. Let A be the sentence [(P Q) n(Q → R)] (P that A is a tautology. Let B be the converse of A. Write out what B is in terms...

  • 1. Evaluate the following expressions if p = 8, 9 = 3, and the value of...

    1. Evaluate the following expressions if p = 8, 9 = 3, and the value of the variable found is False. Show your work. . q <= p . not (p == 4-5) . q != p % 5 . found or p > 5 and q == p + 5 2. Are you able to draw the truth tables for AND, OR, and NOT logical expressions? - Translate the following problem descriptions into Python. 3. If score is greater...

  • butirnu (20%) ) for each of the following 10 statements (2 marks each). of the Circle T (true) or F (false) xand y...

    butirnu (20%) ) for each of the following 10 statements (2 marks each). of the Circle T (true) or F (false) xand y be two normal variables with mean values of μ. and μ. and standard deviationsoro, and ob respectively. The standard deviatice of y.yisơ (I)T F Let x be a normal variable with a mean of"nd standard deviation ofơ. The standard deviation of y-xls (2) TF 3 T F Ina Bemoulli sequence, the probability of a success event is...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT