Computable Set Theory

Domenico Cantone, etc., A. Ferro, E Omodeo (Autoren)

Buch | Hardcover

359 Seiten

1990
Clarendon Press (Verlag)
978-0-19-853807-3 (ISBN)

Infos

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.

Inhalt

Introduction; PART 1: FUNDAMENTALS; Classes and orderings; The validity problem; A partial solution to the finite satisfiability problem; Elementary syllogistics; Multi-level syllogistic; Restricted quantifiers, ordinals and w; PART 2: EXTENDED MULTI-LEVEL SYLLOGISTICS; The powerset operator; MAP constructs; The Unionset operator; The Choice operator

Produkt-Details

• Erscheint lt. Verlag: 1.5.1990
• Reihe/Serie: International Series of Monographs on Computer Science ; 6
• Zusatzinfo: line illustrations, bibliography
• Verlagsort: Oxford
• Sprache: englisch
• Maße: 150 x 230 mm
• Gewicht: 740 g
• Themenwelt: Mathematik / Informatik ► Mathematik ► Logik / Mengenlehre
• ISBN-10: 0-19-853807-3 / 0198538073
• ISBN-13: 978-0-19-853807-3 / 9780198538073
• Zustand: Neuware