Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > sci.logic > #165053 > unrolled thread
| Started by | George Greene <greeneg@email.unc.edu> |
|---|---|
| First post | 2017-10-14 21:15 -0700 |
| Last post | 2017-11-02 20:20 -0700 |
| Articles | 20 on this page of 190 — 16 participants |
Back to article view | Back to sci.logic
What Cantor's Theorem Actually Says George Greene <greeneg@email.unc.edu> - 2017-10-14 21:15 -0700
Re: What Cantor's Theorem Actually Says George Greene <greeneg@email.unc.edu> - 2017-10-14 21:20 -0700
Re: What Cantor's Theorem Actually Says George Greene <greeneg@email.unc.edu> - 2017-10-15 16:57 -0700
Re: What Cantor's Theorem Actually Says grahamcooper7@gmail.com - 2017-10-16 05:59 -0700
Re: What Cantor's Theorem Actually Says Rupert <rupertmccallum@yahoo.com> - 2017-11-02 20:27 -0700
Re: What Cantor's Theorem Actually Says George Greene <greeneg@email.unc.edu> - 2017-10-28 20:40 -0700
Re: What Cantor's Theorem Actually Says grahamcooper7@gmail.com - 2017-10-16 06:21 -0700
Re: What Cantor's Theorem Actually Says Peter Percival <peterxpercival@hotmail.com> - 2017-10-16 14:36 +0100
Re: What Cantor's Theorem Actually Says grahamcooper7@gmail.com - 2017-10-16 13:49 -0700
Re: What Cantor's Theorem Actually Says George Greene <greeneg@email.unc.edu> - 2017-10-16 15:04 -0700
Re: What Cantor's Theorem Actually Says grahamcooper7@gmail.com - 2017-10-16 22:57 -0700
Re: What Cantor's Theorem Actually Says "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2017-10-17 19:28 -0700
Re: What Cantor's Theorem Actually Says "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2017-10-18 22:17 -0700
Re: What Cantor's Theorem Actually Says "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2017-10-20 18:05 -0700
Re: What Cantor's Theorem Actually Says "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2017-10-22 16:14 -0700
Re: What Cantor's Theorem Actually Says WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-17 23:35 -0700
Re: What Cantor's Theorem Actually Says George Greene <greeneg@email.unc.edu> - 2017-10-21 21:08 -0700
Re: What Cantor's Theorem Actually Says Julio Di Egidio <julio@diegidio.name> - 2017-10-21 21:28 -0700
Re: What Cantor's Theorem Actually Says George Greene <greeneg@email.unc.edu> - 2017-10-21 21:48 -0700
Re: What Cantor's Theorem Actually Says Julio Di Egidio <julio@diegidio.name> - 2017-10-21 21:52 -0700
Re: What Cantor's Theorem Actually Says George Greene <greeneg@email.unc.edu> - 2017-10-22 13:14 -0700
Re: What Cantor's Theorem Actually Says Julio Di Egidio <julio@diegidio.name> - 2017-10-22 13:23 -0700
Re: What Cantor's Theorem Actually Says khongdongphong@gmail.com - 2017-10-22 20:05 -0700
Re: What Cantor's Theorem Actually Says Rupert <rupertmccallum@yahoo.com> - 2017-11-02 20:24 -0700
Re: What Cantor's Theorem Actually Says George Greene <greeneg@email.unc.edu> - 2017-10-22 21:01 -0700
Re: What Cantor's Theorem Actually Says Julio Di Egidio <julio@diegidio.name> - 2017-10-23 18:54 -0700
Re: What Cantor's Theorem Actually Says Zuhair <zaljohar@gmail.com> - 2017-10-28 01:19 -0700
Re: What Cantor's Theorem Actually Says George Greene <greeneg@email.unc.edu> - 2017-10-28 16:50 -0700
Re: What Cantor's Theorem Actually Says George Greene <greeneg@email.unc.edu> - 2017-11-06 21:27 -0800
Re: What Cantor's Theorem Actually Says George Greene <greeneg@email.unc.edu> - 2017-10-28 20:18 -0700
Re: What Cantor's Theorem Actually Says Julio Di Egidio <julio@diegidio.name> - 2017-11-01 01:26 -0700
Re: What Cantor's Theorem Actually Says Julio Di Egidio <julio@diegidio.name> - 2017-11-01 01:44 -0700
Re: What Cantor's Theorem Actually Says Zuhair <zaljohar@gmail.com> - 2017-11-01 05:07 -0700
Re: What Cantor's Theorem Actually Says "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2017-11-02 18:44 -0700
Re: What Cantor's Theorem Actually Says George Greene <greeneg@email.unc.edu> - 2017-11-02 19:58 -0700
Re: What Cantor's Theorem Actually Says Julio Di Egidio <julio@diegidio.name> - 2017-11-04 02:28 -0700
Re: What Cantor's Theorem Actually Says Julio Di Egidio <julio@diegidio.name> - 2017-11-04 02:47 -0700
Re: What Cantor's Theorem Actually Says Zuhair <zaljohar@gmail.com> - 2017-11-04 03:03 -0700
Re: What Cantor's Theorem Actually Says Julio Di Egidio <julio@diegidio.name> - 2017-11-04 23:44 -0700
Re: What Cantor's Theorem Actually Says Me <franz.fritschee.ff@gmail.com> - 2017-11-04 17:03 -0700
Re: What Cantor's Theorem Actually Says George Greene <greeneg@email.unc.edu> - 2017-11-06 21:19 -0800
Re: What Cantor's Theorem Actually Says "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2017-11-06 21:28 -0800
Re: What Cantor's Theorem Actually Says Me <franz.fritschee.ff@gmail.com> - 2017-11-07 04:44 -0800
Re: What Cantor's Theorem Actually Says Jim Burns <james.g.burns@att.net> - 2017-11-07 10:50 -0500
Re: What Cantor's Theorem Actually Says Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-07 16:33 +0000
Re: What Cantor's Theorem Actually Says George Greene <greeneg@email.unc.edu> - 2017-11-07 21:11 -0800
Re: What Cantor's Theorem Actually Says Peter Percival <peterxpercival@hotmail.com> - 2017-11-07 18:00 +0000
Re: What Cantor's Theorem Actually Says mitch <mitch@dev.null> - 2017-11-07 22:11 -0600
Re: What Cantor's Theorem Actually Says George Greene <greeneg@email.unc.edu> - 2017-11-07 21:15 -0800
Re: What Cantor's Theorem Actually Says mitch <mitch@dev.null> - 2017-11-08 05:12 -0600
Re: What Cantor's Theorem Actually Says Me <franz.fritschee.ff@gmail.com> - 2017-11-08 15:59 -0800
Re: What Cantor's Theorem Actually Says mitch <mitch@dev.null> - 2017-11-09 18:17 -0600
Re: What Cantor's Theorem Actually Says Me <franz.fritschee.ff@gmail.com> - 2017-11-09 17:04 -0800
Re: What Cantor's Theorem Actually Says khongdongphong@gmail.com - 2017-11-09 21:03 -0800
Re: What Cantor's Theorem Actually Says mitch <mitch@dev.null> - 2017-11-10 00:04 -0600
Re: What Cantor's Theorem Actually Says khongdongphong@gmail.com - 2017-11-09 21:11 -0800
Re: What Cantor's Theorem Actually Says Peter Percival <peterxpercival@hotmail.com> - 2017-11-08 15:19 +0000
Re: What Cantor's Theorem Actually Says khongdongphong@gmail.com - 2017-11-09 08:01 -0800
Re: What Cantor's Theorem Actually Says khongdongphong@gmail.com - 2017-11-09 08:11 -0800
Re: What Cantor's Theorem Actually Says Peter Percival <peterxpercival@hotmail.com> - 2017-11-09 16:22 +0000
Re: What Cantor's Theorem Actually Says Peter Percival <peterxpercival@hotmail.com> - 2017-11-09 16:15 +0000
Re: What Cantor's Theorem Actually Says khongdongphong@gmail.com - 2017-11-09 08:22 -0800
Re: What Cantor's Theorem Actually Says Peter Percival <peterxpercival@hotmail.com> - 2017-11-09 16:42 +0000
Re: What Cantor's Theorem Actually Says khongdongphong@gmail.com - 2017-11-09 08:56 -0800
Re: What Cantor's Theorem Actually Says Peter Percival <peterxpercival@hotmail.com> - 2017-11-09 18:05 +0000
Re: What Cantor's Theorem Actually Says khongdongphong@gmail.com - 2017-11-09 10:11 -0800
Re: What Cantor's Theorem Actually Says George Greene <greeneg@email.unc.edu> - 2017-11-09 22:25 -0800
Re: What Cantor's Theorem Actually Says khongdongphong@gmail.com - 2017-11-09 23:09 -0800
Re: What Cantor's Theorem Actually Says Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-09 17:27 +0000
Re: What Cantor's Theorem Actually Says Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-09 17:30 +0000
Re: What Cantor's Theorem Actually Says khongdongphong@gmail.com - 2017-11-09 09:49 -0800
Re: What Cantor's Theorem Actually Says khongdongphong@gmail.com - 2017-11-09 10:04 -0800
Re: What Cantor's Theorem Actually Says Peter Percival <peterxpercival@hotmail.com> - 2017-11-09 18:11 +0000
Re: What Cantor's Theorem Actually Says khongdongphong@gmail.com - 2017-11-09 11:01 -0800
Re: What Cantor's Theorem Actually Says Peter Percival <peterxpercival@hotmail.com> - 2017-11-09 19:11 +0000
Re: What Cantor's Theorem Actually Says khongdongphong@gmail.com - 2017-11-09 11:24 -0800
Re: What Cantor's Theorem Actually Says Peter Percival <peterxpercival@hotmail.com> - 2017-11-09 20:01 +0000
Re: What Cantor's Theorem Actually Says George Greene <greeneg@email.unc.edu> - 2017-11-09 22:34 -0800
Re: What Cantor's Theorem Actually Says khongdongphong@gmail.com - 2017-11-09 22:54 -0800
Re: What Cantor's Theorem Actually Says George Greene <greeneg@email.unc.edu> - 2017-11-09 23:12 -0800
Re: What Cantor's Theorem Actually Says khongdongphong@gmail.com - 2017-11-09 23:40 -0800
Re: What Cantor's Theorem Actually Says George Greene <greeneg@email.unc.edu> - 2017-11-17 12:22 -0800
Re: What Cantor's Theorem Actually Says George Greene <greeneg@email.unc.edu> - 2017-11-10 00:11 -0800
Re: What Cantor's Theorem Actually Says Peter Percival <peterxpercival@hotmail.com> - 2017-11-10 11:49 +0000
Re: What Cantor's Theorem Actually Says Peter Percival <peterxpercival@hotmail.com> - 2017-11-10 12:01 +0000
Re: What Cantor's Theorem Actually Says Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-09 21:35 +0000
Re: What Cantor's Theorem Actually Says George Greene <greeneg@email.unc.edu> - 2017-11-09 22:27 -0800
Re: What Cantor's Theorem Actually Says khongdongphong@gmail.com - 2017-11-09 22:47 -0800
Re: What Cantor's Theorem Actually Says George Greene <greeneg@email.unc.edu> - 2017-11-09 23:09 -0800
Re: What Cantor's Theorem Actually Says khongdongphong@gmail.com - 2017-11-09 23:19 -0800
Re: What Cantor's Theorem Actually Says Me <franz.fritschee.ff@gmail.com> - 2017-11-09 11:29 -0800
Re: What Cantor's Theorem Actually Says khongdongphong@gmail.com - 2017-11-09 12:00 -0800
Re: What Cantor's Theorem Actually Says Me <franz.fritschee.ff@gmail.com> - 2017-11-09 14:00 -0800
Re: What Cantor's Theorem Actually Says Peter Percival <peterxpercival@hotmail.com> - 2017-11-09 22:27 +0000
Re: What Cantor's Theorem Actually Says khongdongphong@gmail.com - 2017-11-09 14:57 -0800
Re: What Cantor's Theorem Actually Says Peter Percival <peterxpercival@hotmail.com> - 2017-11-09 23:01 +0000
Re: What Cantor's Theorem Actually Says Me <franz.fritschee.ff@gmail.com> - 2017-11-09 15:30 -0800
Re: What Cantor's Theorem Actually Says Julio Di Egidio <julio@diegidio.name> - 2017-11-04 01:56 -0700
Re: What Cantor's Theorem Actually Says Zuhair <zaljohar@gmail.com> - 2017-11-04 02:33 -0700
Re: What Cantor's Theorem Actually Says Julio Di Egidio <julio@diegidio.name> - 2017-11-04 02:54 -0700
Re: What Cantor's Theorem Actually Says Zuhair <zaljohar@gmail.com> - 2017-11-04 03:02 -0700
Re: What Cantor's Theorem Actually Says Julio Di Egidio <julio@diegidio.name> - 2017-11-04 03:47 -0700
Re: What Cantor's Theorem Actually Says Zuhair <zaljohar@gmail.com> - 2017-11-04 06:05 -0700
Re: What Cantor's Theorem Actually Says Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-04 15:43 +0000
Re: What Cantor's Theorem Actually Says Zuhair <zaljohar@gmail.com> - 2017-11-04 08:49 -0700
Re: What Cantor's Theorem Actually Says Zuhair <zaljohar@gmail.com> - 2017-11-04 08:50 -0700
Re: What Cantor's Theorem Actually Says Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-04 19:36 +0000
Re: What Cantor's Theorem Actually Says Julio Di Egidio <julio@diegidio.name> - 2017-11-04 13:09 -0700
Re: What Cantor's Theorem Actually Says Jim Burns <james.g.burns@att.net> - 2017-11-04 18:47 -0400
Re: What Cantor's Theorem Actually Says Julio Di Egidio <julio@diegidio.name> - 2017-11-05 00:05 -0700
Re: What Cantor's Theorem Actually Says Jim Burns <james.g.burns@att.net> - 2017-11-04 13:38 -0400
Re: What Cantor's Theorem Actually Says Zuhair <zaljohar@gmail.com> - 2017-11-04 20:22 -0700
Re: What Cantor's Theorem Actually Says Julio Di Egidio <julio@diegidio.name> - 2017-11-04 23:38 -0700
Re: What Cantor's Theorem Actually Says Julio Di Egidio <julio@diegidio.name> - 2017-11-04 11:03 -0700
Re: What Cantor's Theorem Actually Says Jim Burns <james.g.burns@att.net> - 2017-11-05 09:43 -0500
Re: What Cantor's Theorem Actually Says Julio Di Egidio <julio@diegidio.name> - 2017-11-05 01:02 -0700
Re: What Cantor's Theorem Actually Says Zuhair <zaljohar@gmail.com> - 2017-11-05 05:18 -0800
Re: What Cantor's Theorem Actually Says Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-05 15:08 +0000
Re: What Cantor's Theorem Actually Says Zuhair <zaljohar@gmail.com> - 2017-11-05 08:10 -0800
Re: What Cantor's Theorem Actually Says Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-05 16:37 +0000
Re: What Cantor's Theorem Actually Says Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2017-11-05 17:18 +0000
Re: What Cantor's Theorem Actually Says Zuhair <zaljohar@gmail.com> - 2017-11-05 09:42 -0800
Re: What Cantor's Theorem Actually Says Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-05 20:11 +0000
Re: What Cantor's Theorem Actually Says Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2017-11-05 22:17 +0000
Re: What Cantor's Theorem Actually Says Zuhair <zaljohar@gmail.com> - 2017-11-06 02:24 -0800
Re: What Cantor's Theorem Actually Says Zuhair <zaljohar@gmail.com> - 2017-11-05 09:53 -0800
Re: What Cantor's Theorem Actually Says Zuhair <zaljohar@gmail.com> - 2017-11-05 10:12 -0800
Re: What Cantor's Theorem Actually Says George Greene <greeneg@email.unc.edu> - 2017-11-07 21:26 -0800
Re: What Cantor's Theorem Actually Says "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2017-11-05 23:49 -0800
Re: What Cantor's Theorem Actually Says George Greene <greeneg@email.unc.edu> - 2017-11-07 21:23 -0800
Re: What Cantor's Theorem Actually Says Zuhair <zaljohar@gmail.com> - 2017-11-08 02:36 -0800
Re: What Cantor's Theorem Actually Says Jim Burns <james.g.burns@att.net> - 2017-11-08 07:45 -0500
Re: What Cantor's Theorem Actually Says Zuhair <zaljohar@gmail.com> - 2017-11-08 05:15 -0800
Re: What Cantor's Theorem Actually Says Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-08 15:22 +0000
Re: What Cantor's Theorem Actually Says Jim Burns <james.g.burns@att.net> - 2017-11-09 10:32 -0500
Re: What Cantor's Theorem Actually Says George Greene <greeneg@email.unc.edu> - 2017-11-08 12:18 -0800
Re: What Cantor's Theorem Actually Says Julio Di Egidio <julio@diegidio.name> - 2017-11-08 23:55 -0800
Re: What Cantor's Theorem Actually Says mitch <mitch@dev.null> - 2017-11-09 05:22 -0600
Re: What Cantor's Theorem Actually Says Julio Di Egidio <julio@diegidio.name> - 2017-11-09 15:45 -0800
Re: What Cantor's Theorem Actually Says "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2017-11-09 22:06 -0800
Re: What Cantor's Theorem Actually Says George Greene <greeneg@email.unc.edu> - 2017-11-09 22:40 -0800
Re: What Cantor's Theorem Actually Says Julio Di Egidio <julio@diegidio.name> - 2017-11-13 03:27 -0800
Re: What Cantor's Theorem Actually Says George Greene <greeneg@email.unc.edu> - 2017-11-09 23:02 -0800
Re: What Cantor's Theorem Actually Says Julio Di Egidio <julio@diegidio.name> - 2017-11-13 03:51 -0800
Re: What Cantor's Theorem Actually Says Me <franz.fritschee.ff@gmail.com> - 2017-11-13 04:17 -0800
Re: What Cantor's Theorem Actually Says Julio Di Egidio <julio@diegidio.name> - 2017-11-13 04:35 -0800
Re: What Cantor's Theorem Actually Says "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2017-11-13 06:17 -0800
Re: What Cantor's Theorem Actually Says Julio Di Egidio <julio@diegidio.name> - 2017-11-13 06:52 -0800
Re: What Cantor's Theorem Actually Says "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2017-11-13 06:56 -0800
Re: What Cantor's Theorem Actually Says Julio Di Egidio <julio@diegidio.name> - 2017-11-13 06:59 -0800
Re: What Cantor's Theorem Actually Says Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-13 17:04 +0000
Re: What Cantor's Theorem Actually Says "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2017-11-13 12:14 -0800
Re: What Cantor's Theorem Actually Says "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2017-11-15 21:26 -0800
Re: What Cantor's Theorem Actually Says "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2017-11-16 22:47 -0800
Re: What Cantor's Theorem Actually Says George Greene <greeneg@email.unc.edu> - 2017-11-15 15:19 -0800
Re: What Cantor's Theorem Actually Says Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-16 00:15 +0000
Re: What Cantor's Theorem Actually Says George Greene <greeneg@email.unc.edu> - 2017-11-16 18:00 -0800
Re: What Cantor's Theorem Actually Says Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-17 02:12 +0000
Re: What Cantor's Theorem Actually Says Julio Di Egidio <julio@diegidio.name> - 2017-11-19 09:12 -0800
Re: What Cantor's Theorem Actually Says "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2017-11-19 09:34 -0800
Re: What Cantor's Theorem Actually Says Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-19 20:53 +0000
Re: What Cantor's Theorem Actually Says "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2017-11-21 22:38 -0800
Re: What Cantor's Theorem Actually Says George Greene <greeneg@email.unc.edu> - 2017-11-19 13:58 -0800
Re: What Cantor's Theorem Actually Says Julio Di Egidio <julio@diegidio.name> - 2017-11-19 16:11 -0800
Re: What Cantor's Theorem Actually Says George Greene <greeneg@email.unc.edu> - 2017-11-27 21:18 -0800
Re: What Cantor's Theorem Actually Says "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2017-11-28 18:54 -0800
Re: What Cantor's Theorem Actually Says Julio Di Egidio <julio@diegidio.name> - 2017-12-01 07:43 -0800
Re: What Cantor's Theorem Actually Says "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2017-12-01 23:20 -0800
Re: What Cantor's Theorem Actually Says Julio Di Egidio <julio@diegidio.name> - 2017-12-02 07:09 -0800
Re: What Cantor's Theorem Actually Says "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2017-12-02 10:06 -0800
Re: What Cantor's Theorem Actually Says "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2017-12-10 20:18 -0800
Re: What Cantor's Theorem Actually Says Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2017-11-13 12:36 +0000
Re: What Cantor's Theorem Actually Says Julio Di Egidio <julio@diegidio.name> - 2017-11-13 04:49 -0800
Re: What Cantor's Theorem Actually Says Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2017-11-13 13:39 +0000
Re: What Cantor's Theorem Actually Says Julio Di Egidio <julio@diegidio.name> - 2017-11-13 06:14 -0800
Re: What Cantor's Theorem Actually Says Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2017-11-13 15:50 +0000
Re: What Cantor's Theorem Actually Says Jim Burns <james.g.burns@att.net> - 2017-11-13 11:40 -0500
Re: What Cantor's Theorem Actually Says "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2017-11-08 19:16 -0800
Re: What Cantor's Theorem Actually Says Zeit Geist <Tucsondrew@me.com> - 2017-11-08 19:47 -0800
Re: What Cantor's Theorem Actually Says "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2017-11-09 21:55 -0800
Re: What Cantor's Theorem Actually Says mitch <mitch@dev.null> - 2017-11-05 14:58 -0600
Re: What Cantor's Theorem Actually Says Julio Di Egidio <julio@diegidio.name> - 2017-11-06 13:29 -0800
Re: What Cantor's Theorem Actually Says Julio Di Egidio <julio@diegidio.name> - 2017-11-06 13:39 -0800
Re: What Cantor's Theorem Actually Says mitch <mitch@dev.null> - 2017-11-06 18:37 -0600
Re: What Cantor's Theorem Actually Says Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-07 00:53 +0000
Re: What Cantor's Theorem Actually Says mitch <mitch@dev.null> - 2017-11-07 19:11 -0600
Re: What Cantor's Theorem Actually Says Julio Di Egidio <julio@diegidio.name> - 2017-11-06 23:38 -0800
Re: What Cantor's Theorem Actually Says George Greene <greeneg@email.unc.edu> - 2017-10-28 21:01 -0700
Re: What Cantor's Theorem Actually Says Julio Di Egidio <julio@diegidio.name> - 2017-11-01 01:20 -0700
Re: What Cantor's Theorem Actually Says Rupert <rupertmccallum@yahoo.com> - 2017-11-02 20:20 -0700
Page 7 of 10 — ← Prev page 1 … 5 6 [7] 8 9 10 Next page →
| From | Mike Terry <news.dead.person.stones@darjeeling.plus.com> |
|---|---|
| Date | 2017-11-05 17:18 +0000 |
| Message-ID | <h7adnfBPT85N2mLEnZ2dnUU78Q3NnZ2d@brightview.co.uk> |
| In reply to | #166337 |
On 05/11/2017 16:10, Zuhair wrote: > On Sunday, November 5, 2017 at 6:08:58 PM UTC+3, Ben Bacarisse wrote: >> Zuhair <zaljohar@gmail.com> writes: >> <snip> >>> By the way, how did Cantor get rid of those duplications, I call a >>> decimal sequence a "duplicate" if there exists another decimal >>> sequence that represents the same real number it represents. >> >> I don't think Cantor ever used decimal sequences. He published several >> theorems about uncountability starting about 1871 with a proof of the >> uncountability of the reals that uses a sequence of intervals. Another, >> a few years later, concerns the uncountability of certain closed subsets >> of R^n. It's not until a short paper of 1892 that an explicit diagonal >> argument is presented, and that is done with sequences of two symbols, w >> and m. The diagonal replaces w with m and vice-versa. >> >>> I mean why not the diagonal be a duplicate of one of the decimal >>> sequences present in the diagonalized set? >> >> The simplest way to avoid that is to use a set of (0, 1). For example >> limit yourself to using only the digits 4 and 5. >> >> -- >> Ben. > > even if one limits matters to binary sequences still there are duplicates, see: > > 0.111100000000000000000000 > 0.111011111111111111111111 > > are duplicates. > > However I think the answer is to prove that any set of binary sequences that contains ALL duplicates among its elements cannot be countable! since the diagonal over any such set cannot be an element of that set, thus it doesn't have a duplicate, so it cannot represent a real that is in that set! So the reals are uncountable, because if they were the above sets must be countable also. > That's rather messy, but there is a simple "clean" way of avoiding all this if you really feel you must use base-2 representations. Treat the digit string as consisting of *pairs* of digits. (This effectively makes them like base-4 representations.) Now we can apply the diagonal argument to the pairs of digits, but ensuring the replacement digit pairs are only 01 and 10. This way there is no scope for duplicates of the antidiagonal. Regards, Mike. > I think this is how we overcome the rather trivial argument of duplication. > > However if one thinks that each real can have infinitely many duplicates > representing it, although I think this seems impossible?! then > of course, the whole argument fails. >
[toc] | [prev] | [next] | [standalone]
| From | Zuhair <zaljohar@gmail.com> |
|---|---|
| Date | 2017-11-05 09:42 -0800 |
| Message-ID | <17c644d8-5f66-4700-99ad-15e81678e8f2@googlegroups.com> |
| In reply to | #166355 |
On Sunday, November 5, 2017 at 8:18:09 PM UTC+3, Mike Terry wrote: > On 05/11/2017 16:10, Zuhair wrote: > > On Sunday, November 5, 2017 at 6:08:58 PM UTC+3, Ben Bacarisse wrote: > >> Zuhair <zaljohar@gmail.com> writes: > >> <snip> > >>> By the way, how did Cantor get rid of those duplications, I call a > >>> decimal sequence a "duplicate" if there exists another decimal > >>> sequence that represents the same real number it represents. > >> > >> I don't think Cantor ever used decimal sequences. He published several > >> theorems about uncountability starting about 1871 with a proof of the > >> uncountability of the reals that uses a sequence of intervals. Another, > >> a few years later, concerns the uncountability of certain closed subsets > >> of R^n. It's not until a short paper of 1892 that an explicit diagonal > >> argument is presented, and that is done with sequences of two symbols, w > >> and m. The diagonal replaces w with m and vice-versa. > >> > >>> I mean why not the diagonal be a duplicate of one of the decimal > >>> sequences present in the diagonalized set? > >> > >> The simplest way to avoid that is to use a set of (0, 1). For example > >> limit yourself to using only the digits 4 and 5. > >> > >> -- > >> Ben. > > > > even if one limits matters to binary sequences still there are duplicates, see: > > > > 0.111100000000000000000000 > > 0.111011111111111111111111 > > > > are duplicates. > > > > However I think the answer is to prove that any set of binary sequences that contains ALL duplicates among its elements cannot be countable! since the diagonal over any such set cannot be an element of that set, thus it doesn't have a duplicate, so it cannot represent a real that is in that set! So the reals are uncountable, because if they were the above sets must be countable also. > > > > That's rather messy, but there is a simple "clean" way of avoiding all > this if you really feel you must use base-2 representations. Treat the > digit string as consisting of *pairs* of digits. (This effectively > makes them like base-4 representations.) Now we can apply the diagonal > argument to the pairs of digits, but ensuring the replacement digit > pairs are only 01 and 10. This way there is no scope for duplicates of > the antidiagonal. > > Regards, > Mike. > > I didn't get what you mean, what about 00 and 11 those also should be paired arn't they??? I think my argument is much simpler.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2017-11-05 20:11 +0000 |
| Message-ID | <87a800wko3.fsf@bsb.me.uk> |
| In reply to | #166363 |
Zuhair <zaljohar@gmail.com> writes: > On Sunday, November 5, 2017 at 8:18:09 PM UTC+3, Mike Terry wrote: >> On 05/11/2017 16:10, Zuhair wrote: <snip> >> > 0.111100000000000000000000 >> > 0.111011111111111111111111 >> > >> > are duplicates. <snip> >> [...] there is a simple "clean" way of avoiding all >> this if you really feel you must use base-2 representations. Treat the >> digit string as consisting of *pairs* of digits. (This effectively >> makes them like base-4 representations.) Now we can apply the diagonal >> argument to the pairs of digits, but ensuring the replacement digit >> pairs are only 01 and 10. This way there is no scope for duplicates of >> the antidiagonal. > > I didn't get what you mean, what about 00 and 11 those also should be > paired arn't they??? I think my argument is much simpler. MT means to restrict the pairs used in the constructed diagonal. Here's a typical list with the digits paired up for convenience: 0.[11]11 01 01 10 10 ... 0. 01[01]01 11 01 00 ... 0. 00 11[10]00 10 01 ... 0. 10 01 01[00]11 01 ... The anti-diagonal is made by mapping, say, 01 to 10 and everything else to 01. Here you'd get 0.01 10 01 01... The point is that you can now never get ...00000.... or ...11111.... -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Mike Terry <news.dead.person.stones@darjeeling.plus.com> |
|---|---|
| Date | 2017-11-05 22:17 +0000 |
| Message-ID | <ooWdnTO0Oo18EGLEnZ2dnUU78RPNnZ2d@brightview.co.uk> |
| In reply to | #166371 |
On 05/11/2017 20:11, Ben Bacarisse wrote: > Zuhair <zaljohar@gmail.com> writes: > >> On Sunday, November 5, 2017 at 8:18:09 PM UTC+3, Mike Terry wrote: >>> On 05/11/2017 16:10, Zuhair wrote: > <snip> >>>> 0.111100000000000000000000 >>>> 0.111011111111111111111111 >>>> >>>> are duplicates. > <snip> >>> [...] there is a simple "clean" way of avoiding all >>> this if you really feel you must use base-2 representations. Treat the >>> digit string as consisting of *pairs* of digits. (This effectively >>> makes them like base-4 representations.) Now we can apply the diagonal >>> argument to the pairs of digits, but ensuring the replacement digit >>> pairs are only 01 and 10. This way there is no scope for duplicates of >>> the antidiagonal. >> >> I didn't get what you mean, what about 00 and 11 those also should be >> paired arn't they??? I think my argument is much simpler. > > MT means to restrict the pairs used in the constructed diagonal. > > Here's a typical list with the digits paired up for convenience: > > 0.[11]11 01 01 10 10 ... > 0. 01[01]01 11 01 00 ... > 0. 00 11[10]00 10 01 ... > 0. 10 01 01[00]11 01 ... > > The anti-diagonal is made by mapping, say, 01 to 10 and everything else > to 01. Here you'd get 0.01 10 01 01... The point is that you can now > never get ...00000.... or ...11111.... > Exactly, I'll cancel the reply I was making, as yours is clearer! Mike.
[toc] | [prev] | [next] | [standalone]
| From | Zuhair <zaljohar@gmail.com> |
|---|---|
| Date | 2017-11-06 02:24 -0800 |
| Message-ID | <b5185b1a-fdf9-44ad-a8ef-e03845df575d@googlegroups.com> |
| In reply to | #166371 |
On Sunday, November 5, 2017 at 11:11:10 PM UTC+3, Ben Bacarisse wrote: > Zuhair <zaljohar@gmail.com> writes: > > > On Sunday, November 5, 2017 at 8:18:09 PM UTC+3, Mike Terry wrote: > >> On 05/11/2017 16:10, Zuhair wrote: > <snip> > >> > 0.111100000000000000000000 > >> > 0.111011111111111111111111 > >> > > >> > are duplicates. > <snip> > >> [...] there is a simple "clean" way of avoiding all > >> this if you really feel you must use base-2 representations. Treat the > >> digit string as consisting of *pairs* of digits. (This effectively > >> makes them like base-4 representations.) Now we can apply the diagonal > >> argument to the pairs of digits, but ensuring the replacement digit > >> pairs are only 01 and 10. This way there is no scope for duplicates of > >> the antidiagonal. > > > > I didn't get what you mean, what about 00 and 11 those also should be > > paired arn't they??? I think my argument is much simpler. > > MT means to restrict the pairs used in the constructed diagonal. > > Here's a typical list with the digits paired up for convenience: > > 0.[11]11 01 01 10 10 ... > 0. 01[01]01 11 01 00 ... > 0. 00 11[10]00 10 01 ... > 0. 10 01 01[00]11 01 ... > > The anti-diagonal is made by mapping, say, 01 to 10 and everything else > to 01. Here you'd get 0.01 10 01 01... The point is that you can now > never get ...00000.... or ...11111.... > > -- > Ben. OK, that's nice, thanks for this clarification.
[toc] | [prev] | [next] | [standalone]
| From | Zuhair <zaljohar@gmail.com> |
|---|---|
| Date | 2017-11-05 09:53 -0800 |
| Message-ID | <8bcf9ecc-aff1-4726-b034-fd1ca905b415@googlegroups.com> |
| In reply to | #166355 |
On Sunday, November 5, 2017 at 8:18:09 PM UTC+3, Mike Terry wrote: > On 05/11/2017 16:10, Zuhair wrote: > > On Sunday, November 5, 2017 at 6:08:58 PM UTC+3, Ben Bacarisse wrote: > >> Zuhair <zaljohar@gmail.com> writes: > >> <snip> > >>> By the way, how did Cantor get rid of those duplications, I call a > >>> decimal sequence a "duplicate" if there exists another decimal > >>> sequence that represents the same real number it represents. > >> > >> I don't think Cantor ever used decimal sequences. He published several > >> theorems about uncountability starting about 1871 with a proof of the > >> uncountability of the reals that uses a sequence of intervals. Another, > >> a few years later, concerns the uncountability of certain closed subsets > >> of R^n. It's not until a short paper of 1892 that an explicit diagonal > >> argument is presented, and that is done with sequences of two symbols, w > >> and m. The diagonal replaces w with m and vice-versa. > >> > >>> I mean why not the diagonal be a duplicate of one of the decimal > >>> sequences present in the diagonalized set? > >> > >> The simplest way to avoid that is to use a set of (0, 1). For example > >> limit yourself to using only the digits 4 and 5. > >> > >> -- > >> Ben. > > > > even if one limits matters to binary sequences still there are duplicates, see: > > > > 0.111100000000000000000000 > > 0.111011111111111111111111 > > > > are duplicates. > > > > However I think the answer is to prove that any set of binary sequences that contains ALL duplicates among its elements cannot be countable! since the diagonal over any such set cannot be an element of that set, thus it doesn't have a duplicate, so it cannot represent a real that is in that set! So the reals are uncountable, because if they were the above sets must be countable also. > > > > That's rather messy, but there is a simple "clean" way of avoiding all > this if you really feel you must use base-2 representations. Treat the > digit string as consisting of *pairs* of digits. (This effectively > makes them like base-4 representations.) Now we can apply the diagonal > argument to the pairs of digits, but ensuring the replacement digit > pairs are only 01 and 10. This way there is no scope for duplicates of > the antidiagonal. > > Regards, > Mike. > > > > I think this is how we overcome the rather trivial argument of duplication. > > > > However if one thinks that each real can have infinitely many duplicates > > representing it, although I think this seems impossible?! then > > of course, the whole argument fails. > > my argument is simpler, Let S be any set of binary sequences such that EVERY duplicate binary sequence is an element of S (of course S can contain binary sequences that are not doublicates), now diagonalize S and the anti-diagonal would be a binary sequence that is not an element of S, but since S containes ALL of the duplicate binary sequences, then the anti-diagonal is not a duplicate binary sequence, and so it represents a real that non of the elements of S represents, this applies to every countable set S with this qualification, so the reals are uncountable!
[toc] | [prev] | [next] | [standalone]
| From | Zuhair <zaljohar@gmail.com> |
|---|---|
| Date | 2017-11-05 10:12 -0800 |
| Message-ID | <abf3f2fb-0cab-48a2-a51c-e16d84e2fbe5@googlegroups.com> |
| In reply to | #166366 |
On Sunday, November 5, 2017 at 8:53:26 PM UTC+3, Zuhair wrote: > On Sunday, November 5, 2017 at 8:18:09 PM UTC+3, Mike Terry wrote: > > On 05/11/2017 16:10, Zuhair wrote: > > > On Sunday, November 5, 2017 at 6:08:58 PM UTC+3, Ben Bacarisse wrote: > > >> Zuhair <zaljohar@gmail.com> writes: > > >> <snip> > > >>> By the way, how did Cantor get rid of those duplications, I call a > > >>> decimal sequence a "duplicate" if there exists another decimal > > >>> sequence that represents the same real number it represents. > > >> > > >> I don't think Cantor ever used decimal sequences. He published several > > >> theorems about uncountability starting about 1871 with a proof of the > > >> uncountability of the reals that uses a sequence of intervals. Another, > > >> a few years later, concerns the uncountability of certain closed subsets > > >> of R^n. It's not until a short paper of 1892 that an explicit diagonal > > >> argument is presented, and that is done with sequences of two symbols, w > > >> and m. The diagonal replaces w with m and vice-versa. > > >> > > >>> I mean why not the diagonal be a duplicate of one of the decimal > > >>> sequences present in the diagonalized set? > > >> > > >> The simplest way to avoid that is to use a set of (0, 1). For example > > >> limit yourself to using only the digits 4 and 5. > > >> > > >> -- > > >> Ben. > > > > > > even if one limits matters to binary sequences still there are duplicates, see: > > > > > > 0.111100000000000000000000 > > > 0.111011111111111111111111 > > > > > > are duplicates. > > > > > > However I think the answer is to prove that any set of binary sequences that contains ALL duplicates among its elements cannot be countable! since the diagonal over any such set cannot be an element of that set, thus it doesn't have a duplicate, so it cannot represent a real that is in that set! So the reals are uncountable, because if they were the above sets must be countable also. > > > > > > > That's rather messy, but there is a simple "clean" way of avoiding all > > this if you really feel you must use base-2 representations. Treat the > > digit string as consisting of *pairs* of digits. (This effectively > > makes them like base-4 representations.) Now we can apply the diagonal > > argument to the pairs of digits, but ensuring the replacement digit > > pairs are only 01 and 10. This way there is no scope for duplicates of > > the antidiagonal. > > > > Regards, > > Mike. > > > > > > > I think this is how we overcome the rather trivial argument of duplication. > > > > > > However if one thinks that each real can have infinitely many duplicates > > > representing it, although I think this seems impossible?! then > > > of course, the whole argument fails. > > > > > my argument is simpler, Let S be any set of binary sequences such > that EVERY duplicate binary sequence is an element of S (of course > S can contain binary sequences that are not doublicates), now > diagonalize S and the anti-diagonal would be a binary sequence > that is not an element of S, but since S containes ALL of the duplicate binary sequences, then the anti-diagonal is not a duplicate binary sequence, and so it represents a real that non of the elements of S represents, this applies to every countable set S with this qualification, so the reals are uncountable! Because the set of all reals meets the qualifications of S, so if we run the above argument over it, then the anti-diagonal would represent a real that is outside it! A contradiction. So the set of all reals cannot be countable. However this looks in some sense impredicative!
[toc] | [prev] | [next] | [standalone]
| From | George Greene <greeneg@email.unc.edu> |
|---|---|
| Date | 2017-11-07 21:26 -0800 |
| Message-ID | <a303189f-855d-44e1-ab31-c547a1616b3e@googlegroups.com> |
| In reply to | #166367 |
On Sunday, November 5, 2017 at 1:12:13 PM UTC-5, Zuhair wrote:
> Because the set of all reals meets the qualifications of S,
No, it doesn't. S HAS TO BE LISTABLE. You have to be able TO MAP EVERY NATURAL to an element of S. If S is all the reals THEN YOU CAN'T DO THAT.
> so if we run the above argument over it,
> then the anti-diagonal would
> represent a real that is outside it! A contradiction.
Again, DUH.
> So the set of all reals cannot be countable.
> However this looks in some sense impredicative!
{seDom(f):~sef(s)} DOES NOT look impredicative and THAT IS the definition of the anti-diagonal.
Why must you insist on complicating this given that IT REALLY IS AS SIMPLE AS that one line?
The only thing THAT quantifies over is Dom(f) which is TWO RANKS LOWER than f itself!
[toc] | [prev] | [next] | [standalone]
| From | "Ross A. Finlayson" <ross.finlayson@gmail.com> |
|---|---|
| Date | 2017-11-05 23:49 -0800 |
| Message-ID | <1bfc8e85-a798-476c-a89b-05b149937bad@googlegroups.com> |
| In reply to | #166366 |
On Sunday, November 5, 2017 at 9:53:26 AM UTC-8, Zuhair wrote: > On Sunday, November 5, 2017 at 8:18:09 PM UTC+3, Mike Terry wrote: > > On 05/11/2017 16:10, Zuhair wrote: > > > On Sunday, November 5, 2017 at 6:08:58 PM UTC+3, Ben Bacarisse wrote: > > >> Zuhair <zaljohar@gmail.com> writes: > > >> <snip> > > >>> By the way, how did Cantor get rid of those duplications, I call a > > >>> decimal sequence a "duplicate" if there exists another decimal > > >>> sequence that represents the same real number it represents. > > >> > > >> I don't think Cantor ever used decimal sequences. He published several > > >> theorems about uncountability starting about 1871 with a proof of the > > >> uncountability of the reals that uses a sequence of intervals. Another, > > >> a few years later, concerns the uncountability of certain closed subsets > > >> of R^n. It's not until a short paper of 1892 that an explicit diagonal > > >> argument is presented, and that is done with sequences of two symbols, w > > >> and m. The diagonal replaces w with m and vice-versa. > > >> > > >>> I mean why not the diagonal be a duplicate of one of the decimal > > >>> sequences present in the diagonalized set? > > >> > > >> The simplest way to avoid that is to use a set of (0, 1). For example > > >> limit yourself to using only the digits 4 and 5. > > >> > > >> -- > > >> Ben. > > > > > > even if one limits matters to binary sequences still there are duplicates, see: > > > > > > 0.111100000000000000000000 > > > 0.111011111111111111111111 > > > > > > are duplicates. > > > > > > However I think the answer is to prove that any set of binary sequences that contains ALL duplicates among its elements cannot be countable! since the diagonal over any such set cannot be an element of that set, thus it doesn't have a duplicate, so it cannot represent a real that is in that set! So the reals are uncountable, because if they were the above sets must be countable also. > > > > > > > That's rather messy, but there is a simple "clean" way of avoiding all > > this if you really feel you must use base-2 representations. Treat the > > digit string as consisting of *pairs* of digits. (This effectively > > makes them like base-4 representations.) Now we can apply the diagonal > > argument to the pairs of digits, but ensuring the replacement digit > > pairs are only 01 and 10. This way there is no scope for duplicates of > > the antidiagonal. > > > > Regards, > > Mike. > > > > > > > I think this is how we overcome the rather trivial argument of duplication. > > > > > > However if one thinks that each real can have infinitely many duplicates > > > representing it, although I think this seems impossible?! then > > > of course, the whole argument fails. > > > > > my argument is simpler, Let S be any set of binary sequences such > that EVERY duplicate binary sequence is an element of S (of course > S can contain binary sequences that are not doublicates), now > diagonalize S and the anti-diagonal would be a binary sequence > that is not an element of S, but since S containes ALL of the duplicate binary sequences, then the anti-diagonal is not a duplicate binary sequence, and so it represents a real that non of the elements of S represents, this applies to every countable set S with this qualification, so the reals are uncountable! There's only one function (sweep) between the naturals and the (unit interval of the) reals, quite all the sequences there would look to start with zeros, but half of them don't. This is again "Cantor proves the line is drawn". I find this search in foundations yet rather refreshing and I'm more confident that the logical content as what I've written here will be making much more sense. About infinity in the numbers, for example Russell (the paradox) as applied to just the finite (and why that sank Frege but not Cantor) there is that there. Some do see that usual axioms of ZF set theory of regularity and infinity as restriction of comprehension and in the results of which "impredicative" as from these other results as would exist for Frege.
[toc] | [prev] | [next] | [standalone]
| From | George Greene <greeneg@email.unc.edu> |
|---|---|
| Date | 2017-11-07 21:23 -0800 |
| Message-ID | <17e3c2d6-c341-4c15-948a-c796f1d45509@googlegroups.com> |
| In reply to | #166366 |
On Sunday, November 5, 2017 at 12:53:26 PM UTC-5, Zuhair wrote: > my argument is simpler, Let S be any set of binary sequences such > that EVERY duplicate binary sequence is an element of S This is completely incoherent. If S is a set then it canNOT HAVE DUPLICATES, PERIOD. Every element in the universe occurs either 1 time or 0 times in S. What could you EVEN MEAN BY "duplicate binary sequence"?? The sequence ending in 10000... and the sequence ending in 01111... ARE DIFFERENT sequences EVEN if they encode the same rational number. If you decide to always have both of them then NOTHING CHANGES. The anti-diagonal is still not on the list. > now diagonalize S and the anti-diagonal > would be a binary sequence > that is not an element of S, obviously. > but since S containes ALL of the duplicate binary sequences, > then the anti-diagonal is not a duplicate binary sequence, Again, obviously. > and so it represents a real that non of the elements of S represents, Again, obviously, and this would be even more obvious if S DIDN'T contain all "duplicate" binary sequences. The anti-diagonal of S is not in S, DUH, since the anti-diagonal is based on an enumeration and the anti-diagonal differs from the nth element of S, FOR EVERY n, in the nth place. > this applies to every countable set S with > this qualification, so the reals are uncountable! Well, OF COURSE! WHICH side of the question were you even TRYING to argue? The proof applies TO ANY list of bit-strings. Whether it is or isn't infinitely wide and whether it does or doesn't contain any duplicates IS NOT relevant. As long as it is not longer than it is wide, its anti-diagonal IS NOT on it. Your argument (because it is Cantor's argument) Doesn't make any use of the presence or absence of "duplicate" sequences AT ALL.
[toc] | [prev] | [next] | [standalone]
| From | Zuhair <zaljohar@gmail.com> |
|---|---|
| Date | 2017-11-08 02:36 -0800 |
| Message-ID | <f6f5e258-ded7-427c-8fc5-0bcaa71c23db@googlegroups.com> |
| In reply to | #166478 |
On Wednesday, November 8, 2017 at 8:23:20 AM UTC+3, George Greene wrote: > On Sunday, November 5, 2017 at 12:53:26 PM UTC-5, Zuhair wrote: > > my argument is simpler, Let S be any set of binary sequences such > > that EVERY duplicate binary sequence is an element of S > > This is completely incoherent. If S is a set then it canNOT HAVE DUPLICATES, PERIOD. Every element in the universe occurs either 1 time or 0 times in S. > What could you EVEN MEAN BY "duplicate binary sequence"?? > The sequence ending in 10000... and the sequence ending in 01111... ARE DIFFERENT sequences EVEN if they encode the same rational number. If you decide to always have both of them then NOTHING CHANGES. The anti-diagonal is still not on the list. > > > > now diagonalize S and the anti-diagonal > > would be a binary sequence > > that is not an element of S, > > obviously. > > > but since S containes ALL of the duplicate binary sequences, > > then the anti-diagonal is not a duplicate binary sequence, > > Again, obviously. > > > and so it represents a real that non of the elements of S represents, > > Again, obviously, and this would be even more obvious if S DIDN'T contain all "duplicate" binary sequences. The anti-diagonal of S is not in S, DUH, since > the anti-diagonal is based on an enumeration and the anti-diagonal differs from the nth element of S, FOR EVERY n, in the nth place. > > > this applies to every countable set S with > > this qualification, so the reals are uncountable! > > Well, OF COURSE! WHICH side of the question were you even TRYING to argue? > > The proof applies TO ANY list of bit-strings. > Whether it is or isn't infinitely wide and whether it does or doesn't contain any duplicates IS NOT relevant. As long as it is not longer than it is wide, its anti-diagonal IS NOT on it. Your argument (because it is Cantor's argument) Doesn't make any use of the presence or absence of "duplicate" sequences AT ALL. You arrived late here so you didn't get the context of the argument. The idea is that we want to prove uncountability of the *reals* Julio Di Egidio here said that the infinite binary sequences are not the reals, some reals can be represented by two distinct infinite binary sequences, so even if the list of all infinite binary sequences are proved uncountable it doesn't mean that the reals are uncountable! The idea is that if we take ANY set S of infinite binary sequences, the anti-diagonal over S will be an infinite binary sequence that is indeed different from all elements of S, yes, but it might still represent a real that is represented by an element of S! and thus we didn't show the existence of an extra-real to the reals represented by elements of S. Let me illustrate this for you to see: take the following sequence of infinite binary sequences 1 : 0.10000....... 2 : 0.00100....... 3 : 0.000100...... .. i.e. the first term in the sequence is 0.10000.... then each ith term of the sequence (for i>1) is the sequence 0.i many 0s 1000...... Now the anti-diagonal is 0.01111..... this is, of course, a sequence that is not present in the above list of sequences, but it represents the same real the first term of the list represents! since 0.1000... = 0.0111... in the binary system. So the diagonal argument framed as such doesn't illustrate an addition of an extra "real" over reals represented by elements of the diagonalized list. In order to overcome that we let S to be a "SET" of infinite binary sequences that contains all duplicate infinite binary sequences among its elements. "a duplicate sequence" is a sequence that has a distinct sequence from it representing the same real it represents. In this way, the anti-diagonal over S will be an infinite binary sequence that represents a real that is not represented by any element of S! and thus we proved the existence of an extra-real to the set of all reals represented by elements of S (qualified as above) as long as S is countable. Since the set R of ALL reals has the same qualification of S (i.e. R is a SET that has all duplicate infinite binary sequences among its elements), then R cannot be countable.
[toc] | [prev] | [next] | [standalone]
| From | Jim Burns <james.g.burns@att.net> |
|---|---|
| Date | 2017-11-08 07:45 -0500 |
| Message-ID | <fd1a69a4-fede-2331-18e2-4bfa36baeea3@att.net> |
| In reply to | #166483 |
On 11/8/2017 5:36 AM, Zuhair wrote:
> The idea is that we want to prove uncountability of the
> *reals* Julio Di Egidio here said that the infinite
> binary sequences are not the reals, some reals can be
> represented by two distinct infinite binary sequences,
> so even if the list of all infinite binary sequences are
> proved uncountable it doesn't mean that the reals are
> uncountable!
Zuhair, is it possible that Julio Di Egidio sees the
exchange in significantly different terms?
Given this context, his earlier complaint doesn't make sense.
<JDE<Z>>
> Thanks a lot, I really expected that. So that said it is
> obvious then how Cantor's argument relates to the reals.
> Because if we exclude those reals that end with an infinite
> tail of 0s or infinite tail of 9s then, and prove that the
> left reals can be diagonalized and thus uncountable, then
> clearly the whole reals wouldn't be countable.
He is fucking evaluating real numbers, you moron_s_!
</JDE<Z>>
Given your context, what I showed was perfectly on point.
Yes, I _was_ fucking evaluating real numbers, and that
supported the usual argument for the uncountability of the
reals. So, I wonder if JDE sees a different context.
Also, the usual diagonal argument for the uncountability
of real numbers _as represented by infinite decimals_
takes multiple representations of the same real into
account -- by avoiding trailing 9s and trailing 0s in the
anti-diagonal. The pieces of this conversation do not
fit together.
[toc] | [prev] | [next] | [standalone]
| From | Zuhair <zaljohar@gmail.com> |
|---|---|
| Date | 2017-11-08 05:15 -0800 |
| Message-ID | <6ccd24ed-6c36-43a2-ad87-b41eb57223ea@googlegroups.com> |
| In reply to | #166486 |
On Wednesday, November 8, 2017 at 3:45:32 PM UTC+3, Jim Burns wrote: > On 11/8/2017 5:36 AM, Zuhair wrote: > > > The idea is that we want to prove uncountability of the > > *reals* Julio Di Egidio here said that the infinite > > binary sequences are not the reals, some reals can be > > represented by two distinct infinite binary sequences, > > so even if the list of all infinite binary sequences are > > proved uncountable it doesn't mean that the reals are > > uncountable! > > Zuhair, is it possible that Julio Di Egidio sees the > exchange in significantly different terms? > > Given this context, his earlier complaint doesn't make sense. > <JDE<Z>> > > Thanks a lot, I really expected that. So that said it is > > obvious then how Cantor's argument relates to the reals. > > Because if we exclude those reals that end with an infinite > > tail of 0s or infinite tail of 9s then, and prove that the > > left reals can be diagonalized and thus uncountable, then > > clearly the whole reals wouldn't be countable. > > He is fucking evaluating real numbers, you moron_s_! > </JDE<Z>> > > Given your context, what I showed was perfectly on point. > Yes, I _was_ fucking evaluating real numbers, and that > supported the usual argument for the uncountability of the > reals. So, I wonder if JDE sees a different context. > > Also, the usual diagonal argument for the uncountability > of real numbers _as represented by infinite decimals_ > takes multiple representations of the same real into > account -- by avoiding trailing 9s and trailing 0s in the > anti-diagonal. The pieces of this conversation do not > fit together. I don't see how this works? I mean by avoiding trailing 9s and trailing 0s? the anti-diagonal can still have a trailing 9 or a trailing 0, truly it would represent an extra real to the reals represented by the elements of the diagonalized set, however that extra real itself cannot be an element of another set having the same qualifiation of not having a trailing 9 or a trailing 0, so we cannot prove that every set of reals with non-trailing end, is not countable? Zuhair
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2017-11-08 15:22 +0000 |
| Message-ID | <otve9b$11ju$2@gioia.aioe.org> |
| In reply to | #166487 |
Original reply did not get through. I hope this does not end up a duplicate... Zuhair <zaljohar@gmail.com> writes: > On Wednesday, November 8, 2017 at 3:45:32 PM UTC+3, Jim Burns wrote: <snip> >> Also, the usual diagonal argument for the uncountability >> of real numbers _as represented by infinite decimals_ >> takes multiple representations of the same real into >> account -- by avoiding trailing 9s and trailing 0s in the >> anti-diagonal. The pieces of this conversation do not >> fit together. > > I don't see how this works? I mean by avoiding trailing 9s and > trailing 0s? the anti-diagonal can still have a trailing 9 or a > trailing 0, Not if you never choose a 0 or a 9 when constructing the anti-diagonal. For example, when d_k = 1 pick 2, for all other digits, pick 1. The constructed number will consist only of decimal 1s and 2s. <snip> -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Jim Burns <james.g.burns@att.net> |
|---|---|
| Date | 2017-11-09 10:32 -0500 |
| Message-ID | <45224757-e11a-f775-82fb-1bc89a612bb9@att.net> |
| In reply to | #166487 |
On 11/8/2017 8:15 AM, Zuhair wrote:
> On Wednesday, November 8, 2017 at 3:45:32 PM UTC+3,
> Jim Burns wrote:
>> Also, the usual diagonal argument for the uncountability
>> of real numbers _as represented by infinite decimals_
>> takes multiple representations of the same real into
>> account -- by avoiding trailing 9s and trailing 0s in the
>> anti-diagonal. The pieces of this conversation do not
>> fit together.
>
> I don't see how this works? I mean by avoiding trailing 9s
> and trailing 0s? the anti-diagonal can still have a
> trailing 9 or a trailing 0,
In the argument I'm calling the usual one, the anti-diagonal
_cannot_ have trailing 9s or trailing 0s. The rule for
"This digit is different" is set up so that this is so.
> truly it would represent an extra real to the
> reals represented by the elements of the diagonalized set,
> however that extra real itself cannot be an element of
> another set having the same qualifiation of not having a
> trailing 9 or a trailing 0, so we cannot prove that every
> set of reals with non-trailing end, is not countable?
I got lost in the dependent clauses of that sentence.
The list of reals (list: N -> R) is proven to be incomplete.
Let
x: N -> 10 be one infinite decimal representation,
10 = {0,1,2,3,4,5,6,7,8,9})
10^N be the set of all infinite decimal representations, and
eval: 10^N -> R be the usual evaluation function of infinite
decimal representations (limits of finite partial sums)
"The usual proof" involving decimal representations says that
the list of real numbers _as represented by this list of_
_infinite decimals_ is incomplete. We say "Here is the list"
d-list: N -> 10^N
The list of reals, list: N -> R, is, for each entry k e N,
list(k) = eval(d-list(k))
It's straightforward to find an infinite decimal anti-d that
is not in the list of infinite decimals d-list.
We could, for example, define the digits of anti-d to be 1 off
the corresponding diagonal digit in d-list
anti-d(k) = (d-list(k)(k) + 1) mod 10
(Note that this is not *the* anti-diagonal. There are
actually uncountable many anti-diagonals, provably so.)
There is a problem with that definition of anti-d, which I
think is what you are talking about. It's a problem that is
dealt with in "the usual proof". The problem is that -- even
though the decimal representation anti-d is not in the
list d-list -- the real number _represented by_ anti-d
might still be in the list of reals, list(j) = eval(d-list(j)),
under another name.
One way to make sure eval(anti-d) is not eval(d-list(k))
for any k is to make sure that anti-d is not an infinite
decimal for a real number _with an alias_ -- make sure anti-d
doesn't have either trailing 9s or trailing 0s. One easy
way to do this is to just not use 9s or 0s in defining
the digits of anti-d.
One example:
anti-d(k) =
{ 4, d-list(k)(k) = 5
{ 5, otherwise
The earlier requirement for the argument
is that anti-d(k) be _different_ from d-list(k)(k). It
doesn't have to be our first guess y = (x + 1) mod 10.
We can add the requirement that anti-d _not have_ trailing
9s or trialing 0s to anti-d(k) being different. When we
do that, the usual proof does not have this problem.
----
This would not eliminate the possibility of some real number
being represented in d-list with both trailing 9s and
trailing 0s, but that is no problem at all, no more than
pi being in the list twice, both times as 3.14159... ,
is a problem. The goal is producing a real _not on that list_
[toc] | [prev] | [next] | [standalone]
| From | George Greene <greeneg@email.unc.edu> |
|---|---|
| Date | 2017-11-08 12:18 -0800 |
| Message-ID | <de973107-beb4-4fd1-81ef-921bb2a15188@googlegroups.com> |
| In reply to | #166483 |
On Wednesday, November 8, 2017 at 5:36:44 AM UTC-5, Zuhair wrote: > You arrived late here so you didn't get the context of the argument. BITCH, I DID *NOT* "arrive late"! *I*WROTE* the TITLE of this thread! YOU tried to introduce something STUPID AND IRRELEVANT because YOU ARE JUST PLUMB STUPID ABOUT this issue!! > > The idea is that we want to prove uncountability of the *reals* THAT *IS*NOT* ANY kind of IDEA because YOU *DON'T*KNOW what "the reals" EVEN *MEANS*!!! THERE ARE *DIFFERENT AXIOMATIZATIONS OF* "the reals" and the first-order one *IS*LAME*. It DOES NOT KNOW THE DIFFERENCE between an integer and other reals! TO GET IT RIGHT, you HAVE to move up to SOME sort of emulation OF HIGHER order and THE USUAL way to do that IS WITH FIRST-ORDER SET THEORY! ONCE YOU DO THAT, "the reals" *MEANS* THE POWER SET OF N, *YOU*IDIOT*. > Julio Di Egidio here said that the infinite > binary sequences are not the reals, AND *HE*WAS* *L*Y*I*N*G* BECAUSE he's EVEN stupider THAN YOU are! *A*N*Y*T*H*I*N*G* that YOU MIGHT WANT to CALL "the reals" -- anything WITH A REAL, HIGHER-ORDER, GREATEST-LOWER-BOUND (or least-upper-bound) AXIOM, *WILL* be isomorphic to the powerset of N (modulo a few rationals with denominators that are powers of two, and, since this is set theory, the base MUST be TWO). > so even if the list of all infinite > binary sequences are proved uncountable > it doesn't mean that the reals are uncountable! Well, HE was FULL OF SHIT because the things that get duplicated ARE ONLY A SLIVER OF *THE*RATIONALS* and the rationals ARE OBVIOUSLY ALREADY KNOWN to be countable, and adding a countable sliver TO A COUNTABLE set CANNOT promote it to uncountable, nor can removing one demote an uncountable set to countable! THIS IS *NOT* some sort of relevant or separate argument! The duplicate sequences in the usual encoding *DON'T* *MATTER*!! People should be SLAPPED for having gotten distracted into suspecting that they MIGHT!!
[toc] | [prev] | [next] | [standalone]
| From | Julio Di Egidio <julio@diegidio.name> |
|---|---|
| Date | 2017-11-08 23:55 -0800 |
| Message-ID | <736e6ba9-e07a-4b62-9477-17c1c0e34328@googlegroups.com> |
| In reply to | #166500 |
On Wednesday, November 8, 2017 at 9:18:35 PM UTC+1, George Greene wrote: > *A*N*Y*T*H*I*N*G* that YOU MIGHT WANT to CALL "the reals" -- anything > WITH A REAL, HIGHER-ORDER, GREATEST-LOWER-BOUND (or least-upper-bound) > AXIOM, *WILL* be isomorphic to the powerset of N (modulo a few rationals WHY/HOW is that possible/obtained?? > People should be SLAPPEP You utter moron and resident piece of shit: *I* will slap you to hell if you now keep dodging *that* question... Julio
[toc] | [prev] | [next] | [standalone]
| From | mitch <mitch@dev.null> |
|---|---|
| Date | 2017-11-09 05:22 -0600 |
| Message-ID | <_P6dnXK9qe0Lp5nHnZ2dnUU7-afNnZ2d@giganews.com> |
| In reply to | #166528 |
On 11/09/2017 01:55 AM, Julio Di Egidio wrote: > On Wednesday, November 8, 2017 at 9:18:35 PM UTC+1, George Greene wrote: > >> *A*N*Y*T*H*I*N*G* that YOU MIGHT WANT to CALL "the reals" -- anything >> WITH A REAL, HIGHER-ORDER, GREATEST-LOWER-BOUND (or least-upper-bound) >> AXIOM, *WILL* be isomorphic to the powerset of N (modulo a few rationals > > WHY/HOW is that possible/obtained?? > Bolzano proves the intermediate value theorem using continuous functions on a closed domain whose values are distinct and oppositely ordered on the endpoints f(a) < g(a) f(b) > g(b) At that time, continuous function had been understood as "not lifting a pencil from the paper". Subsequently, Dirichlet ( I believe ) introduced the notion of function as a mere set of ordered pairs. And Cauchy began to portray continuity in terms of limits (without claiming the existence of the limits). The relationship between continuity and "not lifting a pencil from the paper" for the domain of a continuous function is called completeness. The investigation of completeness led to Cauchy sequences and Dedekind cuts. This had involved sets because each of these involves infinities that must be taken as objects. But, with regard to the domain of continuous functions, completeness fills the "gaps" between the rationals. Cauchy sequences and Dedekind cuts arise in the context of sets as part of a constructive methodology. As foundational studies proceeded, Hilbert argued for formalist axiomatics. In this paradigm, Cauchy sequences and Dedekind cuts are features rather than constructively prior mathematical objects. What replaces them is the completeness axiom, or, an existence claim for least upper bounds. Another aspect of foundational studies is that the existence of individuals is substantive. So, the dependence of Bolzano's proof on functions is reduced to representations of functions in set theory. If one only admits the first-order interpretation of set theory (the received view), the representation of the reals will usually be the Baire space, but will always be of the same cardinal as the power set of the naturals. Constructive mathematics does not change this relationship since it usually takes the natural numbers as given and admits the tree structure of the Baire space as the underlying structure for "spreads". mitch
[toc] | [prev] | [next] | [standalone]
| From | Julio Di Egidio <julio@diegidio.name> |
|---|---|
| Date | 2017-11-09 15:45 -0800 |
| Message-ID | <ef3b2949-a2f2-4690-a36d-590891dd8900@googlegroups.com> |
| In reply to | #166535 |
On Thursday, November 9, 2017 at 12:23:08 PM UTC+1, mitch wrote: <snipped 1 page of dubious math history reconstruction> > If one only admits the first-order interpretation > of set theory (the received view), the representation > of the reals will usually be the Baire space, but > will always be of the same cardinal as the power set > of the naturals. You still cannot even distinguish XYZ from the history of XYZ... Just nobody around here is going to answer my question and in fact address the underlying objection. And this thread has just been hijacked, anyway. Never mind, USENET IS OVER (idiot/s): spammers and dickheads win here just as they win across the Overflows and the Wikipedias. The lesson is we need better models, i.e. that deincentivise the shitheads--- EOD. Julio
[toc] | [prev] | [next] | [standalone]
| From | "Ross A. Finlayson" <ross.finlayson@gmail.com> |
|---|---|
| Date | 2017-11-09 22:06 -0800 |
| Message-ID | <cd4a8bd4-4dd3-4918-8aae-aca6bb1e79d7@googlegroups.com> |
| In reply to | #166535 |
On Thursday, November 9, 2017 at 3:23:08 AM UTC-8, mitch wrote: > On 11/09/2017 01:55 AM, Julio Di Egidio wrote: > > On Wednesday, November 8, 2017 at 9:18:35 PM UTC+1, George Greene wrote: > > > >> *A*N*Y*T*H*I*N*G* that YOU MIGHT WANT to CALL "the reals" -- anything > >> WITH A REAL, HIGHER-ORDER, GREATEST-LOWER-BOUND (or least-upper-bound) > >> AXIOM, *WILL* be isomorphic to the powerset of N (modulo a few rationals > > > > WHY/HOW is that possible/obtained?? > > > > Bolzano proves the intermediate value theorem > using continuous functions on a closed domain > whose values are distinct and oppositely ordered > on the endpoints > > f(a) < g(a) > > f(b) > g(b) > > At that time, continuous function had been > understood as "not lifting a pencil from > the paper". > > Subsequently, Dirichlet ( I believe ) introduced > the notion of function as a mere set of ordered > pairs. And Cauchy began to portray continuity > in terms of limits (without claiming the existence > of the limits). > > The relationship between continuity and "not > lifting a pencil from the paper" for the domain > of a continuous function is called completeness. > > The investigation of completeness led to Cauchy > sequences and Dedekind cuts. This had involved sets > because each of these involves infinities that must > be taken as objects. But, with regard to the > domain of continuous functions, completeness fills > the "gaps" between the rationals. > > Cauchy sequences and Dedekind cuts arise in the > context of sets as part of a constructive methodology. > > As foundational studies proceeded, Hilbert argued > for formalist axiomatics. In this paradigm, Cauchy > sequences and Dedekind cuts are features rather > than constructively prior mathematical objects. > What replaces them is the completeness axiom, or, > an existence claim for least upper bounds. > > Another aspect of foundational studies is that the > existence of individuals is substantive. So, > the dependence of Bolzano's proof on functions is > reduced to representations of functions in set > theory. If one only admits the first-order interpretation > of set theory (the received view), the representation > of the reals will usually be the Baire space, but > will always be of the same cardinal as the power set > of the naturals. > > Constructive mathematics does not change this relationship > since it usually takes the natural numbers as given and > admits the tree structure of the Baire space as the underlying > structure for "spreads". > > mitch An alternative development of the intermediate value theorem (IVT) and as its directly preceding the Fund. Thm.'s of Calculus is neatly boxed up with line continuity on [0,1] (then conveniently as carried out through the integer lattice). This representation of real numbers (or their integer and non-integer parts, as copies of of a unit line segment) is quite directly modeled in a set theory and in a first-order interpretation of a set theory (if extra the "received view"). Being all extra- or super- the modern canon of "foundations of mathematics" as (ordinary) set theory, it's still quite all clear and direct from the "classical", and founds the classical and modern together in the extra and super. Mathematics is enduring, all of it.
[toc] | [prev] | [next] | [standalone]
Page 7 of 10 — ← Prev page 1 … 5 6 [7] 8 9 10 Next page →
Back to top | Article view | sci.logic
csiph-web