Consider the first order predicate formula φ:

∀x[(∀z z|x ⇒ ((z = x) ∨ (z = 1))) ⇒ ∃w (w > x) ∧ (∀z z|w ⇒ ((w = z) ∨ (z = 1)))]

Here 'a|b' denotes that 'a divides b', where a and b are integers.

Consider the following sets:

S1. {1, 2, 3, ..., 100}
S2. Set of all positive integers
S3. Set of all integers

Which of the above sets satisfy φ?

Let N be the set of natural numbers. Consider the following sets.

$$\,\,\,\,\,\,\,\,$$ $$P:$$ Set of Rational numbers (positive and negative)
$$\,\,\,\,\,\,\,\,$$ $$Q:$$ Set of functions from $$\left\{ {0,1} \right\}$$ to $$N$$
$$\,\,\,\,\,\,\,\,$$ $$R:$$ Set of functions from $$N$$ to $$\left\{ {0,1} \right\}$$
$$\,\,\,\,\,\,\,\,$$ $$S:$$ Set of finite subsets of $$N.$$

Which of the sets above are countable?

A function $$f:\,\,{N^ + } \to {N^ + },$$ defined on the set of positive integers $${N^ + },$$ satisfies the following properties: $$$\eqalign{ & f\left( n \right) = f\left( {n/2} \right)\,\,\,\,if\,\,\,\,n\,\,\,\,is\,\,\,\,even \cr & f\left( n \right) = f\left( {n + 5} \right)\,\,\,\,if\,\,\,\,n\,\,\,\,is\,\,\,\,odd \cr} $$$

Let $$R = \left\{ i \right.|\exists j:f\left( j \right) = \left. i \right\}$$ be the set of distinct values that $$f$$ takes. The maximum possible size of $$R$$ is _____________________.

A binary relation $$R$$ on $$N \times N$$ is defined as follows: $$(a,b)R(c,d)$$ if $$a \le c$$ or $$b \le d.$$ Consider the following propositions:

$$P:$$ $$R$$ is reflexive
$$Q:$$ $$R$$ is transitive

Which one of the following statements is TRUE?