Welcome to the Math Discussions

Funny Math Books


Math Book Categories


Handbook of Logic and Proof Techniques for Computer Science

Handbook of Logic and Proof Techniques for Computer ScienceAuthor: Steven G. Krantz
Publisher: Birkhäuser Boston
Category: Book

List Price: $79.95
Buy New: $53.99
as of 7/31/2010 08:31 MDT details
You Save: $25.96 (32%)



New (10) Used (10) from $45.49

Seller: mkbookloft
Sales Rank: 1868315

Media: Hardcover
Edition: 1
Pages: 300
Number Of Items: 1
Shipping Weight (lbs): 1.2
Dimensions (in): 9.3 x 6.1 x 0.7

ISBN: 081764220X
Dewey Decimal Number: 004
EAN: 9780817642204
ASIN: 081764220X

Publication Date: January 17, 2002
Availability: Usually ships in 1-2 business days

Also Available In:

  • Kindle Edition - Handbook of Logic and Proof Techniques for Computer Science
  • Digital - Handbook of Logic and Proof Techniques for Computer Science
  • Unknown Binding - Handbook of logic and proof techniques for computer science

Similar Items:


Editorial Reviews:

Product Description
An essential resource for a quick introduction and review of the key topics in logic for the computer scientist, engineer, or mathematician! This handbook presents the elements of modern logic to the reader having only basic mathematical literacy. Computer scientists will find specific examples and important ideas such as axiomatics, recursion theory, decidability, independence, completeness, consistency, model theory, and P/NP completeness. The text contains definitions, examples and discussion of all key ideas in basic logic, but it also cuts through mathematical formalism, difficult notation, and esoteric terminology. Graduate students, practitioners and professionals in computer science and engineering, or the systems scientist who needs a quick sketch of a key idea from logic, will find the book self-contained, accessible, and an easy-to-use reference.

CERTAIN CONTENT THAT APPEARS ON THIS SITE COMES FROM AMAZON SERVICES LLC. THIS CONTENT IS PROVIDED ‘AS IS’ AND IS SUBJECT TO CHANGE OR REMOVAL AT ANY TIME.