Since is finitely valid iff is not finitely satisfiable, we conclude that the set of sentences which are not finitely satisfiable is recursively enumerable.
Attempting to prove a satisfiable first-order formula as unsatisfiable may result in a nonterminating computation; this problem doesn't occur in propositional logic.