Say that the language of the first order logic is the collection of symbols that can be used in the formulas + the grammar (the rules that specify how they can be combined)?
1) However, the signature of the system can include additional symbols to be used in the formula. So, it is wrong to say that a formula can be constructed only from the language of predicate logic, because it needs additional symbols from the signature.
2) When specifying a theory, we need to include a signature that models the domain of the theory? So that the theory will be defined as $\mathfrak{T} = (\Sigma, \Gamma)$, where $\Sigma$ is it's signature and $\Gamma$ the collection of formulas of the signature.
Example. The language of predicate logic includes all the standard symbols: $\forall$, $\land$, .... Say that our signature is the signature for Peano Arithmetic, composed of $\Sigma = \{ \times, +, 0, \dots \}$. A formula $\forall x(x + 0 = x)$, can't be composed only from the language of predicate logic, it need's the signature $\Sigma$ too. And the theory of Peano Airthmetic too will need this signature.