Handbook of Logic in Computer Science: Volume 5: Logic and Algebraic Methods

Handbook of Logic in Computer Science: Volume 5: Logic and Algebraic Methods

by Samson Abramsky, Dov. M. Gabbay, T. S. E. Maibaum
     
 


Logic is now widely recognized as one of the foundational disciplines of computing, and its applications reach almost every aspect of the subject, from software engineering and hardware to programming languages and AI. The Handbook of Logic in Computer Science is a multi-volume work covering all the major areas of application of logic to theoretical computer… See more details below

Overview


Logic is now widely recognized as one of the foundational disciplines of computing, and its applications reach almost every aspect of the subject, from software engineering and hardware to programming languages and AI. The Handbook of Logic in Computer Science is a multi-volume work covering all the major areas of application of logic to theoretical computer science. The handbook comprises six volumes, each containing five or six chapters giving an in-depth overview of one of the major topics in field. It is the result of many years of cooperative effort by some of the most eminent frontline researchers in the field, and will no doubt be the standard reference work in logic and theoretical computer science for years to come. Volume 5: Algebraic and Logical Structures covers all the fundamental topics of semantics in logic and computation. The extensive chapters are the result of several years of coordinated research, and each have thematic perspective. Together, they offer the reader the latest in research work, and the book will be indispensable

Read More

Editorial Reviews

Booknews
Now that the first two volumes have presented the background on fundamental mathematical structures, and the second two have drawn those threads together, mathematicians and computer scientists from Europe and North America here continue with logic and algebraic methodologies basic to computer science. In five chapters, they cover the Martin-L<:o>f type theory, categorical logic, a uniform method for proving lower bounds on the computational complexity of logical theories, the algebraic specification of abstract data types, and computable functions and semicomputable sets on many-sorted algebras. The series, now 15 years in production, seems to end with a sixth volume on logical methods in computer science. Annotation c. Book News, Inc., Portland, OR (booknews.com)

Product Details

ISBN-13:
9780198537816
Publisher:
OUP Oxford
Publication date:
01/28/2001
Pages:
560
Product dimensions:
6.20(w) x 9.40(h) x 1.50(d)

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >