- 262 Downloads
As seen in the previous chapter, in the case of S-formulae, classical satisfiability by set assignments is equivalent to satisfiability by partitions (cf. Lemma 2.18). In fact, we can further restrict ourselves to satisfiability by 𝒫 -partitions.
Unable to display preview. Download preview PDF.