Discrete Mathematics
Q191.
Which one of the following predicate formulae is NOT logically valid? Note that W is a predicate formula without any free occurrence of x.Q192.
The binary operator \neq is defined by the following truth table. Which one of the following is true about the binary operator \neq?Q193.
Choose the correct choice(s) regarding the following proportional logic assertion S:S: (( P \wedge Q) \rightarrow R) \rightarrow (( P \wedge Q) \rightarrow (Q \rightarrow R))[MSQ]Q194.
Consider the statement "Not all that glitters is gold" Predicate glitters(x) is true if x glitters and predicate gold(x) is true if x is gold. Which one of the following logical formulae represents the above statement?Q195.
Consider the recurrence relation a_{1}=8, a_{n}=6n^{2}+2n+a_{n-1}. Let a_{99}= K \times 10^{4}. The value of K is .Q196.
Consider the first-order logic sentence F:\forall x(\exists yR(x,y)). Assuming non-empty logical domains, which of the sentences below are implied by F? I. \exists y(\exists xR(x,y)) II. \exists y(\forall xR(x,y)) III. \forall y(\exists xR(x,y)) IV. \neg \exists x(\forall y\neg R(x,y))Q198.
What is the logical translation of the following statement? "None of my friends are perfect."Q199.
Consider the following statements: P: Good mobile phones are not cheap Q: Cheap mobile phones are not good L: P implies Q M: Q implies P N: P is equivalent to Q Which one of the following about L, M, and N is CORRECT?