Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
| From | wm <wolfgang.mueckenheim@tha.de> |
|---|---|
| Newsgroups | sci.logic |
| Subject | Re: An afterthought about the Binary Tree |
| Date | 2026-05-17 16:15 +0200 |
| Organization | tha |
| Message-ID | <10uciin$nl2$1@solani.org> (permalink) |
| References | (13 earlier) <10u425s$3ubhm$1@dont-email.me> <10u4niq$fcs5$1@dont-email.me> <10u6c7l$e0f$2@dont-email.me> <10u7i7h$cgs9$1@dont-email.me> <10u9e81$sbm8$1@dont-email.me> |
Am 16.05.2026 um 11:43 schrieb Mikko: > On 15/05/2026 19:39, WM wrote: >> But there is no set of nameable numbers. > > You can't prove that. Here ix the proof: >> Always almost all natural numbers are greater than any n resulting >> from induction. > > That's right: for every n there is only finitely many natural numbers > that are smaller than n but infinitely many natural numbers that are > greater than n. And the nameable n are not fixed. The collection is potentially infinite - not a set. Regards, WM
Back to sci.logic | Previous | Next — Previous in thread | Next in thread | Find similar
An afterthought about the Binary Tree WM <wolfgang.mueckenheim@tha.de> - 2026-05-07 22:48 +0200
Re: An afterthought about the Binary Tree Mikko <mikko.levanto@iki.fi> - 2026-05-08 10:58 +0300
Re: An afterthought about the Binary Tree wm <wolfgang.mueckenheim@tha.de> - 2026-05-08 14:46 +0200
Re: An afterthought about the Binary Tree Mikko <mikko.levanto@iki.fi> - 2026-05-09 10:59 +0300
Re: An afterthought about the Binary Tree WM <wolfgang.mueckenheim@tha.de> - 2026-05-09 23:20 +0200
Re: An afterthought about the Binary Tree Mikko <mikko.levanto@iki.fi> - 2026-05-10 10:25 +0300
Re: An afterthought about the Binary Tree WM <wolfgang.mueckenheim@tha.de> - 2026-05-10 15:56 +0200
Re: An afterthought about the Binary Tree Mikko <mikko.levanto@iki.fi> - 2026-05-11 10:51 +0300
Re: An afterthought about the Binary Tree WM <wolfgang.mueckenheim@tha.de> - 2026-05-11 13:42 +0200
Re: An afterthought about the Binary Tree Mikko <mikko.levanto@iki.fi> - 2026-05-12 10:50 +0300
Re: An afterthought about the Binary Tree wm <wolfgang.mueckenheim@tha.de> - 2026-05-12 13:36 +0200
Re: An afterthought about the Binary Tree Mikko <mikko.levanto@iki.fi> - 2026-05-13 12:39 +0300
Re: An afterthought about the Binary Tree wm <wolfgang.mueckenheim@tha.de> - 2026-05-13 22:39 +0200
Re: An afterthought about the Binary Tree Mikko <mikko.levanto@iki.fi> - 2026-05-14 11:46 +0300
Re: An afterthought about the Binary Tree WM <wolfgang.mueckenheim@tha.de> - 2026-05-14 16:52 +0200
Re: An afterthought about the Binary Tree Mikko <mikko.levanto@iki.fi> - 2026-05-15 08:50 +0300
Re: An afterthought about the Binary Tree WM <wolfgang.mueckenheim@tha.de> - 2026-05-15 18:39 +0200
Re: An afterthought about the Binary Tree Mikko <mikko.levanto@iki.fi> - 2026-05-16 12:43 +0300
Re: An afterthought about the Binary Tree wm <wolfgang.mueckenheim@tha.de> - 2026-05-17 16:15 +0200
Re: An afterthought about the Binary Tree Mikko <mikko.levanto@iki.fi> - 2026-05-18 10:42 +0300
Re: An afterthought about the Binary Tree wm <wolfgang.mueckenheim@tha.de> - 2026-05-18 12:22 +0200
Re: An afterthought about the Binary Tree Moebius <invalid@example.invalid> - 2026-05-08 14:57 +0200
Re: An afterthought about the Binary Tree wm <wolfgang.mueckenheim@tha.de> - 2026-05-08 15:16 +0200
Re: An afterthought about the Binary Tree Ross Finlayson <ross.a.finlayson@gmail.com> - 2026-05-08 10:16 -0700
Re: An afterthought about the Binary Tree Ross Finlayson <ross.a.finlayson@gmail.com> - 2026-05-09 11:02 -0700
Re: An afterthought about the Binary Tree Ross Finlayson <ross.a.finlayson@gmail.com> - 2026-05-08 09:58 -0700
Re: An afterthought about the Binary Tree Ross Finlayson <ross.a.finlayson@gmail.com> - 2026-05-08 10:47 -0700
csiph-web