Groups | Search | Server Info | Keyboard shortcuts | Login | Register
| From | Jim Burns <james.g.burns@att.net> |
|---|---|
| Newsgroups | sci.logic |
| Subject | Re: Difficult question |
| Date | 2023-05-12 14:18 -0400 |
| Organization | A noiseless patient Spider |
| Message-ID | <bb25bbff-2ab1-a557-7e61-e9fb41db5096@att.net> (permalink) |
| References | (2 earlier) <596e4531-0647-4d54-ba51-a6dc806b5846n@googlegroups.com> <28c6a19c-ee24-4bf2-97ad-fd3f2016f67an@googlegroups.com> <857527e5-d1db-4f1d-8829-4fc99525fda0n@googlegroups.com> <c1e6d72a-33a8-eefb-01ae-9017019fe73c@att.net> <a9a9a41c-c8b0-498f-96de-e33a4519f3f7n@googlegroups.com> |
On 5/12/2023 8:37 AM, WM wrote: > Jim Burns schrieb am Donnerstag, > 11. Mai 2023 um 22:11:06 UTC+2: >> On 5/11/2023 7:40 AM, WM wrote: >>> Up to every infinite endsegment, >>> i.e., an endsegment that misses only >>> finitely many natnumbers, >>> the sequence of losses is finite. > >> The intersection of all end segments >> of a 1x1 1-ended >> is empty. > > In the sequence > 1, 2, 3, ...,n, ..., O, n+1, ... > the O cannot follow upon infinitely many > numbers and simultaneously be followed by > infinitely many numbers. > > Therefore there cannot exist infinitely many > indices of endsegments and infinitely many > natnumbers remaining as their contents. A 1×1 1-ended is 1×1 1-ended. For each n ∈ ⟨1,...⟩ ⟨1,...,n⟩ and ⟨n+1,...⟩ exist ⟨1,...⟩ is 1×1 1-ended. ⟨n+1,...⟩ is 1×1 1-ended. ⟨1,...,n⟩ is 1×1 2-ended. For each n ∈ ⟨1,...⟩: NOT for each k ∈ ⟨1,...⟩: n e ⟨k,...⟩ For each n ∈ ⟨1,...⟩ NOT n ∈ intersection of end segments The intersection of end segments is empty. 1×1 1-ended is not reallyreallyreallyreallyreallyreally large 1×1 2-ended.
Back to sci.logic | Previous | Next — Previous in thread | Next in thread | Find similar
Difficult question WM <askasker48@gmail.com> - 2023-05-09 10:08 -0700
Re: Difficult question Fritz Feldhase <franz.fritschee.ff@gmail.com> - 2023-05-09 10:49 -0700
Re: Difficult question WM <askasker48@gmail.com> - 2023-05-10 06:02 -0700
Re: Difficult question Gus Gassmann <horand.gassmann@gmail.com> - 2023-05-10 15:20 -0700
Re: Difficult question WM <askasker48@gmail.com> - 2023-05-11 04:40 -0700
Re: Difficult question Jim Burns <james.g.burns@att.net> - 2023-05-11 16:11 -0400
Re: Difficult question Ross Finlayson <ross.a.finlayson@gmail.com> - 2023-05-11 13:30 -0700
Re: Difficult question WM <askasker48@gmail.com> - 2023-05-12 05:37 -0700
Re: Difficult question Jim Burns <james.g.burns@att.net> - 2023-05-12 14:18 -0400
Re: Difficult question WM <askasker48@gmail.com> - 2023-05-13 06:14 -0700
Re: Difficult question Fritz Feldhase <franz.fritschee.ff@gmail.com> - 2023-05-14 08:46 -0700
Re: Difficult question WM <askasker48@gmail.com> - 2023-05-14 13:47 -0700
Re: Difficult question Gus Gassmann <horand.gassmann@gmail.com> - 2023-05-11 14:01 -0700
Re: Difficult question Ross Finlayson <ross.a.finlayson@gmail.com> - 2023-05-11 14:28 -0700
Re: Difficult question Gus Gassmann <horand.gassmann@gmail.com> - 2023-05-12 01:34 -0700
Re: Difficult question Ross Finlayson <ross.a.finlayson@gmail.com> - 2023-05-12 08:53 -0700
Re: Difficult question Ross Finlayson <ross.a.finlayson@gmail.com> - 2023-05-14 08:41 -0700
Re: Difficult question Ross Finlayson <ross.a.finlayson@gmail.com> - 2023-05-14 10:33 -0700
Re: Difficult question Ross Finlayson <ross.a.finlayson@gmail.com> - 2023-05-14 10:38 -0700
Re: Difficult question Ross Finlayson <ross.a.finlayson@gmail.com> - 2023-05-14 11:48 -0700
Re: Difficult question WM <askasker48@gmail.com> - 2023-05-12 05:38 -0700
csiph-web