Got a b and c done need help with d and e please show work Step 1Disclaimer: Since you have posted a question with multiple sub-parts, we will solve first three sub-partsfor you. To get remaining sub-parts solved please repost the complete question and mention the sub-parts to be solved.The logical symbol "v" is used to denote "OR". The logical symbol "-" is used to denote "NOT".Any two propositions are said to be logically equivalent if the truth value in each row of the truth table isthe same for both propositions.(a)It is provided that P↓Q is true if both P, Q are false and false in all other scenarios. Use this data to makethe truth table of P↓Q as follows.PQTTTFFTFFFTMake the truth table of ¬PvQ as follows.PQPVQTPTTTTFTFTודFFFFFTComparing the last columns of both truth tables, it can be concluded that the expressions: P+Q andPvQ are logically equivalent.Q(b)Make the truth table of QvP as follows.PQTTTFFFComparing the last columns of both truth tables, it can be concluded that the expressions: P Q and QvPare logically equivalent. Hence, is commutative.TTFTFLFTTTF(c)Make the truth table of P Q R and P Q R as follows.P↓↓RTFRTFTFTFTP+QFFFLLP↓QFFFFTFTTQ+PFFFTFTFT-PVQFTFQ&RFFFTFFFFFFP↓QRFFFFTTTFFFTFTFComparing the columns of P Q R and P Q R, it can be concluded that the expressions: P+Q+R andP Q R are logically not equivalent. Hence, it is proved that is not associative. 1. We define a logical connective ↓ as follows: P↓ Q is true when both P and Q are false,and it is false otherwise. (We read P↓ Q as "P nor Q”).(a) Write a truth table for P↓ Q and check that P↓ Q is logically equivalent to¬(P V Q).(b) Check that P↓ Q = Q ↓ P. That is, is commutative.(c) Show that (P ↓ Q) ↓ R and P ↓ (Q ↓ R) are logically inequivalent. That is, ↓ isnot associative.(d) Show that the logical connectives ¬, A, and V can each be expressed entirely interms of ↓, without using any other logical connectives. Specifically, prove thefollowing:i. ¬P = (P ↓ P).ii. P^Q = (P ↓ P) ↓ (Q ↓ Q).iii. PVQ (P ↓Q) ↓ (P↓ Q).(e) Prove that the logical connective ⇒ can be expressed entirely in terms of ↓. Thatis, show that the sentence P⇒ Q is logically equivalent to a sentence involving ↓and no other logical connectives.

Part D) (i) P ¬P T F F T as mentioned that P↓Q is true only when both are false , and in…

1. We define a logical connective as follows: P↓ Q is true when both P and Q are false, and it is false otherwise. (We read P Q as "P nor Q"). (a) Write a truth table for P Q and check that P Q is logically equivalent to ¬(PVQ). (b) Check that P↓ Q = Q ↓ P. That is, is commutative. (c) Show that (P ↓ Q) ↓ R and P↓ (QR) are logically inequivalent. That is, is not associative. (d) Show that the logical connectives, A, and V can each be expressed entirely in terms of ↓, without using any other logical connectives. Specifically, prove the following: i. ¬P = (PP). PAQ=(PP) ↓ (Q ↓ Q). iii. PVQ = (P↓ Q) ↓ (P ↓ Q). (e) Prove that the logical connective ⇒ can be expressed entirely in terms of ↓. That is, show that the sentence P⇒ Q is logically equivalent to a sentence involving ↓ and no other logical connectives.

1. We define a logical connective as follows: P↓ Q is true when both P and Q are false, and it is false otherwise. (We read P Q as "P nor Q"). (a) Write a truth table for P Q and check that P Q is logically equivalent to ¬(PVQ). (b) Check that P↓ Q = Q ↓ P. That is, is commutative. (c) Show that (P ↓ Q) ↓ R and P↓ (QR) are logically inequivalent. That is, is not associative. (d) Show that the logical connectives, A, and V can each be expressed entirely in terms of ↓, without using any other logical connectives. Specifically, prove the following: i. ¬P = (PP). PAQ=(PP) ↓ (Q ↓ Q). iii. PVQ = (P↓ Q) ↓ (P ↓ Q). (e) Prove that the logical connective ⇒ can be expressed entirely in terms of ↓. That is, show that the sentence P⇒ Q is logically equivalent to a sentence involving ↓ and no other logical connectives.

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

Construct a truth table for (p ∨ ¬ q) ∨ (¬ p ∧ q) Use the truth table that you constructed in part 1 to determine the truth value of (p ∨¬q) ∨ (¬ p ∧ q), given that p is true and q is false. Determine whether the given statement is a tautology, contradiction, or contingency. p V (~p V q) ~ (p ∧ q) ~p V ~q
5. Check whether p →r is a valid conclusion from the following premises: p → q V ¬r, q → p^r 6. Using indirect method, prove that q is a valid conclusion from the following premises: p → q,r → q, s → (p V r) 7. Using conditional proof, show that ¬q → s can be derived from the following premises: p → (q → r),¬r V p, q
Consider f : X →Y, with domain X = {g,c, b, v, h, r, u, s, e, a, n, k} and codomain Y = {54, 73, 92, 74, 42, 61, 30, 14, 41, 27, 71, 45}, as defined below using the set of expressions of the form f(a) = b. Which of the following statements is true? f (b) = 71 f(k) f(s) f(v) f(c) f (g) f(u) f (h) = 92 f(e) f (r) f (n) f (a) = 27 = 41 = 74 42 = 30 = 30 45 = 61 = 73 = 14 Select one: O f(x) is neither an injection nor a surjection O f(x) is a surjection but not an injection O f(x) is an injection but not a surjection O f(x) is not actually a function O none of these options O f(x) is both an injection and a surjection
1. Show that (p ∧ q) → r and (p → r) ∧ (q → r) is logically equivalent.
Tell if the statements are true or false. Let p: 3 + 5 = 6; q: 5 + 5 = 10. (a) (p ∧ ~q) ∧ p True False (b) p ∨ (p → q) True False (c) (p ∧ q) → p True False
Show using a truth table if the following statements are equivalent.a. ~(p ∨ q) and ~p ∧ ~qb. p → q and ~p ∨ qc. p ↔ q and [(p → q) ∧ (q → p)]d. p → (q ∨ r) and (p → q) ∨ (p → r)e. [p ↔ (q ∨ r)] ∨ q and (p → q) ∨ (p ↔ r)
Conjuctive Normal Form of these formula with step by step solution 1. q ↔ (p ∧ q) 2. ¬q → ¬(p ∧ (p → q))
1. Using the truth table Determine whether: a) (¬p → ¬q ) ∨ (p → ¬q) is equivalent to p ∨ ¬p b) ¬p ∨ (p ˄ q) is equivalent to p ↔ ¬q 2. Show the following statement is contraction, a tautology, or neither. (p→(q→r))↔ (p ˄ q →r) SHOW YOUR WORK AND ANSWER ALL QUESTIONS PLEASE!
From the following well-formed formula Let P: A ∧ B and Q : A → C P → Q: A ∧ B → If A, Then C P → Q : A ∧ B → (A → C) Construct a table that evaluates the truth value for P → Q Is there a modus ponens? Thanks
Show that p ↔ q is logically equivalent to (p ∧ q) ∨ (¬p ∧¬q).
We have shown how to use truth tables to determine if two formulas are truth-functionally equivalent.If two formulas F and G are truth-functionally equivalent we introduce another symbol ↔, aptly called thebiconditional. Here is the truth table for the biconditional.p q (p ↔ q)1 1 11 0 00 1 00 0 1Now we shall say that F and G are truth-functionally equivalent if (F ↔ G) is a tautology.There are other properties of two formulas that we are usually interested in besides truth-functionalequivalence. One of these properties is when two formulas are mutually exclusive. We say two formulas Fand G are mutually exclusive if (F ∧ G) is contradictory (unsatisfiable).Now using truth tables determine whether the following formulas are truth-functionally equivalent or mutuallyexclusive.(a) p and ¬p (b) p and ¬¬p (c) ¬(p ∧ ¬q) and (p → q) (d) (¬p ∨ q) and (p → q) (e) ¬(¬p ∨ ¬q) and (p ∧ q) (f) ¬(¬p ∧ ¬q) and (p ∨ q)
6. Let M = (Q,Sigma,s, q0, F) be a dfa and define cfg g= (v,sigma, R,S) as follows: 1. V=Q; 2. For each q in Q and a in sigma, define rule q->aq' where q' = s(q,a); 3. S = q0 Prove L(M) = L(G)