The following exercises involve the logical operators NAND and NOR. The proposition p NAND q is true when either p or q, or both, are false; and it is false when both p and q are true. The proposition p NOR q is true when both p and q are false, and it is false otherwise. The propositions p NAND q and p NOR q are denoted by p | q and p ↓ q, respectively. (The operators and are called the Sheffer stroke and the Peirce arrow after H. M. Sheffer and C. S. Peirce, respectively.) a Construct a truth table for the logical operator NAND and NOR b Show that p | q is logically equivalent to ¬(p ^ q).

The following exercises involve the logical operators NAND and NOR. The proposition p NAND q is true when either p or q, or both, are false; and it is false when both p and q are true. The proposition p NOR q is true when both p and q are false, and it is false otherwise. The propositions p NAND q and p NOR q are denoted by p | q and p ↓ q, respectively. (The operators and are called the Sheffer stroke and the Peirce arrow after H. M. Sheffer and C. S. Peirce, respectively.) a Construct a truth table for the logical operator NAND and NOR b Show that p | q is logically equivalent to ¬(p ^ q).

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

1. Let p, q, and r be the statementsp: I finish my assignment before 2:00 pm todayq: I go to the gym todayr: It is raining today (a) Invent a compound statement that uses all three of the proposi-tions p, q, and r as well as whatever logical connectives you choose. (b) Write an English sentence that corresponds to the statement youconstructed in (a). (c) Make a truth table for the statement you constructed in (a).
Consider the following statement: Statement A: ∀ integers m and n, if 2m + n is odd then m and n are both odd. Disprove Statement A. That is, show that Statement A is false
2. Determine the truth value of each of these statements if the domain of each variable consists of all real numbers. If true, give a brief explanation for why. If false, give a counterexample (i.e. a set of values x,y that make the statement false. You must also explain why they make the statement false.) a) yvx((y > x²) → y > x) b) Vy!x(√√ 0)) d) x(x < 0⇒x² ≥y) e) \xy(x² = y² ↔ y³ = x³)
Below are some statements; the domain of each is the set of all integers. For symbolic statements, thenegation symbol (¬) must not apear in your answer. For English statements, don’t use “It is not the casethat” or just the word “not” to form the negation.For each one, state whether the statement is TRUE, FALSE, or CAN’T BE DETERMINED. For all that onesthat are TRUE or FALSE, state the negation:1.∃n(nis even)2.∀a∀b(3a≥2b)3.∀a∃b(ab= 1)
True or False: for each of the following statements, decide if it is true or false. If it istrue, then provide a proof; if it is false, provide a counterexample.(a) For events A, B, it is always the case that Pr(Bn.A) < Pr(B).(b) For events A, B with Pr(A) > 0, it is always the case that Pr(B | A) < Pr(B).
Consider the following true propositions:• p : The applicant has passed the learner permit test.• q : The applicant has passed the road test.• r : The applicant is allowed a driver’s license.For each of the following sentences write,symbolically, the compound proposition that correspondstothe given sentence in English asit is written (do not change the order or form of the expression).a) The applicant did not pass the road test but passed the learner permit test.b) If the applicant passes the learner permit test and the road test, then the applicant is allowed adriver’s license.c) Passing the learner permit test and the road test are necessary for being allowed a driver’slicense.d) The applicant passed either the learner permit test or the road test, but not both.e) It is not true that the applicant does not pass the road test and is allowed a driver’s license.
Assume that x and y are two integers. Based on correct Boolean operators, shows:(i) Evaluation whether both variables are zero.(ii) Evaluation whether at least one of the variables is zero.(iii) Evaluation whether exactly one of the variables is zero.(iv) State the advantage of utilizing data type bool in comparison to “false”/”true” or integers 0/1.
What do parentheses do in mathematical equations? a. Ensure addition functions are performed before subtraction functions b. Ensure multiplication functions are performed before division functions c. Ensure multiplication functions are performed before addition functions d. Ensure that whatever operation is inside the parentheses is performed first
38. If p is true, q is false, r is true, and s is false, what are the truth values of ~(q ⇔ s) and ~r ⇔ ~q, respectively?
Identify p, g, and r if necessary. Then translate each argument to symbols and use a truth table to decide if the argument is valid or invalid. If it snows, I can go snowboarding, It did not snow . I cannot go snowboarding.
1. Consider the following statements: P(x, y) ="Er R such that Vy ER, x+y=0" Ry R such that 2+y=0" Q(x, y) = "Vr Explain the difference between what these two statements are claiming. Which of them is true and which of them is false?
2. Let A(x) be the statement "x has apples," C(x) be the statement "x has cherries," and B(x, y) be the statement "x is better than y," where the domain of x and y consists of all pies. Which logical expression corresponds to the following statement? "There is some pie that has apples that is better than every pie that has cherries." a. 3xVy(A(x) ^ (C(y) → B (x, y))) b. xvy(A(x)^C(y) ^ B (x, y)) c. xvy((A(x) ^ C(y)) → B (x, y)) d. 3xVy(A(x) → (C(y) ^ B (x, y)))