Question

                                   Is the formula (x∨y)∧(x- ∨ y)∧(x- ∨ y-) satisfiabl

                                  

Is the formula (x∨y)∧(x- ∨ y)∧(x- ∨ y-) satisfiable? Defend your answer:

•If this formula is satisfiable, give a satisfying truth assignment for x and y.

•If this formula is not satisfiable, give a proof that no satisfying assignment exists.

You can either use a truth table, or you can use the laws of Boolean algebra to simplify this expression to one that is obviously either satisfiable or non-satisfiable.

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Satisfiable means: By putting the value of X and Y in terms of the True and False. In any combination of the true and false the formula should give one true value. so let us put the combination of the true and false in X and Y position

Truth table:

True= T and False= F

X- is the complement of the X.

Truth table approach:

X Y (X V Y) (X- V Y) (X- V Y-) Final result

T    T T T F F

T    F T F T F

F    T T T T T

F F   F F F F

So for a combination of X= False And Y= True, the final formula which is AND operation of all the variables gives the True value, so the formula is satisfiable. But for some value, it is giving the false value so it is not a tautology.

Add a comment
Know the answer?
Add Answer to:
                                   Is the formula (x∨y)∧(x- ∨ y)∧(x- ∨ y-) satisfiabl
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...

  • Q2: 1. Proof this Boolean expression. Use Boolean Algebra (X+Y). (Z+W).(X'+Y+W) = Y.Z+X.W+Y.W 2. For this...

    Q2: 1. Proof this Boolean expression. Use Boolean Algebra (X+Y). (Z+W).(X'+Y+W) = Y.Z+X.W+Y.W 2. For this BF F(X,,Z)=((XYZ)(X +Z))(X+Y) • Design the digital circuit Derive the Boolean Function of X, Y, Z. Simplify the Function Derive the truth table before and after simplification. Derive the BF F(X,Y,Z) as Maxterms (POS) and miterms (SOP). Implement the F(X,Y,Z) after simplification using NAND gates only. Implement the F(X,Y,Z) after simplification using OR NOR gates only.

  • a. Find a satisfying assignment for the following boolean formula: (x y z') ( x y'...

    a. Find a satisfying assignment for the following boolean formula: (x y z') ( x y' z) (w' x y') (w' x' z) b. What is the number of satistifying assignments for the boolean formula listed above.

  • 5- The set of formulas can be defined as follows: i. An atomic formula is a formula ii. if "X" and "y&#...

    5- The set of formulas can be defined as follows: i. An atomic formula is a formula ii. if "X" and "y" are formulas, then also "not X", "X and Y", "x or Y", and "X implies Y" are formulas iii. If "X" is a formula and "a" is an identifier, then also "exists a. X" and "Seram a . x" are formulas These properties must hold: The precedence order is as follows (1) not a. (2) and 3) Oniie...

  • Prove with Boolean algebra that (x - y) + (x'-y)-y. Give a reason for each step...

    Prove with Boolean algebra that (x - y) + (x'-y)-y. Give a reason for each step in your proof.

  • 5. Apply Boolean algebra theorems to minimize the following expression. x(y + xy) + xy(x +...

    5. Apply Boolean algebra theorems to minimize the following expression. x(y + xy) + xy(x + yy) 6. Consider the following digital circuit diagram. Write the corresponding logic expression for f and the truth table. D A $(91, 02, ) f(x1, X2, X3)

  • Given the function F(x,y,z) = xyztx,y2+xyz (a) List the truth table for F (b) Draw the...

    Given the function F(x,y,z) = xyztx,y2+xyz (a) List the truth table for F (b) Draw the logic diagram using the original Boolean expression (c) Simplify the expression (using any method you know) (d) Draw the logic diagram for the simplified expression.

  • 2.18 For the Boolean function F = xyz + x'y'z + w xy + wx'y +...

    2.18 For the Boolean function F = xyz + x'y'z + w xy + wx'y + wxy (a) Obtain the truth table of E (b) Draw the logic diagram, using the original Boolean expression. (c) Use Boolean algebra to simplify the function to a minimum number of literals (d) Obtain the truth table of the function from the simplified expression and show that it is the same as the one in part (a). (e) Draw the logic diagram from the...

  • Design a combinational circuit with three inputs, x , y, and z, and three outputs, A,...

    Design a combinational circuit with three inputs, x , y, and z, and three outputs, A, B , and C . When the binary input is 0, 1, 2, or 3, the binary output is one greater than the input. When the binary input is 4, 5, 6, or 7, the binary output is two less than the input. 1) Truth table 2) Logic circuit 3) Boolean function of A using minterms ( use Boolean algebra) 4) Boolean function of...

  • Boolean Logic A. Show the truth table for this expression: X AND (Y XOR X) B....

    Boolean Logic A. Show the truth table for this expression: X AND (Y XOR X) B. Show the truth table for this expression: Y OR (Y AND NOT X) C. Show the truth table for this expression: X NOR (Y NAND X) D. Draw a digital logic circuit for the expression used in 3A. E. Draw a digital logic circuit for the expression used in 3B. F. Draw a digital logic circuit for the expression used in 3C.

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