Picture 1 of 10
Gallery
Picture 1 of 10
Monographs in Computer Science Ser.: Set Theory for Computing : From Decision...
US $57.50
ApproximatelyRM 243.78
or Best Offer
Was US $229.99 (75% off)
Condition:
Good
A book that has been read but is in good condition. Very minimal damage to the cover including scuff marks, but no holes or tears. The dust jacket for hard covers may not be included. Binding has minimal wear. The majority of pages are undamaged with minimal creasing or tearing, minimal pencil underlining of text, no highlighting of text, no writing in margins. No missing pages.
Sale ends in: 2d 10h
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Shipping:
US $5.38 (approx RM 22.81) USPS Media MailTM.
Located in: Thomaston, Georgia, United States
Delivery:
Estimated between Mon, 12 May and Fri, 16 May to 43230
Returns:
30 days return. Seller pays for return shipping.
Coverage:
Read item description or contact seller for details. See all detailsSee all details on coverage
(Not eligible for eBay purchase protection programmes)
Seller assumes all responsibility for this listing.
eBay item number:365390441655
Item specifics
- Condition
- Features
- Ex-Library
- ISBN
- 9780387951973
About this product
Product Identifiers
Publisher
Springer New York
ISBN-10
0387951970
ISBN-13
9780387951973
eBay Product ID (ePID)
1897836
Product Key Features
Number of Pages
Xviii, 409 Pages
Publication Name
Set Theory for Computing : from Decision Procedures to Declarative Programming with Sets
Language
English
Subject
Computer Science, Logic, Set Theory, Applied, Compilers
Publication Year
2001
Type
Textbook
Subject Area
Mathematics, Computers
Series
Monographs in Computer Science Ser.
Format
Hardcover
Dimensions
Item Weight
30 Oz
Item Length
9.3 in
Item Width
6.1 in
Additional Product Features
Intended Audience
Scholarly & Professional
LCCN
2001-020446
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. 'e¦ In particular, the book can be very interesting for postgraduate students and researchers in computer science and logic. 'e¦ 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. 'e¦ Several variants of ZF, which are meant for different applications, are surveyed and concrete, computable models are investigated. 'e¦ There is an extensive list of references, an index of symbols and an index of terms." (J.M. Plotkin, Zentralblatt MATH, Vol. 981, 2002), 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), 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), 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), 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. a? In particular, the book can be very interesting for postgraduate students and researchers in computer science and logic. a? 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. a? Several variants of ZF, which are meant for different applications, are surveyed and concrete, computable models are investigated. a? There is an extensive list of references, an index of symbols and an index of terms." (J.M. Plotkin, Zentralblatt MATH, Vol. 981, 2002)
Dewey Edition
22
Number of Volumes
1 vol.
Illustrated
Yes
Dewey Decimal
511.322
Table Of Content
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.
Synopsis
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., "Set Theory for Computing" provides a comprehensive account of set-oriented symbolic manipulation methods suitable for automated reasoning. Its main objective is twofold: 1) to provide a flexible formalization for a variety of set languages, and 2) to clarify the semantics of set constructs firmly established in modern specification languages and in the programming practice. Topics include: semantic unification, decision algorithms, modal logics, declarative programming, tableau-based proof techniques, and theory-based theorem proving. The style of presentation is self-contained, rigorous and accurate. Some familiarity with symbolic logic is helpful but not a requirement. This book is a useful resource for all advanced students, professionals, and researchers in computing sciences, artificial intelligence, automated reasoning, logic, and computational mathematics. It will serve to complement their intuitive understanding of set concepts with the ability to master them by symbolic and logically based algorithmic methods and deductive techniques., An up-to-date and comprehensive account of set-oriented symbolic manipulation and automated reasoning methods. This book is of interest to graduates and researchers in theoretical computer science and computational logic and automated reasoning., "Set Theory for Computing" provides a comprehensive account of set-oriented symbolic manipulation methods suitable for automated reasoning. Its main objective is twofold: 1) to provide a flexible formalization for a variety of set languages, and 2) to clarify the semantics of set constructs firmly established in modern specification languages and in the programming practice.Topics include: semantic unification, decision algorithms, modal logics, declarative programming, tableau-based proof techniques, and theory-based theorem proving. The style of presentation is self-contained, rigorous and accurate. Some familiarity with symbolic logic is helpful but not a requirement.This book is a useful resource for all advanced students, professionals, and researchers in computing sciences, artificial intelligence, automated reasoning, logic, and computational mathematics. It will serve to complement their intuitive understanding of set concepts with the ability to master them by symbolic and logically based algorithmic methods and deductive techniques., 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.
LC Classification Number
QA75.5-76.95
Item description from the seller
Seller feedback (8,632)
- p***c (1729)- Feedback left by buyer.Past monthVerified purchaseExcellent book from a great bookseller!
- 9***0 (33)- Feedback left by buyer.Past monthVerified purchaseSeller was extremely friendly and answered all questions very quickly. The books all arrived safe and sound. A+ seller highly recommended them
- o***t (156)- Feedback left by buyer.Past monthVerified purchasePerfectly as described, safely packaged, on time and good value. Thank you!
More to explore :
- Computer Science Textbooks,
- Computer Science Hardcover Textbooks,
- Computer Science Textbooks in English,
- Computer Science Paperback Textbooks,
- Computer Science 2010-Now Publication Year Textbooks,
- Computers Magazines,
- Photography: Monographs Antiquarian & Collectible Books,
- Science Magazines,
- Science Audiobooks,
- Computers Subscriptionless Magazines