\begin{definition}[Definition:Satisfiable/Set of Formulas]
Let $\LL$ be a logical language.
Let $\mathscr M$ be a formal semantics for $\LL$.
A collection $\FF$ of logical formulas of $\LL$ is '''satisfiable for $\mathscr M$''' {{iff}}:
:There is some $\mathscr M$-model $\MM$ of $\FF$
That is, there exists some structure $\MM$ of $\mathscr M$ such that:
:$\MM \models_{\mathscr M} \FF$
\end{definition}