Computable Set Theory: Volume 1

This volume describes computational techniques for deciding formulae in set theory. It includes information on a series of investigations in elementary set theory, aiming to automate simple proofs over a wide range of mathematical areas. Full coverage of such fundamentals as classes and orderings, the validity problem, elementary syllogistics, and restricted quantifiers is provided, as well as more advanced material on the powerset operator, MAP constructs, the unionset operator, and the choice operator.