The Decision Problem in Set Theory
In connection with the decision problem in set theory, we are interested in specific collections of quantifier-free formulae, referred to as FRAGMENTS or THEORIES throughout the book. These involve various combinations of set-theoretic operators and predicates. In particular, the elementary Boolean set-theoretic operators of binary union ∪, binary intersection ∩, and set difference \, as well as the predicate symbols of equality =, set inclusion ⊆, and membership ∈, will almost always be present.
Unable to display preview. Download preview PDF.