Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > sci.math > #510006 > unrolled thread
| Started by | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| First post | 2021-01-19 15:21 +0000 |
| Last post | 2021-02-03 09:57 -0600 |
| Articles | 20 on this page of 379 — 25 participants |
Back to article view | Back to sci.math
This discussion starts older than the indexed window; earlier articles aren't shown. The article labeled Started by
below is the oldest one visible, not the original post.
Re: A "conversation"? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-19 15:21 +0000
Re: A "conversation"? Python <python@python.invalid> - 2021-01-19 16:29 +0100
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-19 11:20 -0800
Re: A "conversation"? Python <python@python.invalid> - 2021-01-19 20:56 +0100
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-19 14:04 -0800
Re: A "conversation"? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-19 23:54 +0000
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-20 03:22 -0800
Re: A "conversation"? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-21 01:18 +0000
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-21 03:06 -0800
Re: A "conversation"? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-22 03:17 +0000
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-22 10:10 -0800
Re: A "conversation"? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-24 02:47 +0000
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-24 09:15 -0800
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-01-24 13:25 -0600
Re: A "conversation"? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-25 03:16 +0000
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-25 05:17 -0800
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-01-25 09:03 -0600
Re: A "conversation"? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-26 23:13 +0000
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-25 06:43 -0800
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-01-25 09:18 -0600
Re: A "conversation"? Python <python@python.invalid> - 2021-01-24 19:46 +0100
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-01-21 22:26 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-22 08:56 -0800
Re: A "conversation"? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-20 00:01 +0000
Re: A "conversation"? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-19 23:11 +0000
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-19 11:13 -0800
Re: A "conversation"? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-20 00:14 +0000
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-20 03:30 -0800
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-01-20 10:14 -0600
Re: A "conversation"? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-21 01:50 +0000
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-21 03:29 -0800
Re: A "conversation"? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-22 02:18 +0000
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-22 09:21 -0800
Re: A "conversation"? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-24 02:03 +0000
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-24 08:47 -0800
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-01-24 14:08 -0600
Re: A "conversation"? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-25 02:35 +0000
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-25 05:07 -0800
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-01-25 05:31 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-25 06:57 -0800
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-01-25 22:26 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-26 06:10 -0800
Re: A "conversation"? Eram semper recta <thenewcalculus@gmail.com> - 2021-01-26 08:08 -0800
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-01-26 22:13 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-27 08:56 -0800
Re: A "conversation"? Eram semper recta <thenewcalculus@gmail.com> - 2021-01-27 10:50 -0800
Re: A "conversation"? Patricio Whackmember <patty_whack@mitchmail.net> - 2021-01-27 14:17 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-27 14:19 -0800
Re: A "conversation"? Eram semper recta <thenewcalculus@gmail.com> - 2021-01-28 06:05 -0800
Re: A "conversation"? Heywood Jablome <heywood@jablome.net> - 2021-01-28 07:37 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-28 09:24 -0800
Re: A "conversation"? Eram semper recta <thenewcalculus@gmail.com> - 2021-01-29 12:44 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-30 03:35 -0800
Re: A "conversation"? FromTheRafters <erratic@nomail.afraid.org> - 2021-01-30 08:06 -0500
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-30 05:12 -0800
Re: A "conversation"? FromTheRafters <erratic@nomail.afraid.org> - 2021-01-30 08:35 -0500
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-30 08:43 -0800
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-01-30 08:45 -0600
Re: A "conversation"? "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-01-30 21:10 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-31 02:13 -0800
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-01-31 11:51 -0600
Re: A "conversation"? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-02-02 02:24 +0000
Re: A "conversation"? "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-01-31 13:42 -0800
Re: A "conversation"? Eram semper recta <thenewcalculus@gmail.com> - 2021-01-30 05:22 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-31 02:10 -0800
Re: A "conversation"? Python <python@python.invalid> - 2021-01-31 11:26 +0100
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-31 03:22 -0800
Re: A "conversation"? Eram semper recta <thenewcalculus@gmail.com> - 2021-01-31 05:56 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-31 06:03 -0800
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-01-31 11:55 -0600
Re: A "conversation"? Rear Admiral Melvin <ram@hotmail.net> - 2021-01-31 11:04 -0800
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-01-31 11:53 -0600
Re: A "conversation"? Python <python@python.invalid> - 2021-01-31 20:44 +0100
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-31 14:03 -0800
Re: A "conversation"? Python <python@python.invalid> - 2021-02-01 00:45 +0100
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-01 00:04 -0800
Re: A "conversation"? Python <python@python.invalid> - 2021-02-01 09:17 +0100
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-01 01:12 -0800
Re: A "conversation"? Python <python@python.invalid> - 2021-02-01 10:47 +0100
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-01 03:43 -0800
Re: A "conversation"? Python <python@python.invalid> - 2021-02-01 12:57 +0100
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-01 04:38 -0800
Re: A "conversation"? Python <python@python.invalid> - 2021-02-01 13:42 +0100
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-01 07:42 -0800
Re: A "conversation"? FromTheRafters <erratic@nomail.afraid.org> - 2021-02-01 10:49 -0500
Re: A "conversation"? Python <python@python.invalid> - 2021-02-01 16:50 +0100
Re: A "conversation"? "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-01-31 13:51 -0800
Re: A "conversation"? Eram semper recta <thenewcalculus@gmail.com> - 2021-01-31 05:53 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-31 06:20 -0800
Re: A "conversation"? "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-01-31 13:53 -0800
Re: A "conversation"? Eram semper recta <thenewcalculus@gmail.com> - 2021-02-03 12:38 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-04 09:35 -0800
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-02-04 13:54 -0600
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-05 11:47 -0800
Re: A "conversation"? Python <python@python.invalid> - 2021-02-05 21:50 +0100
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-05 14:40 -0800
Re: A "conversation"? FromTheRafters <erratic@nomail.afraid.org> - 2021-02-05 17:53 -0500
Re: A "conversation"? Python <python@python.invalid> - 2021-02-06 10:54 +0100
Re: A "conversation"? Eram semper recta <thenewcalculus@gmail.com> - 2021-02-07 16:49 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-08 02:35 -0800
Re: A "conversation"? Eram semper recta <thenewcalculus@gmail.com> - 2021-02-08 08:14 -0800
Re: A "conversation"? Python <python@python.invalid> - 2021-02-08 17:58 +0100
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-09 08:20 -0800
Re: A "conversation"? FromTheRafters <erratic@nomail.afraid.org> - 2021-02-09 11:45 -0500
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-09 09:03 -0800
Re: A "conversation"? Python <python@python.invalid> - 2021-02-09 18:50 +0100
Re: A "conversation"? Python <python@python.invalid> - 2021-02-09 19:57 +0100
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-02-09 13:11 -0600
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-02-09 22:05 -0800
Re: A "conversation"? "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-02-09 22:44 -0800
Re: A "conversation"? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-02-10 11:58 +0000
Re: A "conversation"? Python <python@python.invalid> - 2021-02-10 13:09 +0100
Re: A "conversation"? Peter <peterxpercival@hotmail.com> - 2021-02-10 16:38 +0000
Re: A "conversation"? Alan Mackenzie <acm@muc.de> - 2021-02-10 13:34 +0000
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-02-10 06:06 -0800
Re: A "conversation"? Python <python@python.invalid> - 2021-02-10 15:43 +0100
Re: A "conversation"? Peter <peterxpercival@hotmail.com> - 2021-02-10 16:42 +0000
Re: A "conversation"? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-02-10 22:42 +0000
Re: A "conversation"? FromTheRafters <erratic@nomail.afraid.org> - 2021-02-10 08:34 -0500
Re: A "conversation"? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-02-10 22:39 +0000
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-02-10 06:03 -0800
Re: A "conversation"? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-02-10 22:41 +0000
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-02-10 22:19 -0800
Re: A "conversation"? Jim Burns <james.g.burns@att.net> - 2021-02-11 05:40 -0500
Re: A "conversation"? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-02-11 11:54 +0000
Re: A "conversation"? Python <python@python.invalid> - 2021-02-11 13:07 +0100
Re: A "conversation"? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-02-11 16:05 +0000
Re: A "conversation"? FromTheRafters <erratic@nomail.afraid.org> - 2021-02-11 12:01 -0500
Re: A "conversation"? Jim Burns <james.g.burns@att.net> - 2021-02-11 11:44 -0500
Re: A "conversation"? Python <python@python.invalid> - 2021-02-11 17:55 +0100
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-02-11 20:11 -0600
Re: A "conversation"? Jim Burns <james.g.burns@att.net> - 2021-02-11 11:15 -0500
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-02-11 07:12 -0600
Re: A "conversation"? Jim Burns <james.g.burns@att.net> - 2021-02-11 11:54 -0500
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-02-11 13:54 -0600
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-02-10 12:54 -0600
Re: A "conversation"? Gus Gassmann <horand.gassmann@gmail.com> - 2021-02-08 09:03 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-09 08:31 -0800
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-02-09 13:14 -0600
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-10 06:36 -0800
Re: A "conversation"? Alan Mackenzie <acm@muc.de> - 2021-02-10 14:46 +0000
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-10 06:58 -0800
Re: A "conversation"? Alan Mackenzie <acm@muc.de> - 2021-02-10 17:10 +0000
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-02-10 13:14 -0600
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-11 06:55 -0800
Re: A "conversation"? Python <python@python.invalid> - 2021-02-11 16:05 +0100
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-11 07:43 -0800
Re: A "conversation"? Python <python@python.invalid> - 2021-02-11 17:04 +0100
Re: A "conversation"? Python <python@python.invalid> - 2021-02-11 17:18 +0100
Re: A "conversation"? FromTheRafters <erratic@nomail.afraid.org> - 2021-02-11 15:37 -0500
Re: A "conversation"? FromTheRafters <erratic@nomail.afraid.org> - 2021-02-11 15:48 -0500
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-11 14:02 -0800
Re: A "conversation"? Jim Carrubba <jmic4@wlan2iot.co> - 2021-02-11 22:30 +0000
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-02-11 20:52 -0600
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-02-11 09:34 -0600
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-11 08:07 -0800
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-02-11 10:43 -0600
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-11 09:06 -0800
Re: A "conversation"? Alan Mackenzie <acm@muc.de> - 2021-02-11 22:35 +0000
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-12 02:16 -0800
Re: A "conversation"? Python <python@python.invalid> - 2021-02-12 11:22 +0100
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-12 02:57 -0800
Re: A "conversation"? Python <python@python.invalid> - 2021-02-12 12:10 +0100
Re: A "conversation"? Alan Mackenzie <acm@muc.de> - 2021-02-12 14:14 +0000
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-12 14:43 -0800
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-02-12 17:29 -0600
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-13 01:20 -0800
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-02-12 12:07 -0600
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-12 14:26 -0800
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-02-12 17:30 -0600
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-13 01:21 -0800
Re: A "conversation"? Wade Brewer <wadb@ultnatfs.ca> - 2021-02-13 08:23 +0000
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-12 02:20 -0800
Re: A "conversation"? Alan Mackenzie <acm@muc.de> - 2021-02-12 13:21 +0000
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-12 14:24 -0800
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-02-14 23:42 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-15 09:01 -0800
Re: A "conversation"? Ralf Bader <bader@nefkom.net> - 2021-02-15 19:53 +0100
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-16 01:01 -0800
Re: A "conversation"? Python <python@python.invalid> - 2021-02-16 19:22 +0100
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-02-20 08:23 -0600
Re: A "conversation"? Ralf Bader <bader@nefkom.net> - 2021-02-17 05:30 +0100
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-17 04:48 -0800
Re: A "conversation"? FromTheRafters <erratic@nomail.afraid.org> - 2021-02-17 08:07 -0500
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-17 06:13 -0800
Re: A "conversation"? FromTheRafters <erratic@nomail.afraid.org> - 2021-02-17 09:25 -0500
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-17 06:43 -0800
Re: A "conversation"? FromTheRafters <erratic@nomail.afraid.org> - 2021-02-17 10:42 -0500
Re: A "conversation"? FromTheRafters <erratic@nomail.afraid.org> - 2021-02-17 07:34 -0500
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-02-15 22:23 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-16 01:02 -0800
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-02-16 22:21 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-17 04:58 -0800
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-02-17 06:08 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-17 06:23 -0800
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-02-17 22:33 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-18 02:22 -0800
Re: A "conversation"? Gus Gassmann <horand.gassmann@gmail.com> - 2021-02-18 03:07 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-19 01:26 -0800
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-02-19 02:22 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-20 05:22 -0800
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-02-21 22:42 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-22 02:27 -0800
Re: A "conversation"? Gus Gassmann <horand.gassmann@gmail.com> - 2021-02-19 05:09 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-20 05:29 -0800
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-02-20 08:30 -0600
Re: A "conversation"? Gus Gassmann <horand.gassmann@gmail.com> - 2021-02-20 10:31 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-20 23:30 -0800
Re: A "conversation"? Gus Gassmann <horand.gassmann@gmail.com> - 2021-02-21 06:04 -0800
Re: A "conversation"? FromTheRafters <erratic@nomail.afraid.org> - 2021-02-21 15:07 -0500
Re: A "conversation"? Gus Gassmann <horand.gassmann@gmail.com> - 2021-02-21 14:51 -0800
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-02-21 21:48 -0600
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-02-21 22:03 -0600
Re: A "conversation"? FromTheRafters <erratic@nomail.afraid.org> - 2021-02-22 07:34 -0500
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-22 02:45 -0800
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-02-22 03:16 -0800
Re: A "conversation"? Gus Gassmann <horand.gassmann@gmail.com> - 2021-02-20 10:43 -0800
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-02-20 12:52 -0600
Re: A "conversation"? Ralf Bader <bader@nefkom.net> - 2021-02-20 09:07 +0100
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-20 05:34 -0800
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-02-20 08:35 -0600
Re: A "conversation"? Python <python@python.invalid> - 2021-02-20 15:51 +0100
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-02-20 09:22 -0600
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-20 23:28 -0800
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-02-21 08:57 -0600
Re: A "conversation"? Python <python@python.invalid> - 2021-02-21 17:32 +0100
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-20 23:28 -0800
Re: A "conversation"? Alan Mackenzie <acm@muc.de> - 2021-02-21 10:05 +0000
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-22 02:19 -0800
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-02-22 03:14 -0800
Re: A "conversation"? Ganzhinterseher <claus.vonnesser@gmail.com> - 2021-02-23 06:20 -0800
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-02-28 22:38 -0800
Re: A "conversation"? Ganzhinterseher <claus.vonnesser@gmail.com> - 2021-03-01 02:42 -0800
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-03-01 04:10 -0800
Re: A "conversation"? Ganzhinterseher <claus.vonnesser@gmail.com> - 2021-03-01 05:21 -0800
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-03-01 05:31 -0800
Re: A "conversation"? Ganzhinterseher <claus.vonnesser@gmail.com> - 2021-03-01 05:41 -0800
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-03-01 22:27 -0800
Re: A "conversation"? Ganzhinterseher <claus.vonnesser@gmail.com> - 2021-03-02 01:21 -0800
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-03-02 16:04 -0600
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-03-02 22:37 -0800
Re: A "conversation"? Ganzhinterseher <claus.vonnesser@gmail.com> - 2021-03-04 03:36 -0800
Re: A "conversation"? Python <python@python.invalid> - 2021-03-04 13:21 +0100
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-03-04 07:44 -0600
Re: A "conversation"? Gus Gassmann <horand.gassmann@gmail.com> - 2021-03-04 06:56 -0800
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-03-04 09:48 -0600
Re: A "conversation"? Python <python@python.invalid> - 2021-03-05 05:46 +0100
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-03-04 22:02 -0800
Re: A "conversation"? Ganzhinterseher <claus.vonnesser@gmail.com> - 2021-03-05 06:00 -0800
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-03-07 22:30 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-03-08 04:09 -0800
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-03-08 07:37 -0600
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-03-08 10:22 -0600
Re: A "conversation"? Ganzhinterseher <claus.vonnesser@gmail.com> - 2021-03-09 09:48 -0800
Re: A "conversation"? Python <python@python.invalid> - 2021-03-09 19:03 +0100
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-03-09 10:33 -0800
Re: A "conversation"? Python <python@python.invalid> - 2021-03-09 20:20 +0100
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-03-11 01:01 -0800
Re: A "conversation"? Python <python@python.invalid> - 2021-03-11 10:13 +0100
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-03-09 22:16 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-03-11 01:05 -0800
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-03-11 22:18 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-03-12 03:06 -0800
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-03-12 03:50 -0800
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-03-12 09:44 -0600
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-03-12 09:41 -0600
Re: A "conversation"? Brodie Wiser <bdwi@committee.aero> - 2021-03-12 15:52 +0000
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-03-12 10:06 -0600
Re: A "conversation"? Jim Burns <james.g.burns@att.net> - 2021-03-09 17:07 -0500
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-03-11 01:02 -0800
Re: A "conversation"? * _Joseph W Smith - PhD_ *
The College of Applied Health Science
602 Eeast Green Street
Urbana, IL 61801
joseth@illinois.edu
. <joseth@illinois.edu> - 2021-03-11 11:55 +0000
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-03-12 03:11 -0800
Re: A "conversation"? Python <python@python.invalid> - 2021-03-12 12:18 +0100
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-03-12 09:47 -0600
Re: A "conversation"? Brodie Wiser <bdwi@committee.aero> - 2021-03-12 15:55 +0000
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-03-12 10:03 -0600
Re: A "conversation"? Brodie Wiser <bdwi@committee.aero> - 2021-03-12 16:14 +0000
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-03-12 10:38 -0600
Re: A "conversation"? Eram semper recta <thenewcalculus@gmail.com> - 2021-03-12 09:03 -0800
Re: A "conversation"? Dan Christensen <Dan_Christensen@sympatico.ca> - 2021-03-12 11:41 -0800
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-03-12 09:33 -0600
Re: A "conversation"? Brodie Wiser <bdwi@committee.aero> - 2021-03-12 16:02 +0000
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-03-12 10:37 -0600
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-03-08 22:16 -0800
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-03-02 16:00 -0600
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-02-18 22:16 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-19 01:29 -0800
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-02-20 08:56 -0600
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-02-20 08:18 -0600
Re: A "conversation"? Eddy Scolaro <edsc2@nncasve.cl> - 2021-02-20 19:20 +0000
Re: A "conversation"? Gus Gassmann <horand.gassmann@gmail.com> - 2021-02-09 14:04 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-10 06:41 -0800
Re: A "conversation"? Gus Gassmann <horand.gassmann@gmail.com> - 2021-02-10 07:15 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-10 07:53 -0800
Re: A "conversation"? Gus Gassmann <horand.gassmann@gmail.com> - 2021-02-10 09:22 -0800
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-02-10 13:34 -0600
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-11 07:00 -0800
Re: A "conversation"? Gus Gassmann <horand.gassmann@gmail.com> - 2021-02-11 07:18 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-11 08:20 -0800
Re: A "conversation"? Gus Gassmann <horand.gassmann@gmail.com> - 2021-02-11 08:31 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-11 08:48 -0800
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-02-11 11:19 -0600
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-11 13:57 -0800
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-02-11 22:15 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-12 02:28 -0800
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-02-12 04:57 -0800
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-02-11 10:53 -0600
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-02-10 13:33 -0600
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-02-10 13:16 -0600
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-02-05 19:04 -0600
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-06 02:03 -0800
Re: A "conversation"? Eram semper recta <thenewcalculus@gmail.com> - 2021-02-07 16:42 -0800
Re: A "conversation"? "Hoofington P. McSnort" <hoofsnort@plotonium.com> - 2021-01-31 06:57 -0800
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-01-31 22:20 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-01 00:03 -0800
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-02-01 04:08 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-01 04:32 -0800
Re: A "conversation"? Python <python@python.invalid> - 2021-02-01 13:38 +0100
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-02-01 22:33 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-02 04:34 -0800
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-02-02 05:39 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-02 06:24 -0800
Re: A "conversation"? FromTheRafters <erratic@nomail.afraid.org> - 2021-02-02 10:18 -0500
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-02-02 20:40 -0600
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-02-02 22:09 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-03 07:22 -0800
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-02-03 12:05 -0600
Re: A "conversation"? Python <python@python.invalid> - 2021-02-02 14:43 +0100
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-01-26 22:10 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-27 08:13 -0800
Re: A "conversation"? FromTheRafters <erratic@nomail.afraid.org> - 2021-01-27 11:55 -0500
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-01-27 11:20 -0600
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-27 09:29 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-27 09:33 -0800
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-01-27 15:09 -0600
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-27 14:01 -0800
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-01-29 22:14 -0600
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-01-27 22:03 -0800
Re: A "conversation"? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-26 17:20 +0000
Re: A "conversation"? Eram semper recta <thenewcalculus@gmail.com> - 2021-01-26 10:46 -0800
Re: A "conversation"? Richard Cranium <dickhead@hotmail.net> - 2021-01-26 10:49 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-27 08:24 -0800
Re: A "conversation"? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-29 00:48 +0000
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-29 05:07 -0800
Re: A "conversation"? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-30 02:06 +0000
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-30 03:44 -0800
Re: A "conversation"? Python <python@python.invalid> - 2021-01-30 13:14 +0100
Re: A "conversation"? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-01-31 01:47 +0000
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-01-30 21:35 -0600
Re: A "conversation"? "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-01-30 20:04 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-01-31 03:13 -0800
Re: A "conversation"? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-02-02 03:25 +0000
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-02 06:10 -0800
Re: A "conversation"? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-02-03 03:14 +0000
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-03 07:19 -0800
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-02-03 09:56 -0600
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-02-03 11:13 -0600
Re: A "conversation"? "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-02-03 14:18 -0800
Re: A "conversation"? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-02-04 01:58 +0000
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-04 09:43 -0800
Re: A "conversation"? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-02-05 03:03 +0000
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-02-03 22:17 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-04 09:31 -0800
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-02-04 22:08 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-05 11:54 -0800
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-02-07 22:41 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-08 02:37 -0800
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-02-08 03:22 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-09 08:19 -0800
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-02-09 12:22 -0600
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-10 06:32 -0800
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-02-09 22:04 -0800
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-10 06:44 -0800
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-02-10 22:17 -0800
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-02-08 09:53 -0600
Re: A "conversation"? "zelos...@gmail.com" <zelos.malum@gmail.com> - 2021-02-02 22:09 -0800
Re: A "conversation"? FromTheRafters <erratic@nomail.afraid.org> - 2021-02-03 07:33 -0500
Re: A "conversation"? WM <wolfgang.mueckenheim@hs-augsburg.de> - 2021-02-03 07:21 -0800
Re: A "conversation"? Sergio <invalid@invalid.com> - 2021-02-03 09:57 -0600
Page 11 of 19 — ← Prev page 1 … 9 10 [11] 12 13 … 19 Next page →
| From | WM <wolfgang.mueckenheim@hs-augsburg.de> |
|---|---|
| Date | 2021-02-20 05:22 -0800 |
| Message-ID | <a2d8c9d0-6956-41ff-be79-16390a09465dn@googlegroups.com> |
| In reply to | #512535 |
zelos...@gmail.com schrieb am Freitag, 19. Februar 2021 um 11:22:18 UTC+1:
> >Then there is no empty intersection.
> Incorrect, there can be empty intersections without empty sets.
>
> {1,2} n {3,4}={}
But not with exclusion-monotonig sequences. Note that ever lost n will never come back. Haven't you understood this simple mechanism? Or are you only chaeting?
> >Note that every endsegment having an element has an element in common with all other non empty endegments
> False
Show a definable counter example, that means show definable endegments which have an empty intersection. Note: You shall not claim that all endsegments are definable, but write down the smallest index n that allows for an empty intersection.
> >This is easy to prove by inclusion monotony.
> It demonstrates that for any finite number of endsegments, you can find a subset that they all share.
There are no other definable endsegments.
> Not that there is anything in common with ALL INFINITELY MANY of them.
My claim concerns only definable endsegments, i.e., endsegments the indices of which you can write in decimal representation.
>
> >Wrong. Note that all intersections of endsegments are endsegments themselves.
>
> Nope, that is only true for FINITE intersections, not infinite.
Ifr it was not true, then there would be a first one for which it is not true.
> >Empty intersection without empty endegment is an impossibility.
> It isn't because for any element n, E(n+1) doesn't have it, ergo no element is in the intersection of all.
No definable element.
>
> >Note inclusion monotony
>
> Shwos that for finite number of endsegments, you have a common subset. Nothing else.
Inclusion monotony shows this for all endsegments.
>
> >That proves that all natnumbers get lost. The result is empty. Note that all intersections of endsegments are endsegments themselves
>
> ALL FINITE intersections are. Not INFINITE ones.
For infinite sets we have Cantor's theorem B:
Here are some excerpts from Cantor's papers concerning the fact that every set of ordinal numbers has a smallest element:
"Among the numbers of the set (') there is always a smallest one." A simple proof has been shown by Zermelo, the editor of Cantor's collected works.
"Theorem B: Every embodiment of different numbers of the first and the second number class has a smallest number, a minimum."
"Would the index ' not run through all numbers of the second number class then there had to be a smallest number that it does not reach."
"But from the proven theorems about well-ordered sets in § 13 it also follows easily that every multitude of numbers, i.e., every part of contains a smallest number."
If inclusion monotony ceases, then there must be a first index at which it ceases.
Regards, WM
[toc] | [prev] | [next] | [standalone]
| From | "zelos...@gmail.com" <zelos.malum@gmail.com> |
|---|---|
| Date | 2021-02-21 22:42 -0800 |
| Message-ID | <992425c9-5011-4833-ae3c-28d5a1d20188n@googlegroups.com> |
| In reply to | #512590 |
>But not with exclusion-monotonig sequences. They can, as long as it is infinite and each one is strictly a proper subset of previous. >Note that ever lost n will never come back. Haven't you understood this simple mechanism? Or are you only chaeting? I understand this considerably better than you. >Show a definable counter example, that means show definable endegments which have an empty intersection. Note: You shall not claim that all endsegments are definable, but write down the smallest index n that allows for an empty intersection. Given I need to define a FINITE collection of endsegments that has empty intersection and it requires an INFINITE collection of endsegments, you won't be given any. It is like asking you to dinf an even number that has the remainder 1 when divided by 2. I can however show that the intersection is empty by simply showing that if you think n is gonna be in the intersection, then n is in every endsegment, but E(n+1) lacks n, ergo, it isn't in the intersection. >My claim concerns only definable endsegments, i.e., endsegments the indices of which you can write in decimal representation. That is all of them, all natural numbers can be written using decimal notation. and again, you are going for computation here, not mathematics. >Ifr it was not true, then there would be a first one for which it is not true. Incorrect, there need be no first one for some n for my statement to be true you idiot. >You denote with this curse that I am unwilling to agree with fools of matheology who mutilate mathematics. The one mutilating it is you, you constnatly lie and is dishonest, fail at basic logic and much else.
[toc] | [prev] | [next] | [standalone]
| From | WM <wolfgang.mueckenheim@hs-augsburg.de> |
|---|---|
| Date | 2021-02-22 02:27 -0800 |
| Message-ID | <2925a3a4-86b3-4d3b-bd24-ef19bd0d95a7n@googlegroups.com> |
| In reply to | #512723 |
zelos...@gmail.com schrieb am Montag, 22. Februar 2021 um 07:42:35 UTC+1: > >My claim concerns only definable endsegments, i.e., endsegments the indices of which you can write in decimal representation. > > That is all of them, all natural numbers can be written using decimal notation. Why can you use more ordinals in ascending sequence (namely infinitely many) than in decreasing sequence (namely finitely many)? Are there decimal notations that can only be used in ascending sequences? > > and again, you are going for computation here, not mathematics. Mathematics is this: In a mapping however, when you write n --> f(n) then you have to be able to insert every individual n and to calculate its f(n). That however is not possible for crowds. > > >If it was not true, then there would be a first one for which it is not true. > Incorrect, there need be no first one for some n for my statement to be true you idiot. That is an offending Cantor: Cantor's Theorem B Here are some excerpts from Cantor's papers concerning the fact that every set of ordinal numbers has a smallest element: "Among the numbers of the set (') there is always a smallest one." A simple proof has been shown by Zermelo, the editor of Cantor's collected works. "Theorem B: Every embodiment of different numbers of the first and the second number class has a smallest number, a minimum." "Would the index ' not run through all numbers of the second number class then there had to be a smallest number that it does not reach." "But from the proven theorems about well-ordered sets in § 13 it also follows easily that every multitude of numbers, i.e., every part of contains a smallest number." Regards, WM
[toc] | [prev] | [next] | [standalone]
| From | Gus Gassmann <horand.gassmann@gmail.com> |
|---|---|
| Date | 2021-02-19 05:09 -0800 |
| Message-ID | <d3d73471-06ea-40ea-af22-5b94cddaa529n@googlegroups.com> |
| In reply to | #512531 |
On Friday, 19 February 2021 at 05:26:10 UTC-4, WM wrote:
> Gus Gassmann schrieb am Donnerstag, 18. Februar 2021 um 12:07:22 UTC+1:
> > On Thursday, 18 February 2021 at 06:22:52 UTC-4, WM wrote:
> > > zelos...@gmail.com schrieb am Donnerstag, 18. Februar 2021 um 07:33:19 UTC+1:
> > > > >Then don't pick but use a mathematical proof: E(n+1) = E(n) \ {n}.
> > > > >This shows: As long as the empty endsegment is not reached, the intersection is not empty.
> > > > Nope, it only shows no endsegment is empty, the intersection fo all is still empty because no element exists in all of them.
> > > All non-empty endsegments have a non-empty intersection, because every endsegment contains at least one natural number which is in all other endsegments.
> > > > >Find non-empty endsegments with empty intersection. Fail.
> > > > All fo them, intersection fo ALL of them is empty, hence I have done it.
> > > "All of them" includes the empty endsegment. So the intersection is empty.
> > There is no empty end segment.
> Then there is no empty intersection. Note that every endsegment having an element has an element in common with all other noin empty endegments.
Ah, no. This is your quantifier dyslexia. It has *different* elements in common with each other end segment.
[...] (Remaining nonsense removed.)
[toc] | [prev] | [next] | [standalone]
| From | WM <wolfgang.mueckenheim@hs-augsburg.de> |
|---|---|
| Date | 2021-02-20 05:29 -0800 |
| Message-ID | <eedd030b-02bc-4380-a70a-06344ad0954fn@googlegroups.com> |
| In reply to | #512539 |
Gus Gassmann schrieb am Freitag, 19. Februar 2021 um 14:09:31 UTC+1:
> On Friday, 19 February 2021 at 05:26:10 UTC-4, WM wrote:
> > Gus Gassmann schrieb am Donnerstag, 18. Februar 2021 um 12:07:22 UTC+1:
> > > On Thursday, 18 February 2021 at 06:22:52 UTC-4, WM wrote:
> > > > zelos...@gmail.com schrieb am Donnerstag, 18. Februar 2021 um 07:33:19 UTC+1:
> > > > > >Then don't pick but use a mathematical proof: E(n+1) = E(n) \ {n}.
> > > > > >This shows: As long as the empty endsegment is not reached, the intersection is not empty.
> > > > > Nope, it only shows no endsegment is empty, the intersection fo all is still empty because no element exists in all of them.
> > > > All non-empty endsegments have a non-empty intersection, because every endsegment contains at least one natural number which is in all other endsegments.
> > > > > >Find non-empty endsegments with empty intersection. Fail.
> > > > > All fo them, intersection fo ALL of them is empty, hence I have done it.
> > > > "All of them" includes the empty endsegment. So the intersection is empty.
> > > There is no empty end segment.
> > Then there is no empty intersection. Note that every endsegment having an element has an element in common with all other noin empty endegments.
> Ah, no. This is your quantifier dyslexia.
You denote with this curse that I am unwilling to agree with fools of matheology who mutilate mathematics.
> It has *different* elements in common with each other end segment.
Define endsegments which have not one and the same element in common.
Note excllusion monotony which implies that every non-empty endsegment has an element in common with every other non-empty endsegment.
Regards, WM
[toc] | [prev] | [next] | [standalone]
| From | Sergio <invalid@invalid.com> |
|---|---|
| Date | 2021-02-20 08:30 -0600 |
| Message-ID | <s0r6dl$1nuo$2@gioia.aioe.org> |
| In reply to | #512591 |
On 2/20/2021 7:29 AM, WM wrote:
> Gus Gassmann schrieb am Freitag, 19. Februar 2021 um 14:09:31 UTC+1:
>> On Friday, 19 February 2021 at 05:26:10 UTC-4, WM wrote:
>>> Gus Gassmann schrieb am Donnerstag, 18. Februar 2021 um 12:07:22 UTC+1:
>>>> On Thursday, 18 February 2021 at 06:22:52 UTC-4, WM wrote:
>>>>> zelos...@gmail.com schrieb am Donnerstag, 18. Februar 2021 um 07:33:19 UTC+1:
>>>>>>> Then don't pick but use a mathematical proof: E(n+1) = E(n) \ {n}.
>>>>>>> This shows: As long as the empty endsegment is not reached, the intersection is not empty.
>>>>>> Nope, it only shows no endsegment is empty, the intersection fo all is still empty because no element exists in all of them.
>>>>> All non-empty endsegments have a non-empty intersection, because every endsegment contains at least one natural number which is in all other endsegments.
>>>>>>> Find non-empty endsegments with empty intersection. Fail.
>>>>>> All fo them, intersection fo ALL of them is empty, hence I have done it.
>>>>> "All of them" includes the empty endsegment. So the intersection is empty.
>>>> There is no empty end segment.
>>> Then there is no empty intersection. Note that every endsegment having an element has an element in common with all other noin empty endegments.
>> Ah, no. This is your quantifier dyslexia.
>
> You denote with this curse that I am unwilling to agree with fools of matheology who mutilate mathematics.
so, Math Mutilator, where are your DARK NUMBERS ?
oo - k = oo , so it must be oo - k , where k is finite
>
>> It has *different* elements in common with each other end segment.
>
> Define endsegments which have not one and the same element in common.
> Note excllusion monotony which implies that every non-empty endsegment has an element in common with every other non-empty endsegment.
>
> Regards, WM
>
[toc] | [prev] | [next] | [standalone]
| From | Gus Gassmann <horand.gassmann@gmail.com> |
|---|---|
| Date | 2021-02-20 10:31 -0800 |
| Message-ID | <7cc4ff33-c27b-41bc-a838-0ab704360d12n@googlegroups.com> |
| In reply to | #512591 |
On Saturday, 20 February 2021 at 09:29:07 UTC-4, WM wrote:
> Gus Gassmann schrieb am Freitag, 19. Februar 2021 um 14:09:31 UTC+1:
> > On Friday, 19 February 2021 at 05:26:10 UTC-4, WM wrote:
> > > Gus Gassmann schrieb am Donnerstag, 18. Februar 2021 um 12:07:22 UTC+1:
> > > > On Thursday, 18 February 2021 at 06:22:52 UTC-4, WM wrote:
> > > > > zelos...@gmail.com schrieb am Donnerstag, 18. Februar 2021 um 07:33:19 UTC+1:
> > > > > > >Then don't pick but use a mathematical proof: E(n+1) = E(n) \ {n}.
> > > > > > >This shows: As long as the empty endsegment is not reached, the intersection is not empty.
> > > > > > Nope, it only shows no endsegment is empty, the intersection fo all is still empty because no element exists in all of them.
> > > > > All non-empty endsegments have a non-empty intersection, because every endsegment contains at least one natural number which is in all other endsegments.
> > > > > > >Find non-empty endsegments with empty intersection. Fail.
> > > > > > All fo them, intersection fo ALL of them is empty, hence I have done it.
> > > > > "All of them" includes the empty endsegment. So the intersection is empty.
> > > > There is no empty end segment.
> > > Then there is no empty intersection. Note that every endsegment having an element has an element in common with all other noin empty endegments.
> > Ah, no. This is your quantifier dyslexia.
> You denote with this curse that I am unwilling to agree with fools of matheology who mutilate mathematics.
> > It has *different* elements in common with each other end segment.
> Define endsegments which have not one and the same element in common.
My god, you are such a frigging idiot. Do you really not understand that E(1) and E(2) have different elements in common than E(1) and E(3)???
[toc] | [prev] | [next] | [standalone]
| From | WM <wolfgang.mueckenheim@hs-augsburg.de> |
|---|---|
| Date | 2021-02-20 23:30 -0800 |
| Message-ID | <7065dd92-0868-41ce-a183-96d66820381dn@googlegroups.com> |
| In reply to | #512615 |
Gus Gassmann schrieb am Samstag, 20. Februar 2021 um 19:31:30 UTC+1: > On Saturday, 20 February 2021 at 09:29:07 UTC-4, WM wrote: > > Gus Gassmann schrieb am Freitag, 19. Februar 2021 um 14:09:31 UTC+1: > > > It has *different* elements in common with each other end segment. > > Define endsegments which have not one and the same element in common. > Do you really not understand that E(1) and E(2) have different elements in common than E(1) and E(3)??? That is not in question. But all non-empty endsegments have at least one element in common, by exclusion monotony: If an endsegment is not empty, then its elements are contained in all its predecessors. Regards, WM
[toc] | [prev] | [next] | [standalone]
| From | Gus Gassmann <horand.gassmann@gmail.com> |
|---|---|
| Date | 2021-02-21 06:04 -0800 |
| Message-ID | <cf66941c-f217-4af8-b310-0920048ff97en@googlegroups.com> |
| In reply to | #512662 |
On Sunday, 21 February 2021 at 03:30:30 UTC-4, WM wrote: > Gus Gassmann schrieb am Samstag, 20. Februar 2021 um 19:31:30 UTC+1: > > On Saturday, 20 February 2021 at 09:29:07 UTC-4, WM wrote: > > > Gus Gassmann schrieb am Freitag, 19. Februar 2021 um 14:09:31 UTC+1: > > > > > It has *different* elements in common with each other end segment. > > > Define endsegments which have not one and the same element in common. > > Do you really not understand that E(1) and E(2) have different elements in common than E(1) and E(3)??? > That is not in question. But all non-empty endsegments have at least one element in common, by exclusion monotony: If an endsegment is not empty, then its elements are contained in all its predecessors. Every integer has a finite number of predecessors and an infinite number of successors. And of course the intersection of E(1), e(2), ... E(n) is not empty. (It is, in fact E(n).) But you also know perfectly well that the infinite intersection of E(n), E(n+1), E(n+2), ... is empty. The fact that E(n+1) is a subset of E(n) has exactly nothing to do with that fact. I repeat for the umpteenth time: You have *no clue* about infinity, and very little understanding of mathematics.
[toc] | [prev] | [next] | [standalone]
| From | FromTheRafters <erratic@nomail.afraid.org> |
|---|---|
| Date | 2021-02-21 15:07 -0500 |
| Message-ID | <s0uein$o63$1@gioia.aioe.org> |
| In reply to | #512668 |
Gus Gassmann presented the following explanation : > On Sunday, 21 February 2021 at 03:30:30 UTC-4, WM wrote: >> Gus Gassmann schrieb am Samstag, 20. Februar 2021 um 19:31:30 UTC+1: >>> On Saturday, 20 February 2021 at 09:29:07 UTC-4, WM wrote: >>>> Gus Gassmann schrieb am Freitag, 19. Februar 2021 um 14:09:31 UTC+1: >>>>> It has *different* elements in common with each other end segment. >>>> Define endsegments which have not one and the same element in common. >>> Do you really not understand that E(1) and E(2) have different elements in >>> common than E(1) and E(3)??? >> That is not in question. But all non-empty endsegments have at least one >> element in common, by exclusion monotony: If an endsegment is not empty, >> then its elements are contained in all its predecessors. > > Every integer has a finite number of predecessors and an infinite number of > successors. For positive and non-negative integers only. > And of course the intersection of E(1), e(2), ... E(n) is not > empty. (It is, in fact E(n).) But you also know perfectly well that the > infinite intersection of E(n), E(n+1), E(n+2), ... is empty. The fact that > E(n+1) is a subset of E(n) has exactly nothing to do with that fact. I repeat > for the umpteenth time: You have *no clue* about infinity, and very little > understanding of mathematics. It sure appears that way.
[toc] | [prev] | [next] | [standalone]
| From | Gus Gassmann <horand.gassmann@gmail.com> |
|---|---|
| Date | 2021-02-21 14:51 -0800 |
| Message-ID | <847f3343-8a3a-4e02-ae11-231b2cf86aa4n@googlegroups.com> |
| In reply to | #512685 |
On Sunday, 21 February 2021 at 16:08:06 UTC-4, FromTheRafters wrote: > Gus Gassmann presented the following explanation : > > Every integer has a finite number of predecessors and an infinite number of > > successors. > For positive and non-negative integers only. Correction gratefully acknowledged. > > And of course the intersection of E(1), e(2), ... E(n) is not > > empty. (It is, in fact E(n).) But you also know perfectly well that the > > infinite intersection of E(n), E(n+1), E(n+2), ... is empty. The fact that > > E(n+1) is a subset of E(n) has exactly nothing to do with that fact. I repeat > > for the umpteenth time: You have *no clue* about infinity, and very little > > understanding of mathematics. > It sure appears that way.
[toc] | [prev] | [next] | [standalone]
| From | Sergio <invalid@invalid.com> |
|---|---|
| Date | 2021-02-21 21:48 -0600 |
| Message-ID | <s0v9hl$1v7a$1@gioia.aioe.org> |
| In reply to | #512685 |
On 2/21/2021 2:07 PM, FromTheRafters wrote: > Gus Gassmann presented the following explanation : >> On Sunday, 21 February 2021 at 03:30:30 UTC-4, WM wrote: >>> Gus Gassmann schrieb am Samstag, 20. Februar 2021 um 19:31:30 UTC+1: >>>> On Saturday, 20 February 2021 at 09:29:07 UTC-4, WM wrote: >>>>> Gus Gassmann schrieb am Freitag, 19. Februar 2021 um 14:09:31 UTC+1: >>>>>> It has *different* elements in common with each other end segment. >>>>> Define endsegments which have not one and the same element in common. >>>> Do you really not understand that E(1) and E(2) have different >>>> elements in common than E(1) and E(3)??? >>> That is not in question. But all non-empty endsegments have at least >>> one element in common, by exclusion monotony: If an endsegment is not >>> empty, then its elements are contained in all its predecessors. >> >> Every integer has a finite number of predecessors and an infinite >> number of successors. > > For positive and non-negative integers only. assume k is an integer in the set of positive, non-negative integers (0 is not included) also known as natural numbers. Ill define "predecessors" and "successors" "# of predecessors" = k - 1 (up to but not including k) "# of successors" = k - 1 + oo = oo (not including k and on out to oo) SO! what we have done is split the set of natural numbers into three (3) parts via k, less than k, k, and greater than k.... well golly, seems really simple. is this right ? or did I misunderstand "predecessors" and "successors"? [no "exclusion/inclusive monotony", no "removal" of numbers, no "instantiating" numbers (sounds nasty), no eggsegments, no...] > >> And of course the intersection of E(1), e(2), ... E(n) is not empty. >> (It is, in fact E(n).) But you also know perfectly well that the >> infinite intersection of E(n), E(n+1), E(n+2), ... is empty. The fact >> that E(n+1) is a subset of E(n) has exactly nothing to do with that >> fact. I repeat for the umpteenth time: You have *no clue* about >> infinity, and very little understanding of mathematics. > > It sure appears that way.
[toc] | [prev] | [next] | [standalone]
| From | Sergio <invalid@invalid.com> |
|---|---|
| Date | 2021-02-21 22:03 -0600 |
| Message-ID | <s0vaev$8mt$1@gioia.aioe.org> |
| In reply to | #512712 |
On 2/21/2021 9:48 PM, Sergio wrote: > On 2/21/2021 2:07 PM, FromTheRafters wrote: >> Gus Gassmann presented the following explanation : >>> On Sunday, 21 February 2021 at 03:30:30 UTC-4, WM wrote: >>>> Gus Gassmann schrieb am Samstag, 20. Februar 2021 um 19:31:30 UTC+1: >>>>> On Saturday, 20 February 2021 at 09:29:07 UTC-4, WM wrote: >>>>>> Gus Gassmann schrieb am Freitag, 19. Februar 2021 um 14:09:31 UTC+1: >>>>>>> It has *different* elements in common with each other end segment. >>>>>> Define endsegments which have not one and the same element in common. >>>>> Do you really not understand that E(1) and E(2) have different >>>>> elements in common than E(1) and E(3)??? >>>> That is not in question. But all non-empty endsegments have at least >>>> one element in common, by exclusion monotony: If an endsegment is not >>>> empty, then its elements are contained in all its predecessors. >>> >>> Every integer has a finite number of predecessors and an infinite >>> number of successors. >> >> For positive and non-negative integers only. > > assume k is an integer in the set of positive, non-negative integers (0 > is not included) also known as natural numbers. > > Ill define "predecessors" and "successors" > > "# of predecessors" = k - 1 (up to but not including k) > > "# of successors" = k - 1 + oo = oo (not including k and on out to oo) correction! "# of successors" = oo - k = oo > > > SO! what we have done is split the set of natural numbers into three > (3) parts via k, less than k, k, and greater than k.... > > well golly, seems really simple. > > is this right ? or did I misunderstand "predecessors" and "successors"? > > [no "exclusion/inclusive monotony", no "removal" of numbers, no > "instantiating" numbers (sounds nasty), no eggsegments, no...] > > >> >>> And of course the intersection of E(1), e(2), ... E(n) is not empty. >>> (It is, in fact E(n).) But you also know perfectly well that the >>> infinite intersection of E(n), E(n+1), E(n+2), ... is empty. The fact >>> that E(n+1) is a subset of E(n) has exactly nothing to do with that >>> fact. I repeat for the umpteenth time: You have *no clue* about >>> infinity, and very little understanding of mathematics. >> >> It sure appears that way. >
[toc] | [prev] | [next] | [standalone]
| From | FromTheRafters <erratic@nomail.afraid.org> |
|---|---|
| Date | 2021-02-22 07:34 -0500 |
| Message-ID | <s108bu$494$1@gioia.aioe.org> |
| In reply to | #512712 |
Sergio pretended : > On 2/21/2021 2:07 PM, FromTheRafters wrote: >> Gus Gassmann presented the following explanation : >>> On Sunday, 21 February 2021 at 03:30:30 UTC-4, WM wrote: >>>> Gus Gassmann schrieb am Samstag, 20. Februar 2021 um 19:31:30 UTC+1: >>>>> On Saturday, 20 February 2021 at 09:29:07 UTC-4, WM wrote: >>>>>> Gus Gassmann schrieb am Freitag, 19. Februar 2021 um 14:09:31 UTC+1: >>>>>>> It has *different* elements in common with each other end segment. >>>>>> Define endsegments which have not one and the same element in common. >>>>> Do you really not understand that E(1) and E(2) have different >>>>> elements in common than E(1) and E(3)??? >>>> That is not in question. But all non-empty endsegments have at least >>>> one element in common, by exclusion monotony: If an endsegment is not >>>> empty, then its elements are contained in all its predecessors. >>> >>> Every integer has a finite number of predecessors and an infinite >>> number of successors. >> >> For positive and non-negative integers only. > > assume k is an integer in the set of positive, non-negative integers (0 > is not included) also known as natural numbers. > > Ill define "predecessors" and "successors" > > "# of predecessors" = k - 1 (up to but not including k) If k is one, then k - 1 is not in the set. Sure, there are zero predecessors, but what does zero mean in the naturals without zero? > "# of successors" = k - 1 + oo = oo (not including k and on out to oo) > > > SO! what we have done is split the set of natural numbers into three > (3) parts via k, less than k, k, and greater than k.... > > well golly, seems really simple. > > is this right ? or did I misunderstand "predecessors" and "successors"? > > [no "exclusion/inclusive monotony", no "removal" of numbers, no > "instantiating" numbers (sounds nasty), no eggsegments, no...] Looks good to me.
[toc] | [prev] | [next] | [standalone]
| From | WM <wolfgang.mueckenheim@hs-augsburg.de> |
|---|---|
| Date | 2021-02-22 02:45 -0800 |
| Message-ID | <ad40ffdd-7202-4704-93cf-4704c1652049n@googlegroups.com> |
| In reply to | #512668 |
Gus Gassmann schrieb am Sonntag, 21. Februar 2021 um 15:04:28 UTC+1:
> On Sunday, 21 February 2021 at 03:30:30 UTC-4, WM wrote:
> > Gus Gassmann schrieb am Samstag, 20. Februar 2021 um 19:31:30 UTC+1:
> > >But all non-empty endsegments have at least one element in common, by exclusion monotony: If an endsegment is not empty, then its elements are contained in all its predecessors.
> Every integer has a finite number of predecessors and an infinite number of successors.
This is impossible, because the successors (in positive direction) are also integers. Since "every interger" can be added to a set yielding all integers (can't it?), your sentence is self-contradictory like "all X are not all X".
There are only two alternatives:
Either the successors are not yet existing, but can be created without end, or the successors are dark and cannot be inserted into your "every" and summed to "all".
> And of course the intersection of E(1), e(2), ... E(n) is not empty. (It is, in fact E(n).)
Every intersection is a last endsegment.
> But you also know perfectly well that the infinite intersection of E(n), E(n+1), E(n+2), ... is empty.
Then there must be an empty endsegment, because mathematics, materialized in this equation
E(n+1) = E(n) \ {n}
cannot be cheated.
> The fact that E(n+1) is a subset of E(n) has exactly nothing to do with that fact.
That is clearly wrong, but probably the only way to stick to Cantor's nonsense.
Regards, WM
[toc] | [prev] | [next] | [standalone]
| From | "zelos...@gmail.com" <zelos.malum@gmail.com> |
|---|---|
| Date | 2021-02-22 03:16 -0800 |
| Message-ID | <bcea060c-2905-4d47-b71d-eaf6fef328ben@googlegroups.com> |
| In reply to | #512745 |
>Every intersection is a last endsegment. every FINITE itnersection is an endsegment, not all intersections. >Then there must be an empty endsegment, because mathematics, materialized in this equation There mustn'y at all, this is your idiocy.
[toc] | [prev] | [next] | [standalone]
| From | Gus Gassmann <horand.gassmann@gmail.com> |
|---|---|
| Date | 2021-02-20 10:43 -0800 |
| Message-ID | <13908085-20a5-437c-b793-5c985ebcffa1n@googlegroups.com> |
| In reply to | #512591 |
On Saturday, 20 February 2021 at 09:29:07 UTC-4, WM wrote:
> Gus Gassmann schrieb am Freitag, 19. Februar 2021 um 14:09:31 UTC+1:
> > On Friday, 19 February 2021 at 05:26:10 UTC-4, WM wrote:
> > > Gus Gassmann schrieb am Donnerstag, 18. Februar 2021 um 12:07:22 UTC+1:
> > > > On Thursday, 18 February 2021 at 06:22:52 UTC-4, WM wrote:
> > > > > zelos...@gmail.com schrieb am Donnerstag, 18. Februar 2021 um 07:33:19 UTC+1:
> > > > > > >Then don't pick but use a mathematical proof: E(n+1) = E(n) \ {n}.
> > > > > > >This shows: As long as the empty endsegment is not reached, the intersection is not empty.
> > > > > > Nope, it only shows no endsegment is empty, the intersection fo all is still empty because no element exists in all of them.
> > > > > All non-empty endsegments have a non-empty intersection, because every endsegment contains at least one natural number which is in all other endsegments.
> > > > > > >Find non-empty endsegments with empty intersection. Fail.
> > > > > > All fo them, intersection fo ALL of them is empty, hence I have done it.
> > > > > "All of them" includes the empty endsegment. So the intersection is empty.
> > > > There is no empty end segment.
> > > Then there is no empty intersection. Note that every endsegment having an element has an element in common with all other noin empty endegments.
> > Ah, no. This is your quantifier dyslexia.
> You denote with this curse that I am unwilling to agree with fools of matheology who mutilate mathematics.
You think that was a curse?!? You must lead a very sheltered life. On the other hand, you make your prejudices abundantly clear: Everyone with whom you disagree must automatically be wrong, and any and all means are fair game to "prove" your position. You are a narcissistic prick!
[toc] | [prev] | [next] | [standalone]
| From | Sergio <invalid@invalid.com> |
|---|---|
| Date | 2021-02-20 12:52 -0600 |
| Message-ID | <s0rlor$mfh$1@gioia.aioe.org> |
| In reply to | #512617 |
On 2/20/2021 12:43 PM, Gus Gassmann wrote:
> On Saturday, 20 February 2021 at 09:29:07 UTC-4, WM wrote:
>> Gus Gassmann schrieb am Freitag, 19. Februar 2021 um 14:09:31 UTC+1:
>>> On Friday, 19 February 2021 at 05:26:10 UTC-4, WM wrote:
>>>> Gus Gassmann schrieb am Donnerstag, 18. Februar 2021 um 12:07:22 UTC+1:
>>>>> On Thursday, 18 February 2021 at 06:22:52 UTC-4, WM wrote:
>>>>>> zelos...@gmail.com schrieb am Donnerstag, 18. Februar 2021 um 07:33:19 UTC+1:
>>>>>>>> Then don't pick but use a mathematical proof: E(n+1) = E(n) \ {n}.
>>>>>>>> This shows: As long as the empty endsegment is not reached, the intersection is not empty.
>>>>>>> Nope, it only shows no endsegment is empty, the intersection fo all is still empty because no element exists in all of them.
>>>>>> All non-empty endsegments have a non-empty intersection, because every endsegment contains at least one natural number which is in all other endsegments.
>>>>>>>> Find non-empty endsegments with empty intersection. Fail.
>>>>>>> All fo them, intersection fo ALL of them is empty, hence I have done it.
>>>>>> "All of them" includes the empty endsegment. So the intersection is empty.
>>>>> There is no empty end segment.
>>>> Then there is no empty intersection. Note that every endsegment having an element has an element in common with all other noin empty endegments.
>>> Ah, no. This is your quantifier dyslexia.
>> You denote with this curse that I am unwilling to agree with fools of matheology who mutilate mathematics.
>
> You think that was a curse?!? You must lead a very sheltered life. On the other hand, you make your prejudices abundantly clear: Everyone with whom you disagree must automatically be wrong, and any and all means are fair game to "prove" your position. You are a narcissistic prick!
>
>
hmmm... WM is continually self-instantiating, the rest of us are dark.
[toc] | [prev] | [next] | [standalone]
| From | Ralf Bader <bader@nefkom.net> |
|---|---|
| Date | 2021-02-20 09:07 +0100 |
| Message-ID | <s0qg03$vot$1@news-1.m-online.net> |
| In reply to | #512531 |
On 02/19/2021 10:26 AM, WM wrote:
> Gus Gassmann schrieb am Donnerstag, 18. Februar 2021 um 12:07:22
> UTC+1:
>> On Thursday, 18 February 2021 at 06:22:52 UTC-4, WM wrote:
>>> zelos...@gmail.com schrieb am Donnerstag, 18. Februar 2021 um
>>> 07:33:19 UTC+1:
>>>>> Then don't pick but use a mathematical proof: E(n+1) = E(n) \
>>>>> {n}. This shows: As long as the empty endsegment is not
>>>>> reached, the intersection is not empty.
>>>> Nope, it only shows no endsegment is empty, the intersection fo
>>>> all is still empty because no element exists in all of them.
>>> All non-empty endsegments have a non-empty intersection, because
>>> every endsegment contains at least one natural number which is in
>>> all other endsegments.
>>>>> Find non-empty endsegments with empty intersection. Fail.
>>>> All fo them, intersection fo ALL of them is empty, hence I have
>>>> done it.
>>> "All of them" includes the empty endsegment. So the intersection
>>> is empty.
>> There is no empty end segment.
>
> Then there is no empty intersection. Note that every endsegment
> having an element has an element in common with all other noin empty
> endegments. This is easy to prove by inclusion monotony.
This is obviously wrong. You are too stupid for mathematics.
>> By your own definition, every end segment has to contain at least
>> one natural number an infinite number of successors.
>
> That is true for all definable endsegments. All definable endsegments
> have infinite intersection:
>
> ∀k ∈ ℕ: ∩{E(1), E(2), ..., E(k)} = E(k) /\ |E(k)| = ℵo .
>
> Definable endsegments cannot have an empty intersection. When you
> show that no natnumber remains forever then it is clear that all
> natnumbers get lost. The result is an empty endsegment. Note that all
> intersections of endsegments are endsegments themselves.
Idiotic nonsense.
[toc] | [prev] | [next] | [standalone]
| From | WM <wolfgang.mueckenheim@hs-augsburg.de> |
|---|---|
| Date | 2021-02-20 05:34 -0800 |
| Message-ID | <cbcb25a1-9694-4907-b7e3-955362a5d115n@googlegroups.com> |
| In reply to | #512587 |
Ralf Bader schrieb am Samstag, 20. Februar 2021 um 09:07:39 UTC+1:
> On 02/19/2021 10:26 AM, WM wrote:
> > Gus Gassmann schrieb am Donnerstag, 18. Februar 2021 um 12:07:22
> > UTC+1:
> >> On Thursday, 18 February 2021 at 06:22:52 UTC-4, WM wrote:
> >>> zelos...@gmail.com schrieb am Donnerstag, 18. Februar 2021 um
> >>> 07:33:19 UTC+1:
> >>>>> Then don't pick but use a mathematical proof: E(n+1) = E(n) \
> >>>>> {n}. This shows: As long as the empty endsegment is not
> >>>>> reached, the intersection is not empty.
> >>>> Nope, it only shows no endsegment is empty, the intersection fo
> >>>> all is still empty because no element exists in all of them.
> >>> All non-empty endsegments have a non-empty intersection, because
> >>> every endsegment contains at least one natural number which is in
> >>> all other endsegments.
> >>>>> Find non-empty endsegments with empty intersection. Fail.
> >>>> All fo them, intersection fo ALL of them is empty, hence I have
> >>>> done it.
> >>> "All of them" includes the empty endsegment. So the intersection
> >>> is empty.
> >> There is no empty end segment.
> >
> > Then there is no empty intersection. Note that every endsegment
> > having an element has an element in common with all other noin empty
> > endegments. This is easy to prove by inclusion monotony.
> This is obviously wrong.
In fact it is exclusion monotony: Every natnumber that has been lost will never return. This implies that every non-empty endsegment has an element in common with every other non-empty endsegment.
> You are too stupid for mathematics.
Exclusion monotony is mathematics.
> >> By your own definition, every end segment has to contain at least
> >> one natural number an infinite number of successors.
> >
> > That is true for all definable endsegments. All definable endsegments
> > have infinite intersection:
> >
> > ∀k ∈ ℕ: ∩{E(1), E(2), ..., E(k)} = E(k) /\ |E(k)| = ℵo .
> >
> > Definable endsegments cannot have an empty intersection. When you
> > show that no natnumber remains forever then it is clear that all
> > natnumbers get lost. The result is an empty endsegment. Note that all
> > intersections of endsegments are endsegments themselves.
> Idiotic nonsense.
Why? Is the equation incorrect? Or what is your handicap in understanding mathematics?
Regards, WM
[toc] | [prev] | [next] | [standalone]
Page 11 of 19 — ← Prev page 1 … 9 10 [11] 12 13 … 19 Next page →
Back to top | Article view | sci.math
csiph-web