Set Theory for Computing
Springer-Verlag New York Inc.
978-0-387-95197-3 (ISBN)
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 | |
ISBN-10 | 0-387-95197-0 / 0387951970 |
ISBN-13 | 978-0-387-95197-3 / 9780387951973 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich