In First Order Logic, is it possible to have a variable for two predicates in which the domains of those predicates are different?
For example, we know that the domain of $P$ is natural number
and the domain of $Q$ is integer
, is it possible to have a formula like $\forall x P(x) \land Q(x)$ or $\exists x P(x) \land Q(x)$