Re: Simple enough for every reader?

Liste des GroupesRevenir à s logic 
Sujet : Re: Simple enough for every reader?
De : ross.a.finlayson (at) *nospam* gmail.com (Ross Finlayson)
Groupes : sci.logic
Date : 18. May 2025, 13:03:04
Autres entêtes
Message-ID : <M8udncTd7J4HUbT1nZ2dnZfqn_qdnZ2d@giganews.com>
References : 1 2
User-Agent : Mozilla/5.0 (X11; Linux x86_64; rv:38.0) Gecko/20100101 Thunderbird/38.6.0
On 05/18/2025 03:30 AM, Mikko wrote:
On 2025-05-17 15:00:33 +0000, WM said:
>
Are you aware of the fact that in
>
{1}
{1, 2}
{1, 2, 3}
...
{1, 2, 3, ..., n}
...
>
up to every n infinitely many natural numbers of the whole set
>
{1, 2, 3, ...}
>
are missing? Infinitely many of them will never be mentioned
individually. They are dark.
>
For example, if we pick 5 for n we have
>
{1}
{1, 2}
{1, 2, 3}
{1, 2, 3, 4}
{1, 2, 3, 4, 5}
>
then 6 and infinitely many other numbers are missing. So numbers
6, and 7 are dark as are ingfinitely many other numbers.
>
If you start with finite ordinals as "sets that don't contain
themselves", then collect them as the "set of all sets that
don't contain themselves", yet not containing itself, then
Russell's paradox says that it would contain itself.
So, it would be extra-ordinary in the sense of Mirimanoff,
and reflect on Skolem's extensions and fragments, and
Cohen's forcing, quite simply.
Infinity, you know, it kind of is "infinity plus one".

Date Sujet#  Auteur
17 May 25 * Simple enough for every reader?33WM
18 May11:30 +* Re: Simple enough for every reader?18Mikko
18 May13:03 i+- Re: Simple enough for every reader?1Ross Finlayson
18 May13:20 i`* Re: Simple enough for every reader?16WM
18 May15:36 i +* Re: Simple enough for every reader?5Ross Finlayson
18 May16:12 i i`* Re: Simple enough for every reader?4WM
19 May14:59 i i `* Re: Simple enough for every reader?3Mikko
19 May19:56 i i  `* Re: Simple enough for every reader?2WM
20 May08:17 i i   `- Re: Simple enough for every reader?1Mikko
19 May14:57 i `* Re: Simple enough for every reader?10Mikko
19 May19:53 i  `* Re: Simple enough for every reader?9WM
20 May08:18 i   `* Re: Simple enough for every reader?8Mikko
20 May12:17 i    `* Re: Simple enough for every reader?7WM
22 May10:10 i     `* Re: Simple enough for every reader?6Mikko
22 May11:30 i      `* Re: Simple enough for every reader?5WM
23 May08:43 i       `* Re: Simple enough for every reader?4Mikko
23 May09:31 i        `* Re: Simple enough for every reader?3WM
24 May09:13 i         `* Re: Simple enough for every reader?2Mikko
24 May12:29 i          `- Re: Simple enough for every reader?1WM
18 May23:41 `* Re: Simple enough for every reader?14Ben Bacarisse
19 May00:12  +* Re: Simple enough for every reader?2olcott
19 May19:46  i`- Re: Simple enough for every reader?1WM
19 May19:44  `* Re: Simple enough for every reader?11WM
20 May01:50   `* Re: Simple enough for every reader?10Ben Bacarisse
20 May08:22    +* Re: Simple enough for every reader?3Mikko
20 May12:15    i+- Re: Simple enough for every reader?1WM
21 May01:51    i`- Re: Simple enough for every reader?1Ben Bacarisse
20 May12:11    `* Re: Simple enough for every reader?6WM
21 May02:17     `* Re: Simple enough for every reader?5Ben Bacarisse
21 May12:02      `* Re: Simple enough for every reader?4WM
23 May14:21       `* Re: Simple enough for every reader?3Ben Bacarisse
24 May09:18        +- Re: Simple enough for every reader?1Mikko
24 May11:50        `- Re: Simple enough for every reader?1WM

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal