(en.wikipedia.org) Cantor's diagonal argument - Wikipedia

ROAM_REFS: https://en.wikipedia.org/wiki/Cantor's_diagonal_argument

Cantor's diagonal argument (among various similar names) is a mathematical proof that there are infinite sets which cannot be put into one-to-one correspondence with the infinite set of natural numbers – informally, that there are sets which in some sense contain more elements than there are positive integers. Such sets are now called uncountable sets, and the size of infinite sets is treated by the theory of cardinal numbers, which Cantor began.

Georg Cantor published this proof in 1891, but it was not his first proof of the uncountability of the real numbers, which appeared in 1874. However, it demonstrates a general technique that has since been used in a wide range of proofs, including the first of Gödel's incompleteness theorems and Turing's answer to the Entscheidungsproblem. Diagonalization arguments are often also the source of contradictions like Russell's paradox and Richard's paradox.

Local Graph

org-roam 2a07e4ea-610b-4c9a-bb84-d961fb2450e5 Code and Coffee Book Club 24a8571b-941b-46de-9db1-bd5756dcc62f (en.wikipedia.org) Cantor's diagonal ... 2a07e4ea-610b-4c9a-bb84-d961fb2450e5->24a8571b-941b-46de-9db1-bd5756dcc62f //en.wikipedia.org/wiki/Mathematical_proof https://en.wikipedia.org/wiki/Mathematical_proof 24a8571b-941b-46de-9db1-bd5756dcc62f->//en.wikipedia.org/wiki/Mathematical_proof //en.wikipedia.org/wiki/Infinite_set https://en.wikipedia.org/wiki/Infinite_set 24a8571b-941b-46de-9db1-bd5756dcc62f->//en.wikipedia.org/wiki/Infinite_set //en.wikipedia.org/wiki/Bijection https://en.wikipedia.org/wiki/Bijection 24a8571b-941b-46de-9db1-bd5756dcc62f->//en.wikipedia.org/wiki/Bijection //en.wikipedia.org/wiki/Natural_number https://en.wikipedia.org/wiki/Natural_number 24a8571b-941b-46de-9db1-bd5756dcc62f->//en.wikipedia.org/wiki/Natural_number //en.wikipedia.org/wiki/Set_(mathematics) https://en.wikipedia.org/wiki/Set_(mathematics) 24a8571b-941b-46de-9db1-bd5756dcc62f->//en.wikipedia.org/wiki/Set_(mathematics) //en.wikipedia.org/wiki/Uncountable_set https://en.wikipedia.org/wiki/Uncountable_set 24a8571b-941b-46de-9db1-bd5756dcc62f->//en.wikipedia.org/wiki/Uncountable_set //en.wikipedia.org/wiki/Cardinal_number https://en.wikipedia.org/wiki/Cardinal_number 24a8571b-941b-46de-9db1-bd5756dcc62f->//en.wikipedia.org/wiki/Cardinal_number //en.wikipedia.org/wiki/Georg_Cantor https://en.wikipedia.org/wiki/Georg_Cantor 24a8571b-941b-46de-9db1-bd5756dcc62f->//en.wikipedia.org/wiki/Georg_Cantor //en.wikipedia.org/wiki/Cantor's_first_uncountability_proof //en.wikipedia.org/wiki/Cantor's_first_uncountability_proof 24a8571b-941b-46de-9db1-bd5756dcc62f->//en.wikipedia.org/wiki/Cantor's_first_uncountability_proof //en.wikipedia.org/wiki/Real_number https://en.wikipedia.org/wiki/Real_number 24a8571b-941b-46de-9db1-bd5756dcc62f->//en.wikipedia.org/wiki/Real_number //en.wikipedia.org/wiki/Gödel's_incompleteness_theorems //en.wikipedia.org/wiki/Gödel's_incompleteness_theorems 24a8571b-941b-46de-9db1-bd5756dcc62f->//en.wikipedia.org/wiki/Gödel's_incompleteness_theorems //en.wikipedia.org/wiki/Entscheidungsproblem https://en.wikipedia.org/wiki/Entscheidungsproblem 24a8571b-941b-46de-9db1-bd5756dcc62f->//en.wikipedia.org/wiki/Entscheidungsproblem //en.wikipedia.org/wiki/Russell's_paradox //en.wikipedia.org/wiki/Russell's_paradox 24a8571b-941b-46de-9db1-bd5756dcc62f->//en.wikipedia.org/wiki/Russell's_paradox //en.wikipedia.org/wiki/Richard's_paradox //en.wikipedia.org/wiki/Richard's_paradox 24a8571b-941b-46de-9db1-bd5756dcc62f->//en.wikipedia.org/wiki/Richard's_paradox //en.wikipedia.org/wiki/Cantor's_first_uncountability_proof https://en.wikipedia.org/wiki/Cantor's_first_uncountability_proof //en.wikipedia.org/wiki/Gödel's_incompleteness_theorems https://en.wikipedia.org/wiki/Gödel's_incompleteness_theorems //en.wikipedia.org/wiki/Russell's_paradox https://en.wikipedia.org/wiki/Russell's_paradox //en.wikipedia.org/wiki/Richard's_paradox https://en.wikipedia.org/wiki/Richard's_paradox