We are given two sets of sentences, $\Sigma_1$ and $\Sigma_2$, such that no model can satisfy both sets simultaneously. We need to find a sentence $\tau$ such that all models of $\Sigma_1$ are models of $\tau$, and all models of $\Sigma_2$ are models of $\neg
Show more…