Mathematics, 28.01.2020 22:42 katlynnschmolke

Let c(x) be the statement "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. let the domain consist of all students in your class. 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. d) no student in your class has a cat, a dog, and a ferret. e) for each of the three animals, cats, dogs, and ferrets, there is a student in your class who has this animal as a pet.

Answers: 1

Show answers

Answers

Answer from: kkruvc

$\mathbf{a)} \left( \exists x \in X\right) \; C(x) \; \wedge \; D(x) \; \wedge \; F(x)\\\mathbf{b)} \left( \forall x \in X\right) \; C(x) \; \vee \; D(x) \; \vee \; F(x)\\\mathbf{c)} \left( \exists x \in X\right) \; C(x) \; \wedge \; F(x) \; \wedge \left(\neg \; D(x) \right)\\\mathbf{d)} \left( \forall x \in X\right) \; \neg C(x) \; \vee \; \neg D(x) \; \vee \; \neg F(x)\\\mathbf{e)} \left((\exists x\in X)C(x) \right) \wedge \left((\exists x\in X) D(x) \right) \wedge \left((\exists x\in X) F(x) \right)$

Step-by-step explanation:

Let be a set of all students in your class. The set is the domain. Denote

$C(x) - ' \text{$x $ has a cat}'\\D(x) - ' \text{$x$ has a dog}'\\F(x) - ' \text{$x$ has a ferret}'$

$\mathbf{a)}$

Consider the statement 'A student in your class has a cat, a dog, and a ferret'. This means that $\exists x \in X$ so that all three statements C(x), D(x) and F(x) are true. We can express that in terms of C(x), D(x) and F(x) using quantifiers, and logical connectives as follows

$\left( \exists x \in X\right) \; C(x) \; \wedge \; D(x) \; \wedge \; F(x)$

$\mathbf{b)}$

Consider the statement 'All students in your class have a cat, a dog, or a ferret.' This means that $\forall x \in X$ at least one of the statements C(x), D(x) and F(x) is true. We can express that in terms of C(x), D(x) and F(x) using quantifiers, and logical connectives as follows

$\left( \forall x \in X\right) \; C(x) \; \vee \; D(x) \; \vee F(x)$

$\mathbf{c)}$

Consider the statement 'Some student in your class has a cat and a ferret, but not a dog.' This means that $\exists x \in X$ so that the statements C(x), F(x) are true and the negation of the statement D(x) . We can express that in terms of C(x), D(x) and F(x) using quantifiers, and logical connectives as follows

$\left( \exists x \in X\right) \; C(x) \; \wedge \; F(x) \; \wedge \left(\neg \; D(x) \right)$

$\mathbf{d)}$

Consider the statement 'No student in your class has a cat, a dog, and a ferret..' This means that $\forall x \in X$ none of the statements C(x), D(x) and F(x) are true. We can express that in terms of C(x), D(x) and F(x) using quantifiers, and logical connectives as a negation of the statement in the part a), as follows

$\neg \left( \left( \exists x \in X\right) \; C(x) \; \wedge \; D(x) \; \wedge \; F(x)\right) \iff \left( \forall x \in X\right) \; \neg C(x) \; \vee \; \neg D(x) \; \vee \; \neg F(x)$