Deutsch English Français Italiano |
<33512b63716ac263c16b7d64cd1d77578c8aea9d@i2pn2.org> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!weretis.net!feeder9.news.weretis.net!i2pn.org!i2pn2.org!.POSTED!not-for-mail From: Richard Damon <richard@damon-family.org> Newsgroups: sci.logic Subject: Re: Incompleteness of Cantor's enumeration of the rational numbers (extra-ordinary) Date: Tue, 10 Dec 2024 07:19:05 -0500 Organization: i2pn2 (i2pn.org) Message-ID: <33512b63716ac263c16b7d64cd1d77578c8aea9d@i2pn2.org> References: <vg7cp8$9jka$1@dont-email.me> <476ae6cb-1116-44b1-843e-4be90d594372@att.net> <vhhr6f$1q0r9$1@dont-email.me> <ffa63cb5-8898-4aa7-80eb-8b2c51c9986d@att.net> <vhkhun$28qt$1@dont-email.me> <vhmtph$j1ek$1@dont-email.me> <vhn1jk$jf6v$1@dont-email.me> <vhn3po$jvo1$1@dont-email.me> <vhn420$jf6v$3@dont-email.me> <vhpg51$13soc$1@dont-email.me> <vhpnrb$15239$1@dont-email.me> <vhs2gn$1kjtc$1@dont-email.me> <vhs4ue$1ku9t$1@dont-email.me> <vhv6or$280s6$1@dont-email.me> <vhvbjb$28n6o$1@dont-email.me> <vi1dbj$2moon$1@dont-email.me> <vi224l$2pgrd$1@dont-email.me> <vi4383$3csd4$2@dont-email.me> <vi4a6c$3dt4s$2@dont-email.me> <vi6p1l$3uoti$1@dont-email.me> <vi6unr$3v0dn$5@dont-email.me> <vihd3l$2d9fk$1@dont-email.me> <vihfai$2cnof$1@dont-email.me> <vijrru$37ce1$1@dont-email.me> <vikh9k$3cua3$1@dont-email.me> <viml28$6j3$1@dont-email.me> <0b1bb1a1-40e3-464f-9e3d-a5ac22dfdc6f@tha.de> <95183b4d9c2e32651963bac79965313ad2bfe7e8@i2pn2.org> <vj6vhh$elqh$2@dont-email.me> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Tue, 10 Dec 2024 12:19:05 -0000 (UTC) Injection-Info: i2pn2.org; logging-data="2178293"; mail-complaints-to="usenet@i2pn2.org"; posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg"; User-Agent: Mozilla Thunderbird In-Reply-To: <vj6vhh$elqh$2@dont-email.me> Content-Language: en-US X-Spam-Checker-Version: SpamAssassin 4.0.0 Bytes: 2750 Lines: 21 On 12/9/24 9:40 AM, WM wrote: > On 08.12.2024 21:22, joes wrote: >> Am Tue, 03 Dec 2024 12:10:53 +0100 schrieb WM: >>> On 03.12.2024 11:03, Mikko wrote: >>> >>>> I understand mathematics >>> Hardly, though you may have the impression. >>> Proof: You cannot understand that the function f(10n) = n from D = {10n >>> | n ∈ ℕ} to ℕ = {1, 2, 3, ...} is not a bijection because for every >>> initial segment {1, 2, 3, ..., n} of ℕ there are too few numbers of the >>> form 10n that can be paired with numbers n. >> Wow. For every segment there are numbers {10, 20, …, 10n}. > > But for every segments more are needed: {1, 2, 3, ..., 10n} > > Regards, WM > > but {1, 2, 3, ..., 10n} would have its pairing with the set {10, 20, 30, ... 100n} The pairing is between TWO sets, not the members of a set with itself.