Let fsa and $$pda$$ be two predicates such that fsa$$(x)$$ means $$x$$ is a finite state automation, and pda$$(y)$$ means that $$y$$ is a pushdown automation. Let $$equivalent$$ be another predicate such that $$equivalent$$$$(a,b)$$ means $$a$$ and $$b$$ are equivalent. Which of the following first order logic statements represents the following:

Each finite state automation has an equivalent pushdown automation.

Which one of these first-order logic formulae is valid?

Consider the following first order logic formula in which $$R$$ is a binary relation symbol.
$$\forall x\forall y\left( {R\left( {x,\,y} \right) \Rightarrow R\left( {y,x} \right)} \right).$$

The formula is

Consider the following propositional statements:

$${\rm P}1:\,\,\left( {\left( {A \wedge B} \right) \to C} \right) \equiv \left( {\left( {A \to C} \right) \wedge \left( {B \to C} \right)} \right)$$
$${\rm P}2:\,\,\left( {\left( {A \vee B} \right) \to C} \right) \equiv \left( {\left( {A \to C} \right) \vee \left( {B \to C} \right)} \right)$$ Which one of the following is true?