Inexhaustibility

Inexhaustibility

a non-exhaustive treatment

by Torkel Franzén

251 pages· 2004· ISBN 9781568811741

Browse books you can read free on Readfeed

No club is reading this yet — be the first to start one

Start a club free
About
Gödel's Incompleteness Theorems are among the most significant results in the foundation of mathematics. These results have a positive consequence: any system of axioms for mathematics that we recognize as correct can be properly extended by adding as a new axiom a formal statement expressing that the original system is consistent. This suggests that our mathematical knowledge is inexhaustible, an essentially philosophical topic to which this book is devoted. Basic material in predicate logic, set theory and recursion theory is presented, leading to a proof of incompleteness theorems. The inexhaustibility of mathematical knowledge is treated based on the concept of transfinite progressions of theories as conceived by Turing and Feferman. All concepts and results necessary to understand the arguments are introduced as needed, making the presentation self-contained and thorough.

Discuss Inexhaustibility with other readers

Join or start a book club for Inexhaustibility on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Frequently asked questions

How do I join a book club for Inexhaustibility?

Sign up free on Readfeed, then browse public clubs or start your own club with Inexhaustibility as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss Inexhaustibility with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Inexhaustibility with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.