![](http://assets.cambridge.org/97810093/49505/cover/9781009349505.jpg)
Book contents
- Frontmatter
- Dedication
- Contents
- Preface
- Acknowledgments
- 1 Yes You Can Prove a Negative!
- 2 Bell’s Impossibility Theorem(s)
- 3 Enjoying Bell Magic: With Inequalities and Without
- 4 Arrow’s (and Friends’) Impossibility Theorems
- 5 Clustering and Impossibility
- 6 A Gödel-ish Impossibility and Incompleteness Theorem
- 7 Turing Undecidability and Incompleteness
- 8 Even More Devastating: Chaitin’s Incompleteness Theorem
- 9 Gödel (For Real, This Time)
- Appendix Computer Programs Are Text
- Bibliography
- Index
Contents
Published online by Cambridge University Press: 18 February 2024
- Frontmatter
- Dedication
- Contents
- Preface
- Acknowledgments
- 1 Yes You Can Prove a Negative!
- 2 Bell’s Impossibility Theorem(s)
- 3 Enjoying Bell Magic: With Inequalities and Without
- 4 Arrow’s (and Friends’) Impossibility Theorems
- 5 Clustering and Impossibility
- 6 A Gödel-ish Impossibility and Incompleteness Theorem
- 7 Turing Undecidability and Incompleteness
- 8 Even More Devastating: Chaitin’s Incompleteness Theorem
- 9 Gödel (For Real, This Time)
- Appendix Computer Programs Are Text
- Bibliography
- Index
Summary
![Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'](https://static.cambridge.org/content/id/urn%3Acambridge.org%3Aid%3Abook%3A9781009349451/resource/name/firstPage-pdf-9781009349505toc1_vii-xii.jpg)
- Type
- Chapter
- Information
- Proven ImpossibleElementary Proofs of Profound Impossibility from Arrow, Bell, Chaitin, Gödel, Turing and More, pp. vii - xiiPublisher: Cambridge University PressPrint publication year: 2024