# Can we prove the completeness of FOL based on forcing?

I asked this question at http://math.stackexchange.com but I didn't get any answer there.

In David Marker's Model Theory, there is a exercise said " we can view a countable Henkin construction as a forcing construction ". But in the book the Henkin construction is used to prove the compactness theorem. He didn't prove the completeness theorem.

So my question is can we use forcing method to prove the completeness of first-order logic?