Question

In: Computer Science

Give a formal proof for the following tautology by using the CP rule. A v B→(¬...

Give a formal proof for the following tautology by using the CP rule.

A v B→(¬ B →(A ^ ¬ B))

Solutions

Expert Solution

Solution for the problem is provided below, please comment if any doubts:

Note: Since the solution contains equations, to avoid format loss, U added the screenshot of the solution, raw data is also included at the end

Raw data:

The procedure to prove the tautology using conditional proof (CP) rules is following the procedure, From P, derive Q, then P→Q, P is the LHS and Q is the RHS.

Here P=> A v B

And Q => (¬ B →(A ^ ¬ B))

So from “A v B” we need to derive “(¬ B →(A ^ ¬ B))” to prove the tautology

  1. A v B                       :Given premise(P)
  2. ¬ B                           : Given premise derived(P)[To get (¬ B →(A ^ ¬ B) True]
  3. A                              :1, 2, Disjunctive Syllogism(DS) rule
  4. A ^ ¬ B                    :2, 3, Conjunction
  5. (¬ B →(A ^ ¬ B))    :2, 4, CP rule

QED                            :1-5 CP rule

Hence prove the tautology, “A v B→(¬ B →(A ^ ¬ B))” using CP rule


Related Solutions

Give a formal proof for the following tautology by using the CP rule. (A →(B →C))...
Give a formal proof for the following tautology by using the CP rule. (A →(B →C)) ^ B →(A →C)
Give a formal proof for the following tautology by using the IP rule. (A →B) ^...
Give a formal proof for the following tautology by using the IP rule. (A →B) ^ (B →C) →(A v B →C)
Complete this formal proof of Ex(P(x)v~P(x)) from the empty set. NOTE: similar to the rule above...
Complete this formal proof of Ex(P(x)v~P(x)) from the empty set. NOTE: similar to the rule above when instantiating quantifiers, if you need a random name, always start at the beginning of the alphabet. That is, use a first; only use b if necessary; etc.
Give a proof for the standard rule of differentiation, the Chain Rule. To do this, use...
Give a proof for the standard rule of differentiation, the Chain Rule. To do this, use the following information: 10.1.3 Suppose that the function f is differentiable at c, Then, if f′(c) > 0 and if c is an accumulation point of the set constructed by intersecting the domain of f with (c,∞), then there is a δ > 0 such that at each point xin the domain of f which lies in (c,c+δ) we have f(x) > f(c). If...
Let’s give a formal proof that RadixSort works and give a bound on its runtime. We...
Let’s give a formal proof that RadixSort works and give a bound on its runtime. We start with correctness: Lemma RadixSort will properly sort any n natural numbers. Prove this statement. You can use any strategy you want, but we recommend using induction on l (the number of digits that each value has).
For each of the following concepts: define it and give an example. a. rule b. rule...
For each of the following concepts: define it and give an example. a. rule b. rule control c. rule-governed behavior d. contingency control e. contingency-governed behavior (contingency-shaped behavior).
Write a formal proof to prove the following conjecture to be true or false. If the...
Write a formal proof to prove the following conjecture to be true or false. If the statement is true, write a formal proof of it. If the statement is false, provide a counterexample and a slightly modified statement that is true and write a formal proof of your new statement. Conjecture: Let w, x, y, and z be single-digit numbers. The 4-digit number wxyz* is divisible by 9 if and only if 9 divides the sum w + x +...
Answer the following questions: (a) Show that the following is a tautology by using truth table...
Answer the following questions: (a) Show that the following is a tautology by using truth table and using list of equivalences. (This problem should be solved using 2 different methods mentioned above). ((¬p −→ q) ∧ (¬p −→ ¬q)) −→ p (b) Show that the compound propositions are logically equivalent, by using truth table and using list of equivalences. ¬p ∨ (r −→ ¬q) and (¬p ∨ ¬q) ∨ ¬r (c) Show that the propositions ¬p ∨ (¬r ∨ q)...
Is the following argument valid? If so, construct a formal proof (direct or indirect). If not,...
Is the following argument valid? If so, construct a formal proof (direct or indirect). If not, explain why not. If Alex gets a new job, then he will buy a guitar. If Alex wins the lottery, then he will buy a guitar. If Alex goes to Costa Rica, then either Alex got a new job or Alex won the lottery. Alex goes to Costa Rica. Therefore, Alex bought a guitar.
Determine if the following statements are true or false. In either case, provide a formal proof...
Determine if the following statements are true or false. In either case, provide a formal proof using the definitions of the big-O, big-Omega, and big-Theta notations. For instance, to formally prove that f (n) ∈ O(g(n)) or f (n) ∉ O(g(n)), we need to demonstrate the existence of a constant c and a sufficient large n0 such that f (n) ≤ c g(n) for all n ≥ n0, or showing that there are no such values. a) 10000n2 ∈ O(n4)....
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT