edited by
3,756 views
32 votes
32 votes

Given that

  • $B(x)$ means "$x$ is a bat",
  • $F(x)$ means "$x$ is a fly", and
  • $E(x, y)$ means "$x$ eats $y$",

what is the best English translation of $$ \forall x(F(x) \rightarrow \forall y (E(y, x) \rightarrow B(y)))?$$

  1. all flies eat bats
  2. every fly is eaten by some bat
  3. bats eat only flies
  4. every bat eats flies
  5. only bats eat flies
edited by

3 Answers

Best answer
40 votes
40 votes
If $x$ is a fly, then for all $y$ which eats $x$, $y$ is a bat. This means only bats eat flies.

Option (E).
edited by
11 votes
11 votes
For any/all x if it is a fly and if it gets eaten up by any y than that y must be a bat..

So only bats eat flies.

Option e
3 votes
3 votes

first solve ∀y(E(y,x)→B(y)) only take x=fly1

so for x1fly1  ∀y(E(y,x)→B(y)) telling that : (if y1 eats fly1  then y1 is Bat) and(if y2 eats fly1  then y2 is Bat) and (if y1 eats fly1  then y1 is Bat ) and ....(if yn eats fly1  then yn is Bat).

this conclude that:  only bats eats fly1 .

no solve comlete :∀x(F(x)→∀y(E(y,x)→B(y)))

 = (if x is fly1 then only bats eats fly1) and (if x is fly2 then only bats eats fly2) and (if x is fly3 then only bats eats fly3)...

= every fly  eaten by bats only.

= only bats eats flies.

Ans: E

 

Answer:

Related questions

1.2k
views
1 answers
8 votes
go_editor asked Dec 23, 2016
1,249 views
Consider the First Order Logic (FOL) with equality and suitable function and relation symbols. Which of the following is FALSE?Partial orders cannot be axiomatized in FOL...
4.1k
views
4 answers
26 votes
go_editor asked Dec 22, 2016
4,112 views
Let $f \: \circ \: g$ denote function composition such that $(f \circ g)(x) = f(g(x))$. Let $f: A \rightarrow B$ such that for all $g \: : \: B \rightarrow A$ and $h \: :...
1.1k
views
1 answers
5 votes
go_editor asked Dec 23, 2016
1,094 views
A multivariate polynomial in $n$ variables with integer coefficients has a binary root if it is possible to assign each variable either 0 or 1, so that the polynomial eva...
3.0k
views
2 answers
19 votes
go_editor asked Dec 23, 2016
3,033 views
Consider the following grammar $G$ with terminals $\{[, ]\}$, start symbol $S$, and non-terminals $\{A, B, C\}$:$$S \rightarrow AC \mid SS \mid AB$$$$C \rightarrow SB$$$...