Price loading...

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

Mathematical Logic

Price data last checked 107 day(s) ago - refreshing...

View at Amazon

Price History & Forecast

No Price Data Available

Price history will appear here once data is collected from Amazon.

Price Distribution

No price data available for histogram

Description

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.

Product Specifications

Format: hardcover
ASIN: 3031642163
Category: Books > Subjects > Science, Nature & Maths > Mathematics > Mathematical Foundations > Mathematical Logic
Domain: Amazon UK
Release Date: 31 August 2024
Listed Since: 23 May 2024

Barcode

No barcode data available

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

Price History & Forecast

No Price Data Available

Price Distribution

Description

Product Specifications

Barcode

Similar Products You Might Like

Gödel's Theorems and Zermelo's Axioms: A Firm Foundation of Mathematics

Gödel's Theorems and Zermelo's Axioms: A Firm Foundation of Mathematics

Gödel's Incompleteness Theorems: A Guided Tour Through Kurt Gödel’s Historic Proof

Mathematical Logic: An Introduction (De Gruyter Textbook)

Inexhaustibility: A Non-Exhaustive Treatment: Lecture Notes in Logic 16

Logic of Mathematics: A Modern Course of Classical Logic: 22 (Pure and Applied Mathematics: A Wiley Series of Texts, Monographs and Tracts)

Kurt Gödel: The Princeton Lectures on Intuitionism (Sources and Studies in the History of Mathematics and Physical Sciences)

Kurt Gödel: The Princeton Lectures on Intuitionism (Sources and Studies in the History of Mathematics and Physical Sciences)

Intuitive Axiomatic Set Theory (Textbooks in Mathematics)

Mathematical Logic through Python

Set Theory: With an Introduction to Real Point Sets

Godel's Way: Exploits into an undecidable world

Computability Theory: An Introduction to Recursion Theory

Can Mathematics Be Proved Consistent?: Gödel's Shorthand Notes & Lectures on Incompleteness (Sources and Studies in the History of Mathematics and Physical Sciences)

Goedel's Way: Exploits into an undecidable world

Introduction to Mathematical Logic: Extended Edition

The Forcing Method in Set Theory: An Introduction via Boolean Valued Logic: 168 (UNITEXT, 168)

The Incompleteness Phenomenon: A New Course in Mathematical Logic

Computability

Models of Peano Arithmetic: 15 (Oxford Logic Guides)

Mathematical Logic: 291 (Graduate Texts in Mathematics, 291)

Logic for Mathematicians

Computability: An Introduction to Recursive Function Theory

Theory of Computation