Question

Let C(x) be the statement student x has a cat, let D(x) be the statement, x...

Let C(x) be the statement student x has a cat, let D(x) be the statement, x has a dog and let F(x) be the statement x has a ferret. Express each of these statements in terms of C(x), D(x), F(x), quantifiers, and logical connectives and then negate each of them. Let the domain consist of all students in your class, call it D.

(a) A student in your class has a cat, a dog, and a ferret.

(b) All students in your class have a cat, a dog, or a ferret.

(c) Some student in your class has a cat and a ferret, but not a dog.

Just want to check my negations

Homework Answers

Answer #1

(a)

A student in your class has a cat,a dog and a ferret.

Negation :

So,

Every student in your class has not a cat nor a dog nor a ferret.

(b)

All students in your class have a cat, a dog , or a ferret

Negation :

So,

Some students in your class have neither a cat nor a dog nor a ferret.

(c)

Some student in your class has a cat and a ferret but not a dog

Negation

So

All students in your class has not a cat nor a dog or have a ferret.

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Please answer below question. Let C(h,k) be the statement “ h is a student in the...
Please answer below question. Let C(h,k) be the statement “ h is a student in the class k ”, A(h) be the statement “ h is a member of the Sports Society ”, and B(h) be the statement “ h is the member of the History Society”, where the domain for h is all students in the college and the domain for k is all class in the college. Translate the following statement into logical expressions. All classes have members...
(12) Let B(x) be “x is a mammal”, F(x) be “x has fur”, and Y(x) be...
(12) Let B(x) be “x is a mammal”, F(x) be “x has fur”, and Y(x) be “x can swim”. Translate into a formula using quantifiers: All mammals can swim. Translate into a formula using quantifiers: Some things with fur are not mammals. (10) Negate each of the statements in #5. Your answers must be expressed using symbols, not English. Negate 5a Negate 5b
Convert the following givens into formal predicate logic. Define predicates as necessary. Then, negate the predicate...
Convert the following givens into formal predicate logic. Define predicates as necessary. Then, negate the predicate sentence. Push all negations to the closest terms a) There are at least two people who everyone knows. Let the domain be people. b) Every student takes at least two classes. Let the domain be people and classes. c) Someone is left handed and someone is tall, but no one is both. Let the domain be people d) All students know each other. Let...
Convert the following givens into formal predicate logic. Define predicates as necessary. Then, negate the predicate...
Convert the following givens into formal predicate logic. Define predicates as necessary. Then, negate the predicate sentence. Push all negations to the closest terms a) There are at least two people who everyone knows. Let the domain be people. b) Every student takes at least two classes. Let the domain be people and classes. c) Someone is left handed and someone is tall, but no one is both. Let the domain be people d) All students know each other. Let...
Discrete Math Most important is c) and e) and f) Statements with nested quantifiers: variables with...
Discrete Math Most important is c) and e) and f) Statements with nested quantifiers: variables with different domains. The domain for the first input variable to predicate T is a set of students at a university. The domain for the second input variable to predicate T is the set of Math classes offered at that university. The predicate T(x, y) indicates that student x has taken class y. Sam is a student at the university and Math 101 is one...
How to express the following statements using quantifiers and logical connectives? P(x): x has a car,...
How to express the following statements using quantifiers and logical connectives? P(x): x has a car, Q(x): x is rich, R(x): x is young, S(x): x can drive (a) Anyone has a car can drive. (b) No young people can drive. (c) Anyone rich has a car. (d) No young people are rich. (e) Does (3d) follow (3a), (3b) and (3c)? If not, is there a correct conclusion?
Suppose the domain of the propositional function P ( x, y ) consists of pairs x...
Suppose the domain of the propositional function P ( x, y ) consists of pairs x and y, where x is a, b, c, or d and y is e, f, or g. Write out the following propositions using disjunctions, conjunctions, and negations. ∃x P ( x, g ) ∀y P ( b, y ) ∃y ¬ P ( a, y ) ∀x ¬ P ( x, e ) ∃x ¬ P ( x, f ) Translate the following statements...
Let 'x' be a random variable that represents the length of time it takes a student...
Let 'x' be a random variable that represents the length of time it takes a student to write a term paper for Tonys class. After interviewing students, it was found that 'x' has an approximately normal distribution with a mean of µ = 7.3 hours and standard deviation of ơ = 0.8 hours. For parts a, b, c, Convert each of the following x intervals to standardized z intervals. a.) x < 7.5 z < b.) x > 9.3 z...
Let D = E = {−2, 0, 2, 3}. Write negations for each of the following...
Let D = E = {−2, 0, 2, 3}. Write negations for each of the following statements and determine which is true, the given statement or its negation. Explain your answer (i) ∃x ∈ D such that ∀y ∈ E, x + y = y. (ii) ∀x ∈ D, ∃y ∈ E such that xy ≥ y.
Let D = E = {−2, 0, 2, 3}. Write negations for each of the following...
Let D = E = {−2, 0, 2, 3}. Write negations for each of the following statements and determine which is true, the given statement or its negation. Explain your answer. (i) ∃x ∈ D such that ∀y ∈ E, x + y = y. (ii) ∀x ∈ D, ∃y ∈ E such that xy ≥ y.
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT