Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Set Theory for Computing - Domenico Cantone, Eugenio Omodeo, Alberto Policriti

Set Theory for Computing

From Decision Procedures to Declarative Programming with Sets
Buch | Softcover
409 Seiten
2011 | Softcover reprint of the original 1st ed. 2001
Springer-Verlag New York Inc.
978-1-4419-2905-1 (ISBN)
CHF 224,65 inkl. MwSt
  • Versand in 10-15 Tagen
  • Versandkostenfrei
  • Auch auf Rechnung
  • Artikel merken
Set Theory for Computing offers an up-to-date and comprehensive account of set-oriented symbolic manipulation and automated reasoning methods. Mastering today's variety of systems with crisp, formal tools is a prerequisite for a high degree of control over sets and aggregates. The many algorithmic methods and deductive techniques in this book offer readers a clear view of the use of set-theoretic notions in such critical areas as specification of problems, data types, and solution methods; algorithmic program verification; and automated deduction.
The rigorous and largely self-contained style of presentation addresses readers wanting to complement their set intuition with the ability to exploit it in specification and verification and master it by symbolic, logically based techniques and methods. This book will be of interest to graduates and researchers in theoretical computer science and computational logic and automated reasoning.

1 What Is Computable Set Theory?.- 2 Logical Background.- 3 Axiomatic Views of Aggregates.- 4 Semantic Views of Aggregates.- 5 Sets for Problem Solving.- 6 Decision Problems and Some Solutions.- 7 Inference Techniques and Methods.- 8 Set/Hyperset Unification Algorithms.- 9 (*) A Syllogistic Solitaire.- 10 Stratified Syllogistics.- 11 Quantitative Set Reasoning.- 12 Set Theory for Nonclassic Logics.- 13 Logic Programming with Sets.- 14 Syllogistic Tableaux.- References.- Tables and Index of Symbols.- Association and priority rules.- Truth tables.- Common abbreviations in first-order languages.- Substitution-related notation.- Map-related notation.- Function-related notation.- Basic laws on sets.- Abbreviations in mathematical English.- Index of Terms.

Reihe/Serie Monographs in Computer Science
Vorwort J.T. Schwartz
Zusatzinfo 1 Illustrations, black and white; XVIII, 409 p. 1 illus.
Verlagsort New York, NY
Sprache englisch
Maße 155 x 235 mm
Themenwelt Mathematik / Informatik Informatik Programmiersprachen / -werkzeuge
Informatik Theorie / Studium Compilerbau
Mathematik / Informatik Mathematik Angewandte Mathematik
ISBN-10 1-4419-2905-3 / 1441929053
ISBN-13 978-1-4419-2905-1 / 9781441929051
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Grundlagen und Anwendungen

von Hanspeter Mössenböck

Buch | Softcover (2024)
dpunkt (Verlag)
CHF 41,85
a beginner's guide to learning llvm compiler tools and core …

von Kai Nacke

Buch | Softcover (2024)
Packt Publishing Limited (Verlag)
CHF 69,80