Back to Search

Proven Impossible: Elementary Proofs of Profound Impossibility from Arrow, Bell, Chaitin, Gödel, Turing and More

AUTHOR Gusfield, Dan
PUBLISHER Cambridge University Press (01/18/2024)
PRODUCT TYPE Paperback (Paperback)

Description
In mathematics, it simply is not true that 'you can't prove a negative'. Many revolutionary impossibility theorems reveal profound properties of logic, computation, fairness and the universe, and form the mathematical background of new technologies and Nobel prizes. But to fully appreciate these theorems and their impact on mathematics and beyond, you must understand their proofs. This book is the first to present these proofs for a broad, lay audience. It fully develops the simplest rigorous proofs found in the literature, reworked to contain less jargon and notation, and more background, intuition, examples, explanations, and exercises. Amazingly, all of the proofs in this book involve only arithmetic and basic logic - and are elementary, starting only from first principles and definitions. Very little background knowledge is required, and no specialized mathematical training - all you need is the discipline to follow logical arguments and a pen in your hand.
Show More
Product Format
Product Details
ISBN-13: 9781009349499
ISBN-10: 100934949X
Binding: Paperback or Softback (Trade Paperback (Us))
Content Language: English
More Product Details
Page Count: 270
Carton Quantity: 26
Product Dimensions: 6.00 x 0.61 x 9.00 inches
Weight: 0.88 pound(s)
Feature Codes: Bibliography, Index, Illustrated
Country of Origin: US
Subject Information
BISAC Categories
Mathematics | Logic
Dewey Decimal: 511.36
Library of Congress Control Number: 2023027705
Descriptions, Reviews, Etc.
publisher marketing
In mathematics, it simply is not true that 'you can't prove a negative'. Many revolutionary impossibility theorems reveal profound properties of logic, computation, fairness and the universe, and form the mathematical background of new technologies and Nobel prizes. But to fully appreciate these theorems and their impact on mathematics and beyond, you must understand their proofs. This book is the first to present these proofs for a broad, lay audience. It fully develops the simplest rigorous proofs found in the literature, reworked to contain less jargon and notation, and more background, intuition, examples, explanations, and exercises. Amazingly, all of the proofs in this book involve only arithmetic and basic logic - and are elementary, starting only from first principles and definitions. Very little background knowledge is required, and no specialized mathematical training - all you need is the discipline to follow logical arguments and a pen in your hand.
Show More

Author: Gusfield, Dan
Dan Gusfield is Professor of Computer Science at the University of California, Davis. He is the coauthor of "The Stable Marriage Problem: Structure and Algorithms" (MIT Press) and author of "Algorithms on Strings, Trees, and Sequences".
Show More
List Price $34.99
Your Price  $34.64
Paperback