Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
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.
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.
Similar content being viewed by others
Keywords
Table of contents (14 chapters)
-
Front Matter
-
Introduction
-
Front Matter
-
-
Basics for Set-Theoretic Reasoning
-
Front Matter
-
-
Decision Methods
-
Front Matter
-
-
Set-Specific Inference Engines
-
Front Matter
-
-
Back Matter
Reviews
From the reviews:
"The book is an up-to-date and well-organized collection of techniques and results concerning the problem of dealing with sets in computer science. … In particular, the book can be very interesting for postgraduate students and researchers in computer science and logic. … The book is largely self-contained and the style of presentation is extremely rigorous and accurate. ... this will become a sort of classic work for automated deduction and declarative programming and surely it deserves to find a place in all scientific libraries." (A. Dovier, Theory and Practise of Logic Programming, Vol. 3 (1), 2003)
"Set theory has played the role of a lingua franca for modern mathematics. The authors of this monograph intend to extend this service to computer science, artificial intelligence, and computational mathematics. … Several variants of ZF, which are meant for different applications, are surveyed and concrete, computable models are investigated. … There is an extensive list of references, an index of symbols and an index of terms." (J.M. Plotkin, Zentralblatt MATH, Vol. 981, 2002)
Authors and Affiliations
Bibliographic Information
Book Title: Set Theory for Computing
Book Subtitle: From Decision Procedures to Declarative Programming with Sets
Authors: Domenico Cantone, Eugenio Omodeo, Alberto Policriti
Series Title: Monographs in Computer Science
DOI: https://doi.org/10.1007/978-1-4757-3452-2
Publisher: Springer New York, NY
-
eBook Packages: Springer Book Archive
Copyright Information: Springer Science+Business Media New York 2001
Hardcover ISBN: 978-0-387-95197-3Published: 26 June 2001
Softcover ISBN: 978-1-4419-2905-1Published: 21 September 2011
eBook ISBN: 978-1-4757-3452-2Published: 29 June 2013
Series ISSN: 0172-603X
Series E-ISSN: 2512-5486
Edition Number: 1
Number of Pages: XVIII, 409
Number of Illustrations: 1 b/w illustrations
Topics: Theory of Computation, Programming Languages, Compilers, Interpreters, Mathematics of Computing, Mathematical Logic and Formal Languages