2. For each of the following statements, push all negations (→) as far as possible so that no negation is to the left of a quantifier (in other words, the negation is immediately to the left of a predicate). Show your work. (a)¬¬¬z(A(x,z) ^ B(y, z)) (b) (³xA(x,y) → zB(z, y)) (c)¬x((yA(x,y) →yB(x, y)) → ¬y(x, y))

2. For each of the following statements, push all negations (→) as far as possible so that no negation is to the left of a quantifier (in other words, the negation is immediately to the left of a predicate). Show your work. (a)¬¬¬z(A(x,z) ^ B(y, z)) (b) (³xA(x,y) → zB(z, y)) (c)¬x((yA(x,y) →yB(x, y)) → ¬y(x, y))

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

3. (a) Let Σ = {a, b}. Find a regular expression corresponding to the language L = {ba} ∗ ∪ {aa, bb}. (b) Let Σ = {0, 1}. Give the language corresponding to the regular expression 10∗ (0 +.
I need help to answer Question no. 30 prove that the below WFF is a valid argument. (∀x)(∀y)[(P(x) Λ S(x,y)) →Q(y)] Λ (∃x)B(x) Λ (∀x)(B(x) → P(x)) Λ (∀x)(∃y)S(x,y) → (∃x)Q(x) Chapter 1.4 - Predicate Logic Text Book: Discrete Mathematics and its application 7th edition. Author: Judith L Gersting.
13. p(x): x is intelligent q(x): x reads book r(x): x is a student in your class Find the correct English translation for the following logical expression: ∀x(r(x)→(p(x) Λ q(x)) a. None b. There is an intelligent student in your class who reads book c. Every student in your class is intelligent and reads book d. All student in your class is intelligent and doesn't read book
b) Given the following relations: A B C 1 5 7 4 9 r a TU В 8 10 6 11 S A В μ D 4 12 Find (i) the Cartesian product of r and s (rx s). (ii) the Cartesian product of r and s and then performing a selection operation on the result with the predicate r.A = s.A (Or.A-s.A (r x S)). (iii) the projection of A,C from relation r (IIA.c (r)). E 6 8
3. Express the following English sentences using propositional functions, quantifiers and logical connections. (a) Someone in the class is helped by everyone in the class. (b) There is a hard working student in the class who has not been helped by any student in class. (c) For everyone in the class, someone who is smart has helped him/her. SO (d) There are two people in the class who have not helped each other. (e) There is a hard working student in the class who is helped by every smart student in class. (f) There are some companies that hire only hard working students.
use semantic tableaux to show if these are invalid: ¬(p⊃q)∧¬(p⊃r)⊢¬q∨¬r p∧(¬r∨s),¬(q⊃s)⊢r ¬(p∧¬q)∨r,p⊃(r≡s)⊢p≡q p⊃(q∧r),¬r⊢¬p
For each of the following regular expressions over Σ = {a, b}, state 5 strings that are in the language of the regular expression, and 5 strings that are not. 1. (a∗b)∗|a∗2. (Σ∗aaΣ∗)|(Σ∗bbΣ∗)|(ab)∗|(ba)∗|a|b
Select all that are true. a) Given a propositional formula O on n variables, it is always possible to determine whether is a tautology. U b) Given a sentence in predicate logic , if we apply an "equivalence rule" to produce an equivalent sentence p, it is possible that p evalutes to T but evalutes to F, or vice-versa. Oc) Given a propositional formula y, if we apply an "equivalence rule" to produce an equivalent formula , it is possible that p evaluates to T on some truth assignment but evaluates to F on the same truth assignment, or vice- versa. Od) Given two propositional formulas P and on (the same) n variables, it is always possible to determine whether P and are (logically) equivalent.
9. Express the following statement ((P^¬R) → ¬(¬Q ✓ R)) in simplified V disjunctive normal form.
A fictitious setting, JUNGLE, is being described in PDDL terminology. There are three predicates in this universe, and each one may have a maximum of four arguments. There should be a limit on the number of JUNGLE states. It's important to provide an explanation.
Translate each of these nested quantifications into an English statement that expresses a mathematicalfact. The domain in each case consists of all real numbers.a) ∃x∀y(x + y = y) b) ∀x∀y (((x ≥ 0) ∧ (y < 0)) → (x − y > 0))c) ∃x∃y(((x ≤ 0) ∧ (y ≤ 0)) ∧ (x − y > 0))d) ∀x∀y((x ≠ 0) ∧ (y ≠ 0) ↔ (xy ≠ 0))