7. Let P denote the set of all phones in the world such that p ∈ P is a phone. Thus, S(p) denotes that “p is a SamsungTM phone”, N(p) denote that “p is a NokiaTM phone”, and G(p) denote that “p is a GoogleTM phone”. Therefore, express each of the following statements using quantifiers, logical operations, and the propositional functions: S(p),N(p),G(p). (a) There is a GoogleTM phone that is also a SamsungTM phone. (b) Every NokiaTM phone is a GoogleTM phone. (c) No NokiaTM phone is a GoogleTM phone.

7. Let P denote the set of all phones in the world such that p ∈ P is a phone. Thus, S(p) denotes that “p is a SamsungTM phone”, N(p) denote that “p is a NokiaTM phone”, and G(p) denote that “p is a GoogleTM phone”. Therefore, express each of the following statements using quantifiers, logical operations, and the propositional functions: S(p),N(p),G(p). (a) There is a GoogleTM phone that is also a SamsungTM phone. (b) Every NokiaTM phone is a GoogleTM phone. (c) No NokiaTM phone is a GoogleTM phone.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter13: Overloading And Templates

Section: Chapter Questions

Problem 29SA

See similar textbooks

Similar questions

9. Is the following statement TRUE or FALSE? If it is TRUE, prove it, and if it is FALSE, provide a counter-example.If f: S→T is a function, where |S| > |T| (and both are finite sets), then there exist elements s1 and s2 in S such that fs1()=fs2()
Write proof to the following statements.(a) Given that (A ∪ B) ∩ B′ ⊆ C prove that 2A∩B′ ⊆ 2C .(b) Prove that (A′ ∪ (A ∩ C) ∪ (A ∩ C′)) ∩ (B′ ∩ (C′ ∪ B) ∪ (C ∪ B)) = U , where Udenotes the universal set?
Suppose P(a) is the predicate "a is prime" and Q(a) is the predicate "a is divisible by 3", for all integers a. In the following, the domain is the set of integers. What is the truth value of ∃x(P(x)∧Q(x))? Justify your answer.
5. Let R = {1, 3, π, 4, 1, 9, 10}, S = {{1}, 3, 9, 10}, T = {1, 3, π}, and U = {{1, 3, π}, 1}. Which of thefollowing are true? For those that are not, why not? (d) 1 ⊆ U(e) {1} ⊆ T(f) {1} ⊆ S(g) {1} ∈ S
Rewrite the following proposition as unambiguous English sentences. The relevant predicates are defined as follows: Again, let’s let P be a set of all people A(x) means “x is teaching the AI course” T(x) means “x is taking AI course” F(x) means “x has a twitter account.” C(x) means “x likes to read.” For example, the proposition ∃x { P [A(x)∧ C(x)]} could be translated as “There is a person who is teaching and likes to read” P [T(x) → (F(x) C(x))] ?
5 A. Let * be a new logical connective such that p * q does not hold if and only if p and q are either both false or both true. (i) Write down the truth table for p * q (ii) Write down the truth table for (p * p) * (q * q). (iii) Does the table in (b) coincide with a table in *Truth table available on the given image* (By "Coincide" we mean that the respective columns of T and F values are the same) B. Construct a formula in CNF based on each of the following truth tables: *Truth table available on the given image* C. Compute CNF (NNF ( IMPL_FREE ¬(p → ( ¬ (q ∧ ( ¬p → q))))))
Computer Science Let a M be a finite set of messages, and let S(M) denote the set of all permutations of M (all bijective functions f : M → M). We’ll assume that if given a description of σ ∈ S(M), both σ and σ −1 are efficiently computable. Suppose P ⊂ S(M) is such that ∀x, y ∈ M, ∃σ ∈ P such that σ(x) = y. (a) Show that |P| ≥ |M|. (This is easy, but makes sure you’ve parsed the definition.) (b) Show that if |P| = |M|, then the following encryption scheme is perfectly secure, provided you only use it once: 1 Key generation: select a random σ ∈ P; Encryption: m 7→ σ(m) Decryption: c 7→ σ −1 (c) (c) Show that the above is false if |M| < |P| < 2|M|. (d) Observe that for any finite group G and any g ∈ G, the map x 7→ gx is a permutation of G. By viewing G itself as a set of permutations of G in this way, show that the above property is satisfied (with M = P = G). (e) The traditional xor one time pad is a special case of the above. What is the finite group in this case?
4. Let N(x) be the statement “x has visited North Dakota,” where the domain consists of the students in your school. Express each of these quantifications in English. a) ∃x N(x) b) ∀x N(x) c) ˺∃x N(x) d) ∃x ˺N(x) e) ˺∀x N(x) f ) ∀x ˺N(x)
For each of the following statements, let the domain be all animals in the world. 1. Express each of the statements using quantifiers and propositional functions. 2. Form the negation of the statement so that no negation is to the left of the quantifier. 3. Express the negation in simple English. (Do not simply use the words “it is not the case that..."). (a) All dogs have fleas (b) There is a horse that can add. (c) Every koala can climb. (d)No monkey can speak French. (e) There exists a pig that can swim and catch fish.
Let p, q and r be propositions: p: Jasper has sore eyes q: Jasper misses the last day of the board exam r: Jasper passes the board exam Write the following propositions in terms of the given connectives: a.) q→¬r b.) q ↔ p c.) p → q ⋀ ¬r
Use quantifiers to symbolize the following statements. Let the universe be the set of all things, and use the following propositional functions (all are predicates, not relations): D(x) = x is a dog; M(x) = x is miserable; R(x) = x is ridden with fleas; E(x) = x is exercised; N(x) = x is neglected; W(x) = x is well treated. Some dogs are miserable if they are ridden with fleas. Not all miserable dogs are ridden with fleas. Dogs that are not exercised are neglected and not well treated. No dog that is well treated is neglected. Only well-treated dogs are not neglected.
We are given the following: D = set of all students at your school M(s) = “s is a math major” C(s) = “s is a computer science student” E(s) = “s is an engineering student” Use quantifiers, variables, and the predicates M(s), C(s), and E(s) to express the statement of “Some computer science students are also math majors”