b) Let C(x, y) mean that "student x has taken course y", where the domain for x consists of all students at your school and the domain for y consists of all courses offered at the university. Express each of these sentences in terms of C(x, y), quantifiers, and logical connectives. (i) Not every student has taken the course SWEN2002. (ii) Laila has taken every course except for SWEN3000. (iii)Kayley has taken exactly one course. (c) Write each of the following statements in the form if p, then q. Shane has an allergy whenever he eats peanuts. (ii) It is necessary to have studied abroad to have the full experience of university. (iii)Rich will yell unless the children do not walk on his lawn.

b) Let C(x, y) mean that "student x has taken course y", where the domain for x consists of all students at your school and the domain for y consists of all courses offered at the university. Express each of these sentences in terms of C(x, y), quantifiers, and logical connectives. (i) Not every student has taken the course SWEN2002. (ii) Laila has taken every course except for SWEN3000. (iii)Kayley has taken exactly one course. (c) Write each of the following statements in the form if p, then q. Shane has an allergy whenever he eats peanuts. (ii) It is necessary to have studied abroad to have the full experience of university. (iii)Rich will yell unless the children do not walk on his lawn.

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

Using the predicate symbols shown and the appropriate quantifiers, write each English language statement as a predicate wff. (The domain is the whole world.) B(x): x is a bee. F(x): x is a flower. L(x, y): x loves y All bees love all flowers which one of these answer choices a. (∀x)(B(x) → [(∃y)(F(y) ∧ L(x, y)] b. (∀x)(B(x) → [(∀y)(F(y) ∧ L(x, y)] c. (∀x)(B(x) → [(∀y)(F(y) → L(x, y)] d. (∀x)(B(x) ∧ [(∃y)(F(y) → L(x, y)]
Solve this one please. Use semantic tableaux to show the following is or is not a tautology (is or is not valid). Explain what you did and how you interpreted the results. [p → (¬h → c)] ∧ (p → ¬h) ⊧ p → c
Quantifiers are called quantifiers because they express somethingabout the number of elements that satisfy a certain property. Showhow to express the following ‘quantified’ statements in predicatelogic with a unary relation symbol R. You don’t have to introduceany new quantifiers to do this, although you will need to keep inmind that the atomic formula x=yis always considered to be partof the language.(a) Exactly one x satisfies R(x).(b) At least one x satisfies R(x). (c) No more than three x satisfy R(x).(d) All but one x satisfy R(x).
Question 1 Consider the following model of the quantified relational logic of a hypothetical love triangle. U = {Alice, Bob, Carol, Dominic} a=Alice,b=Bob,c=Carol,d=Dominic [L] = {< Alice, Alice >, < Bob, Bob >, < Dominic, Dominic >, < Alice, Dominic >, < Dominic, Carol >, < Carol, Alice >, < Alice, Carol >, < Bob, Alice >, < Bob, Dominic >} Determine which of the following sentences are true in the model. You may read the formula Lxy as “x loves y”. If an existential sentence is true, provide at least one witness. If a universal sentence is false, provide at least one counterexample. (a) Lac (b) Lca (c) ∃z∃y(Lzy ∧ Lyz) (d) ∀zLzz (e) ∀z∃y(Lzz ∨ Lyz) (f) ∀z∀y(Lzy → Lyz) (g) ∀z∃y(Lzz → Lyz) (h) ∃z∀y(Lzz ∧ ¬Lyz) (i) ∃z∃y(Lzy ∧ ¬Lyz) (j) ∃x∃y∃z((Lxz ∧ Lxy) ∧ Lxx)
2. Using the given predicate definitions, express the following as a predicate formula. The universe of discourse (the set of all possible values applicable to predicate variables) is given to be the set of human beings. S(r, y) - True only if z is the sibling of y F(1, y) - True only if r is the father of y "If there are two individuals who are siblings then they have the same father". (hint xou may have to use equality predicate)
3. Prove ⊢ (¬A → A) → A in Hilbert deductive system. Note: In addition to the axioms and rule of inference of H, you may use any of the derived rules and/or theorems 3.20-3.30 (as numbered in the textbook). You may not use theorem 3.31, as this is precisely that theorem.Theorem 3.20 ⊢ ¬A → (A → B). Theorem 3.21 ⊢ A → (¬A → B). Theorem 3.22 ⊢ ¬¬A → A. Theorem3.23 ⊢A→¬¬A.Theorem3.25 ⊢(A→B)→(¬B→¬A).Theorem3.28 ⊢(¬A→false)→A.Rule 3.29 (Reductio ad absurdum) Theorem3.30 ⊢(A→¬A)→¬A. Prove {¬A} ⊢ (¬B → A) → B in H. Note: In addition to the axioms and rule of inference of Hilbert deductive system, you may use any of the derived rules and/or theorems 3.20-3.30 (as numbered in the textbook).
Consider predicate p = a^(bv¬c). Answer the following questions: (a) Compute (and simplify) the conditions under which each of the clauses determines predicate p.
1. A known relationship mode of R (U, F), U= (A, B, C, E, F, G, H, I, J, G); F={AB->E,ABE->FG, B->FI, C->J, CJ->I, G->H}; find the minimum cover of F, then use theNormal Form decomposition algorithm to decompose this mode to 3NF, and check if thedecomposition has the nonadditive join property.
Using Axiomatic Semantics, prove z = x - y; z = y - x; are not equivalent unless the two operands are equal. first establish the pre or post condition and then use the axiom of assignments. be precise with a formal proof.
Please answer the following question in depth with full detail. Consider the 8-puzzle that we discussed in class. Suppose we define a new heuristic function h3 which is the average of h1 and h2, and another heuristic function h4 which is the sum of h1 and h2. That is, for every state s ∈ S: h3(s) =h1(s) + h2(s) 2 h4(s) =h1(s) + h2(s) where h1 and h2 are defined as “the number of misplaced tiles”, and “the sum of the distances of the tiles from their goal positions”, respectively. Are h3 and h4 admissible? If admissible, compare their dominance with respect to h1 and h2, if not, provide a counterexample, i.e. a puzzle configuration where dominance does not hold.
Question 5 How do you model the following situation with a use case diagram: Mother and daughter cook dinner together. Sometimes it is necessary that one of them gets chives from the garden. B D 옷차 mother daughter (abstract) both mother OK K+K daughter mother daughter K mother daughter get chives get chives extend get chives get chives cook cook extend extend» cook cook «extend
Using the predicate symbols shown and appropriate quantifiers, write each English language statement as a predicate wff. (The domain is the whole world.) D(x): x is a day S(x): x is sunny R(x): x is rainy M: Monday T: Tuesday 1.All animals are dogs. 3.Some animals are not cats. 4.Every animal that is a dog is not a cat. 5.Some animals are dogs and cats. 6.No animal is both a dog and a cat. 7.An animal is always a dog only if it is a cat. 8.No animals are dogs. 9.Meg is a cat; all animals are cats. 10.Meg and Alex are both cats. 11.If one animal is a cat, then every animal will be a cat.