 A sentence \(\theta\) is satisfiable if there is an interpretation \(M\) such that \(M\vDash \theta\). That is, \(\theta\) is satisfiable if there is an interpretation that satisfies it. A set \(\Gamma\) of sentences is satisfiable if there is an interpretation \(M\) such that \(M\vDash\theta\), for every sentence \(\theta\) in \(\Gamma\). If \(\Gamma\) is a set of sentences and if \(M\vDash \theta\) for each sentence \(\theta\) in \(\Gamma\), then we say that \(M\) is a model of \(\Gamma\). So a set of sentences is satisfiable if it has a model. Satisfiability is the model-theoretic counterpart to consistency.