Set Theory for Computing
From Decision Procedures to Declarative Programming with Sets
Buch in deiner Nähe kaufen
Beschreibung
An up-to-date and comprehensive account of set-oriented symbolic manipulation and automated reasoning methods. This book will be of interest to graduates and researchers in theoretical computer science and computational logic and automated reasoning.
Autor*in
Domenico Cantone
Themen in »Set Theory for Computing«
Automat algorithms artificial intelligence automated deduction computer computer science logic programming sets theorem proving verification
Stimmen zu »Set Theory for Computing«
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)
()