retagged by
450 views
1 votes
1 votes
Consider the following formula and its two interpretations $I1$ and $I2$.

$α:(∀x)[Px⇔(∀y)[Qxy⇔¬Qyy]]⇒(∀x)[¬Px]$

$I1 :$ Domain: the set of natural numbers

$Px =$ $\text{'x is a prime number'}$

$Qxy =\text{ 'y divides x'}$

$I2 :$ same as $I1$ except that $Px = \text{'x is a composite number'}.$

Which of the following statements is true?

$\text{I1 satisfies α, I2 does not}$
$\text{I2 satisfies α, I1 does not}$
$\text{Neither I1 nor I2 satisfies α}$
$\text{Both I1 and I2 satisfies}$

just one doubt
when it says $p(x): x \text{ is a prime number}$
$α:(∀x)[Px⇔(∀y)[Qxy⇔¬Qyy]]⇒(∀x)[¬Px]$

then, in that $(∀x)$ does that means $x$ itself is a set of prime numbers and for all $x$ quantifier is going to pick every prime number value from the set

when it says $p(x): x \text{ is a composite number}$
$α:(∀x)[Px⇔(∀y)[Qxy⇔¬Qyy]]⇒(∀x)[¬Px]$

then, in that $(∀x)$ does that means $x$ itself is a set of composite numbers and for all $x$ quantifier is going to pick every composite number value from the set

and the domain of $Y:\text{{set of all natural numbers}}$
retagged by

1 Answer

Related questions

0 votes
0 votes
1 answer
1
Farisha Begum asked Sep 21, 2018
577 views
A fair coin is tossed repeatedly until both head and tail appears atleast once. The average number of tosses
2 votes
2 votes
0 answers
3
Aboveallplayer asked Nov 2, 2016
480 views
Let a,b,c,d are 4 consecutive numbers of Fibonacci series. Prove or dis-approve ad-bc= ±1 Now my question is can we prove it by induction?