Synopsis "handbook of logic and proof techniques for computer science (in English)"
logic plays a central conceptual role in modern mathematics. however, mathematical logic has grown into one of the most recondite areas of mathematics. as a result, most of modern logic is inaccessible to all but the specialist. this new book is a resource that provides a quick introduction and review of the key topics in logic for the computer scientist, engineer, or mathematician. handbook of logic and proof techniques for computer science presents the elements of modern logic, including many current topics, 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 book contains definitions, examples and discussion of all of the key ideas in basic logic, but also makes a special effort to cut through the mathematical formalism, difficult notation, and esoteric terminology that is typical of modern mathematical logic. t this handbook delivers cogent and self-contained introductions to critical advanced topics, including: * godel`s completeness and incompleteness theorems * methods of proof, cardinal and ordinal numbers, the continuum hypothesis, the axiom of choice, model theory, and number systems and their construction * extensive treatment of complexity theory and programming applications * applications to algorithms in boolean algebra * discussion of set theory and applications of logic the book is an excellent resource for the working mathematical scientist. the graduate student or professional in computer science and engineering or the systems scientist who needs to have a quick sketch of a key idea from logic will find it here in this self-contained, accessible, and easy-to-use reference.
