State and prove the Completeness Theorem for Propositional Logic.

[You do not need to give definitions of the various terms involved. You may assume that the set of primitive propositions is countable. You may also assume the Deduction Theorem.]

Explain briefly how your proof should be modified if the set of primitive propositions is allowed to be uncountable.