Set Theory for Computing
From Decision Procedures to Declarative Programming with Sets
Authors: Cantone, Domenico, Omodeo, Eugenio, Policriti, Alberto
Free PreviewBuy this book
- 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. - 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)
- Table of contents (14 chapters)
-
-
What Is Computable Set Theory?
Pages 3-13
-
Logical Background
Pages 14-58
-
Axiomatic Views of Aggregates
Pages 61-86
-
Semantic Views of Aggregates
Pages 87-111
-
Sets for Problem Solving
Pages 112-147
-
Table of contents (14 chapters)
Recommended for you
Bibliographic Information
- 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
- Copyright
- 2001
- Publisher
- Springer-Verlag New York
- Copyright Holder
- Springer Science+Business Media New York
- eBook ISBN
- 978-1-4757-3452-2
- DOI
- 10.1007/978-1-4757-3452-2
- Hardcover ISBN
- 978-0-387-95197-3
- Softcover ISBN
- 978-1-4419-2905-1
- Series ISSN
- 0172-603X
- Edition Number
- 1
- Number of Pages
- XVIII, 409
- Number of Illustrations
- 1 b/w illustrations
- Topics
*immediately available upon purchase as print book shipments may be delayed due to the COVID-19 crisis. ebook access is temporary and does not include ownership of the ebook. Only valid for books with an ebook version. Springer Reference Works are not included.
