Computable Set Theory

A description of computational techniques for deciding formulae in set theory. Such techniques aim to automate simple proofs over a wide range of mathematical areas. In this book, a successful series of investigations in elementary set theory is reported on.

---

The authors describe computational techniques for deciding formulae in set theory. The eventual aim of such a work is to automate simple proofs over a wide range of mathematical areas. This volume reports on a successful series of investigations in one of the most important sub-domains: elementary set theory. This book is intended for computer scientists; set theorists; logicians.