Find $K\subseteq \operatorname{Ass} $ and $ K'\subseteq K$ such that $K$ is definable but $K'$ is not.
Definition (Definable): a set $K$ of assignments is definable if there is a set of formulas A such that $\operatorname{Ass}(A) = K$.
Find $K\subseteq \operatorname{Ass} $ and $ K'\subseteq K$ such that $K$ is definable but $K'$ is not.
Definition (Definable): a set $K$ of assignments is definable if there is a set of formulas A such that $\operatorname{Ass}(A) = K$.
Hint: $K=\mathit{Ass}$ is definable, so all you need to do is find some non-definable set of assignments.
You need to involve infinitely many propositional variable, because every truth functional of finitely many variables can be defined by a single formula.
How about the set of all possible assignments except the one that makes every propositional variable false?