4. Complete the following formal proof by completing the inference rule references R₁ to R11-1. {n>0} kn-1 {n>0^k=n-1}2. {n > 0^k=n-1}x= n {n> 0 Ak=n-1^x=n}3. n> 0 Ak=n-1^x=n⇒ p#Where p = 1 ≤k ≤n^x=n! / k!4. {n> 0 ^ k = n −-1} x == n {p}5. {n > 0} kn - 1; x =n {p}6. {p [x *k/x]} x == x * k {p}7. {p [x *k/x] [k - 1/k]} k = k-1 {p [x *k/x]}8. p^k>1⇒p [x*k / x] [k - 1/k]9. {p ^k> 1} k = k-1{p [x*k/x]}10. {p ^k> 1} k = k − 1; x = x * k {p}11. (inv p} W {p ^k ≤ 1}# Where W = while k > 1 do kk - 1; x = x * k od12. {n >0} k = n − 1; x =n (inv p} W {p ^ k ≤ 1}13.p ^k ≤ 1⇒ x = n!14. {n >0} k = n − 1; x = n {inv p} W {x = n!}R₁R₂predicate logicR3R4R5R6predicate logicR7RaR₂R10predicate logicR11

The original question asks you to complete a formal proof demonstrating the correctness of a program…

Answered: Complete the following formal proof by…

Engineering

Computer Science

Complete the following formal proof by completing the inference rule references R₁ to R₁1-

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Size of sample space A six-sided dice is rolled, a five-sided dice is rolled and a three-sided dice is rolled. Considering this as a probability experiment, what is the size of the sample space? An Event In the context of the probability experiment just described (a 6-sided, a 5-sided, and a 3-sided dice thrown): Consider the event in which two face- up numbers on the three dice add to 10. What is the size of this set? Save Reset
Part 1: Choose two of the proofs below and use one of the indirect proof techniques (reductio ad absurdum or conditional proof) presented in Chapter 8 to demonstrate the validity of the arguments. The proofs below may use any of the rules of inference or replacement rules given in Chapter 8. 1.(G • P) → K, E → Z, ~P → ~ Z, G → (E v L), therefore, (G • ~L) → K 2.(S v T) ↔ ~E, S → (F • ~G), A → W, T → ~W, therefore, (~E • A) → ~G 3.(S v T) v (U v W), therefore, (U v T) v (S v W) 4.~Q → (L → F), Q → ~A, F → B, L, therefore, ~A v B 5.~S → (F → L), F → (L → P), therefore, ~S → (F → P) Part 2: Below are basic arguments in English. Choose two arguments and translate those argument into the symbolism of predicate logic. You do not need to do a proof. Every fetus has an immortal soul. A thing has an immortal soul only if it has a right to life. Hence, every fetus has a right to life. (Fx = x is a fetus, Sx = x has an immortal soul, Rx = x has a right to life). Some wars are just. No war of…
Part II: Use 8 inference rules and 10 replacement rules (D.N., C.E., B.E., DeM., Dup., Assoc., Commu., Dist., Contrap., Export.) to prove the following arguments. ~(P≡Q) /∴ P ⊃~Q
1. Prove that IR2 of the Armstrong Inference Rules is correct (sound). We did that for IR3 in class. Consider F = {BC -> D, B -> E, CE -> D, E -> CA, BF -> G}and R(A,B,C,D,E,F,G) for the next 6 questions. 2. Use all three of Armstrong Rules to "infer" one new FD. 3. Find a minimal cover for F. 4. Find all many keys for R. 5. Find a 3NF decomposition for R that is dependency preserving and has lossless join. 6. Find a BCNF decomposition for R that has lossless join. 7. Apply the lossless join test algorithm on the decomposition of Q6 or the decomposition of Q7 to verify that the decomposition is a lossless join decomposition. You do not need to do that for both Q6 and Q7.
Show all of the numbered steps in your argument with the reasons (premise/rule of inference/equivalence law) next to them. From the premises: d a → -C d -b Show that - (b v c) is a valid conclusion by providing the argument. Symbols: A V II
Generate a probability histogram of the number of rolls required of two dice before a sum of “7” appears (graphical answer followed by Matlab code). Note: Don’t plot experiment that took more than 60 rolls.
Part I: use the 8 inference rules (Simp. Conj. D.S., H.S., DIL, M.P., M.T., Add) to prove the following arguments. You are NOT allowed to use any of the 10 replacement rules, nor C.P. or I.P. a) 1. (AvB) (CÉD) 2.~CÉ~A 3. ~B~D ^~(PÉQ) b) 1. ((PoQ)v~S) ~C 2. WÉ ((PoQ) ÉA) 3. (WvC)-(~SÉB) AAVB Part II: Use 8 inference rules and 10 replacement rules (D.N., C.E., B.E., DeM., Dup., Assoc., Commu., Dist., Contrap., Export.) to prove the following arguments. You are NOT allowed to use C.P. or I.P.
For each of the attached probabilistic expressions, please answer "yes" or "no" to indicate if it is equal to P(A,B,C), given Boolean random variables A, B and C , and no independence or conditional independence are assumed between any of them.