Introduction to Incompleteness: From Gödel's Theorems to Forcing and the Continuum Hypothesis - Hardcover

Batzoglou, Serafim

Hardcover

ISBN 10: 3031642163 ISBN 13: 9783031642166

Publisher: Birkhäuser, 2024

Synopsis

Incompleteness is a fascinating phenomenon at the intersection of mathematical foundations, computer science, and epistemology that places a limit on what is provable. However, despite its importance, it is often overlooked in the mathematics curricula because it is difficult to teach. This book aims to help bridge this pedagogical gap by providing a complete and accessible technical exposition of incompleteness for a wide audience. The author accomplishes this by making conceptually difficult proofs more approachable by providing intuitive explanations of the main ideas. Care is taken to emphasize the different layers of the mathematical argument – the layer within and the metalayer about an axiomatic system.

Structurally, the book efficiently examines key results and arrives at some of the most interesting concepts as quickly as possible. It begins with Gödel's incompleteness theorems before continuing on to challenging concepts in the arithmetized completeness theorem, the Paris-Harrington theorem, and the independence of the continuum hypothesis. Other topics covered include the Lucas-Penrose arguments, ordinals and cardinals, and axiomatic set theory. Additionally, the author’s coverage of forcing is a notable addition to the existing literature.

Introduction to Incompleteness will be of interest to researchers, students, and instructors looking for a resource to teach this topic. It may also be suitable for self-study. Knowledge of undergraduate-level theoretical mathematics or computer science is required, as well as a familiarity with abstract proofs.

About this title

About the Author

Serafim Batzoglou is a computer scientists and geneticist whose work has focused on the application of algorithms and machine learning to the analysis of large-scale biomolecular data. After completing his PhD in Computer Science at MIT, he joined the Stanford AI Laboratory in 2001 where he was professor of Computer Science until 2016, when he transitioned to research leadership positions in industry. He has authored more than 120 peer-reviewed publications primarily in the field of computational biology. In 2003, he was named among the top young technology innovators by Technology Review magazine. He received the inaugural Innovator Award by the International Society of Computational Biology (ISCB) in 2016, and was named an ISCB Fellow in 2020. Serafim is also co-founder of DNAnexus, a precision health data cloud company.

Serafim has been fascinated by logic since his undergraduate years as a math major at MIT. He noticed the dearth of books that cover the topic of incompleteness in an accessible manner. As an educator for 15 years, he had strived to teach technical concepts clearly for a broad audience of engineers and biologists. With this book, he puts his experience to practice in providing a comprehensive and accessible technical exposition of incompleteness for a wide audience.

From the Back Cover

Incompleteness is a fascinating phenomenon at the intersection of mathematical foundations, computer science, and epistemology that places a limit on what is provable. However, despite its importance, it is often overlooked in the mathematics curricula because it is difficult to teach. This book aims to help bridge this pedagogical gap by providing a complete and accessible technical exposition of incompleteness for a wide audience. The author accomplishes this by making conceptually difficult proofs more approachable by providing intuitive explanations of the main ideas. Care is taken to emphasize the different layers of the mathematical argument – the layer within and the metalayer about an axiomatic system.

Structurally, the book efficiently examines key results and arrives at some of the most interesting concepts as quickly as possible. It begins with Gödel's incompleteness theorems before continuing on to challenging concepts in the arithmetized completeness theorem, the Paris-Harrington theorem, and the independence of the continuum hypothesis. Other topics covered include the Lucas-Penrose arguments, ordinals and cardinals, and axiomatic set theory. Additionally, the author’s coverage of forcing is a notable addition to the existing literature.

Introduction to Incompleteness will be of interest to researchers, students, and instructors looking for a resource to teach this topic. It may also be suitable for self-study. Knowledge of undergraduate-level theoretical mathematics or computer science is required, as well as a familiarity with abstract proofs.

Edition details

• Publisher: Birkhäuser
• Publication date: 2024
• Language: English
• ISBN 10: 3031642163
• ISBN 13: 9783031642166
• Binding: Hardcover
• Number of pages: 313