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 8 of 10 — ← Prev page 1 … 6 7 [8] 9 10 Next page →
| From | George Greene <greeneg@email.unc.edu> |
|---|---|
| Date | 2017-11-09 22:40 -0800 |
| Message-ID | <960243ab-5a63-4e3b-bda5-8c2b1b7786af@googlegroups.com> |
| In reply to | #166528 |
On Thursday, November 9, 2017 at 2:55:28 AM UTC-5, Julio Di Egidio wrote: > You utter moron and resident piece of shit: *I* will slap you to hell if > you now keep dodging *that* question... There are two questions here. One is about your introduction of the reals with 2 representations. That was a moronic introduction on your part. It is not relevant to diagonalization or Cantor's theorem PERIOD. The reals with 2 representations are a sliver of the rationals (given any base; in this case, since Cantor's theorem is a theorem OF SET theory and we mean by "the reals" the powerSET of N, THE ONLY relevant base is 2) -- the ones with denominators that are powers of 2 -- and no number of elements THAT SMALL can have any meaningful effect on diagonalization. You can have a countably infinite list of reals with all, either, both, OR NONE of those duplicated representations and IN NONE of those 4 cases will it be complete, and IN ALL of those 4 cases, the anti-diagonal of the list will not be on it, and will, in virtue of not being on it, PROVE that the list is not complete. The presence or absence of any of the dual representations IS JUST NOT RELEVANT to the question, PERIOD. As for the case of going to 2nd order, that splits into two cases as well. In 1 case you can lift ZFC to 2nd order and continue to define the reals as the powerset of N. In the other you can take a reasonable axiomatization of the reals (one with a LUB axiom) and lift that axiom to 2nd-order. The explanation of why the 2nd-order version is categorical IS A HARDER question -- NOT A TRIVIAL one like the dismissal of the duplicate representations. YOU SHOULD START A THREAD ON IT, not threaten to slap ME, if you want it addressed. But I ALREADY STARTED a thread on THIS question about Cantor's theorem, and I WILL KEEP slapping people who mistake irrelevant side-issues for relevant.
[toc] | [prev] | [next] | [standalone]
| From | Julio Di Egidio <julio@diegidio.name> |
|---|---|
| Date | 2017-11-13 03:27 -0800 |
| Message-ID | <c141f3dd-cecb-4e29-9568-74318c5bce73@googlegroups.com> |
| In reply to | #166621 |
On Friday, November 10, 2017 at 7:40:56 AM UTC+1, George Greene wrote: > On Thursday, November 9, 2017 at 2:55:28 AM UTC-5, Julio Di Egidio wrote: > > You utter moron and resident piece of shit: *I* will slap you to hell if > > you now keep dodging *that* question... > > There are two questions here. One is about your introduction of the reals > with 2 representations. That was a moronic introduction on your part. > It is not relevant to diagonalization or Cantor's theorem PERIOD. That was NOT introduced by me, I am in fact the one who was complaining about it: what kind of a fucking moron and liar are you, you keep doing this to me ALL THE TIME, retorting on me what I was the first one to actually single out... You fucking IDIOT and LIAR. > we mean by "the reals" the powerSET of N, THE ONLY relevant base is 2) -- the ones with denominators that are powers of 2 -- and no number of elements THAT SMALL can have any meaningful effect on diagonalization. You can have a countably infinite list of reals with all, either, both, OR NONE of those duplicated representations and IN NONE of those 4 cases will it be complete, and IN ALL of those 4 cases, the anti-diagonal of the list will not be on it, and will, in virtue of not being on it, PROVE that the list is not complete. The presence or absence of any of the dual representations IS JUST NOT RELEVANT to the question, PERIOD. YOU are a fucking idiot, PERIOD, as that's another piece of PURE DOGMA followed by some more of your pretending that I make the STUPID mistakes that you utter PIECE OF SHIT keep retort on me. You fucking SELF-DELUSIONAL MORON and LIAR. > As for the case of going to 2nd order, that splits into two cases as well. > In 1 case you can lift ZFC to 2nd order and continue to define the reals as the powerset of N. In the other you can take a reasonable axiomatization > The explanation of why the 2nd-order version is categorical IS A HARDER question -- NOT A TRIVIAL one like the dismissal of the duplicate representations. YOU SHOULD START A THREAD ON IT, not threaten to slap ME, if you want it addressed. YOU were the one slapping around, I did NOT introduce that EITHER, you fucking moron ad piece of RETARDED SHIT just snipping YOUR utterances that I was directly replying to. And that's what you are, yet another SELF-DELUSIONAL MORON with in fact NOTHING useful to say, ever. And now I am going to read the other reply you have given me: and I am OPTIMISTIC, as that's still going to be a pile of bullshit and then I am truly finished with you as well as this useless shithole. > But I ALREADY STARTED a thread on THIS question about Cantor's theorem, and I WILL KEEP slapping people who mistake irrelevant side-issues for relevant. You are such a biased piece of shit that you will never actually even READ. *Plonk* Julio
[toc] | [prev] | [next] | [standalone]
| From | George Greene <greeneg@email.unc.edu> |
|---|---|
| Date | 2017-11-09 23:02 -0800 |
| Message-ID | <669c8cd3-3098-4872-9765-662956ad10c2@googlegroups.com> |
| In reply to | #166528 |
On Thursday, November 9, 2017 at 2:55:28 AM UTC-5, 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?? > *I* will slap you to hell if > you now keep dodging *that* question... I could say you were already IN hell if you were too stupid to figure it out for yourself. It is NOT like this is controversial. Can't you just THINK about it for a second? This question is in two parts, 1 easy, 1 hard. I'm waxing dismissive right now because you seem to be whining ABOUT THE EASY part. Just to prove that the easy part REALLY IS EASY, do you think YOU can explain, TO YOURSELF, how every countably-infinitely-wide (one could say "omega-width") bit-string (let's skip the whole-number part of the real, since that could obviously be encoded as A FINITE bit-string starting with a sign and 1, in the usual binary notation) encodes a real between 0 and 1 (inclusive, since all 0's would be 0 and all 1's would be 1), and how any real could be encoded as such a bit-string (certain rationals could be encoded as TWO of them, but they would always come in pairs ending in 100000.... and 011111...., and, as I've said before, there are simply too few of these TO EVER matter) ? If you can do THAT part then I can do some research into the harder part of proving that the non-standard models go away when the LUB axiom is lifted to 2nd-order. In all honesty I just based this categoricity claim on the fact that that (utter extinguishment) happens to the non-standard models of PA when you lift the induction axiom to 2nd-order. There is plenty of easily-googled stuff on THAT categoricity and if you bother to look at it THEN YOU TOO might expect something similar to happen at 2nd-order with the reals. In any case, that is a much deeper subject than Cantor's theorem, WHICH IS A SIMPLE FIRST-order theorem applying TO ALL sets, not something in HIGHER-order logic specific to ONE complicated structure, so neither I nor anyone else is obligated to "stop dodging" your question about categoricity IN THIS forum on Cantor's Theorem. Given that there are mulitple first-order axiomatizations of the reals, including a famous one by Tarski THAT DOESN'T identify a 1, we should probably also posit that the axiomatizations that we are looking for basically add, to the axioms for an ordered field, a least-upper-bound axiom, which, for purposes of this argument, needs to be lifted to 2nd-order. http://www-history.mcs.st-and.ac.uk/~john/analysis/Lectures/L5.html This treatment in fact claims that R is, up to isomorphism, THE ONLY complete ordered field, WITHOUT even going to 2nd order. I'm pretty sure they used 1st-order set theory to do that since you can emulate 2nd-order logic in 1st-order set theory simply by allowing the 2nd-order domain to be the powerset of the 1st-order domain. If that is in fact how they did it then that does reinforce the relevance of 2nd-order logic to the categoricity claim. In other words, if you want to slap somebody for dodging the how, slap the author of the link above.
[toc] | [prev] | [next] | [standalone]
| From | Julio Di Egidio <julio@diegidio.name> |
|---|---|
| Date | 2017-11-13 03:51 -0800 |
| Message-ID | <07967508-bce6-44d1-bf0a-fcff97f52b50@googlegroups.com> |
| In reply to | #166625 |
On Friday, November 10, 2017 at 8:02:38 AM UTC+1, George Greene wrote: > On Thursday, November 9, 2017 at 2:55:28 AM UTC-5, 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?? > > > *I* will slap you to hell if > > you now keep dodging *that* question... > > I could say you were already IN hell Sure, as much as you are a fucking idiot just uttering fallacies... > if you were too stupid to figure it out for yourself. It is NOT like this is controversial. > Can't you just THINK about it for a second? > > This question is in two parts, 1 easy, 1 hard. I'm waxing dismissive > right now You keep indeed insulting me, and I am mean my honesty if not my (lack of) intelligence, you fucking moron. > do you think YOU can explain, TO YOURSELF, how every countably-infinitely- > wide bit-string encodes a real between 0 and 1, and how any real could be > encoded as such a bit-string (certain rationals could be encoded as TWO of them, but they would always come in pairs ending in 100000.... and 011111...., and, as I've said before, there are simply too few of these TO EVER matter) ? > > If you can do THAT part NO, I CANNOT: a real number is *the limit of* a Cauchy sequence, then how on Earth is it that simple sequences (i.e. not their limits) are enough to reason about real numbers?? That's *really* my question and my immediate trouble with the standard, and you spare me your bullshit, just put up or shut up. > > > *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?? Answer the fucking question: even if it turns out it's super simple, it's still a crucial question!! -- Also, THEN we can try and talk categoricity. Julio
[toc] | [prev] | [next] | [standalone]
| From | Me <franz.fritschee.ff@gmail.com> |
|---|---|
| Date | 2017-11-13 04:17 -0800 |
| Message-ID | <834e73d2-7924-463d-8446-9ca3d1ed5048@googlegroups.com> |
| In reply to | #166786 |
On Monday, November 13, 2017 at 12:51:24 PM UTC+1, Julio Di Egidio wrote: > GG wrote: > > > > do you think YOU can explain, TO YOURSELF, how every countably-infinitely- > > wide bit-string encodes a real between 0 and 1, and how any real could be > > encoded as such a bit-string (certain rationals could be encoded as TWO of > > them, but they would always come in pairs ending in 100000.... and > > 011111...., and, as I've said before, there are simply too few of these TO > > EVER matter) ? > > > > If you can do THAT part > > > NO, I CANNOT: [..] how on Earth is it that simple sequences (i.e. not their > limits) are enough to reason about real numbers? That's *really* my question > and [...] Let's just consider the reals in (0, 1). Then each and every real in this interval has a "binary representation" (actually, as GG mentioned above, some of them have two). The mentioned sequences of 0 and 1 are just sequences of the binary digits of those "binary representations". Now there is a bijection between (0, 1) and the set of those sequences (if we don't take into account all sequences ending with an infinite succession of 1s, say.) Some examples of "related" elements: 0.5 <-> (1,0,0,...) 0.75 <-> (1,1,0,0,...) etc.
[toc] | [prev] | [next] | [standalone]
| From | Julio Di Egidio <julio@diegidio.name> |
|---|---|
| Date | 2017-11-13 04:35 -0800 |
| Message-ID | <a984cf0b-b30d-4d47-8e0d-efbd92431d8e@googlegroups.com> |
| In reply to | #166787 |
On Monday, November 13, 2017 at 1:17:54 PM UTC+1, Me wrote: > On Monday, November 13, 2017 at 12:51:24 PM UTC+1, Julio Di Egidio wrote: > > GG wrote: > > > > > > do you think YOU can explain, TO YOURSELF, how every countably-infinitely- > > > wide bit-string encodes a real between 0 and 1, and how any real could be > > > encoded as such a bit-string (certain rationals could be encoded as TWO of > > > them, but they would always come in pairs ending in 100000.... and > > > 011111...., and, as I've said before, there are simply too few of these TO > > > EVER matter) ? > > > > > > If you can do THAT part > > > > > NO, I CANNOT: [..] how on Earth is it that simple sequences (i.e. not their > > limits) are enough to reason about real numbers? That's *really* my question > > and [...] > > Let's just consider the reals in (0, 1). Then each and every real in this interval has a "binary representation" (actually, as GG mentioned above, some of them have two). The mentioned sequences of 0 and 1 are just sequences of the binary digits of those "binary representations". But the sequence are NOT the same as the fractional expansions: indeed, there are infinitely many (an equivalence class of) Cauchy sequences that correspond to each real, but just up to two fractional expansions in any given base. They are just NOT the same. And then again, we find plain sequences in Cantor's arguments, not limits nor the fractional expansions corresponding to those limits. -- Am I missing anything? Julio
[toc] | [prev] | [next] | [standalone]
| From | "Ross A. Finlayson" <ross.finlayson@gmail.com> |
|---|---|
| Date | 2017-11-13 06:17 -0800 |
| Message-ID | <e6926e09-0105-4704-8424-f2b9e6ca1918@googlegroups.com> |
| In reply to | #166788 |
On Monday, November 13, 2017 at 4:35:36 AM UTC-8, Julio Di Egidio wrote: > On Monday, November 13, 2017 at 1:17:54 PM UTC+1, Me wrote: > > On Monday, November 13, 2017 at 12:51:24 PM UTC+1, Julio Di Egidio wrote: > > > GG wrote: > > > > > > > > do you think YOU can explain, TO YOURSELF, how every countably-infinitely- > > > > wide bit-string encodes a real between 0 and 1, and how any real could be > > > > encoded as such a bit-string (certain rationals could be encoded as TWO of > > > > them, but they would always come in pairs ending in 100000.... and > > > > 011111...., and, as I've said before, there are simply too few of these TO > > > > EVER matter) ? > > > > > > > > If you can do THAT part > > > > > > > NO, I CANNOT: [..] how on Earth is it that simple sequences (i.e. not their > > > limits) are enough to reason about real numbers? That's *really* my question > > > and [...] > > > > Let's just consider the reals in (0, 1). Then each and every real in this interval has a "binary representation" (actually, as GG mentioned above, some of them have two). The mentioned sequences of 0 and 1 are just sequences of the binary digits of those "binary representations". > > But the sequence are NOT the same as the fractional expansions: indeed, > there are infinitely many (an equivalence class of) Cauchy sequences that > correspond to each real, but just up to two fractional expansions in any > given base. They are just NOT the same. And then again, we find plain > sequences in Cantor's arguments, not limits nor the fractional expansions > corresponding to those limits. -- Am I missing anything? > > Julio The real numbers of ran(EF) basically establish the Cauchy criterion each from that each is of the course-of-passage of all the previous. This is just for [0,1], but then combined with the integer lattice there's another example of why there are multiple models of the reals as sets.
[toc] | [prev] | [next] | [standalone]
| From | Julio Di Egidio <julio@diegidio.name> |
|---|---|
| Date | 2017-11-13 06:52 -0800 |
| Message-ID | <733edb3b-9aaa-4a4d-9d97-4a83e0a6eb65@googlegroups.com> |
| In reply to | #166798 |
On Monday, November 13, 2017 at 3:17:50 PM UTC+1, Ross A. Finlayson wrote: > On Monday, November 13, 2017 at 4:35:36 AM UTC-8, Julio Di Egidio wrote: > > On Monday, November 13, 2017 at 1:17:54 PM UTC+1, Me wrote: > > > On Monday, November 13, 2017 at 12:51:24 PM UTC+1, Julio Di Egidio wrote: > > > > GG wrote: > > > > > > > > > > do you think YOU can explain, TO YOURSELF, how every countably-infinitely- > > > > > wide bit-string encodes a real between 0 and 1, and how any real could be > > > > > encoded as such a bit-string (certain rationals could be encoded as TWO of > > > > > them, but they would always come in pairs ending in 100000.... and > > > > > 011111...., and, as I've said before, there are simply too few of these TO > > > > > EVER matter) ? > > > > > > > > > > If you can do THAT part > > > > > > > > > NO, I CANNOT: [..] how on Earth is it that simple sequences (i.e. not their > > > > limits) are enough to reason about real numbers? That's *really* my question > > > > and [...] > > > > > > Let's just consider the reals in (0, 1). Then each and every real in this interval has a "binary representation" (actually, as GG mentioned above, some of them have two). The mentioned sequences of 0 and 1 are just sequences of the binary digits of those "binary representations". > > > > But the sequence are NOT the same as the fractional expansions: indeed, > > there are infinitely many (an equivalence class of) Cauchy sequences that > > correspond to each real, but just up to two fractional expansions in any > > given base. They are just NOT the same. And then again, we find plain > > sequences in Cantor's arguments, not limits nor the fractional expansions > > corresponding to those limits. -- Am I missing anything? > > The real numbers of ran(EF) basically establish the > Cauchy criterion each from that each is of the > course-of-passage of all the previous. The title of this discussion is What Cantor's Theorem Actually Says, so your ran(EF) is simply OT. But yes, I think I get what the answer is, yours as well as Alan's, that a Cauchy sequence is representative of the whole class so there we have almost directly our real numbers: and I think that is wrong. Again, we find *plain sequences* in Cantor's arguments, not limits nor the fractional expansions *corresponding to those limits*. IOW, we do not have the fractional expansions unless we are given the real numbers themselves: but we are just given functions from |N to the alphabet, so *at best* what we have (what Cantor has!) is the first-order definable reals or something... Julio
[toc] | [prev] | [next] | [standalone]
| From | "Ross A. Finlayson" <ross.finlayson@gmail.com> |
|---|---|
| Date | 2017-11-13 06:56 -0800 |
| Message-ID | <cff15586-1047-44fb-a80b-386106efcecd@googlegroups.com> |
| In reply to | #166799 |
On Monday, November 13, 2017 at 6:52:40 AM UTC-8, Julio Di Egidio wrote: > On Monday, November 13, 2017 at 3:17:50 PM UTC+1, Ross A. Finlayson wrote: > > On Monday, November 13, 2017 at 4:35:36 AM UTC-8, Julio Di Egidio wrote: > > > On Monday, November 13, 2017 at 1:17:54 PM UTC+1, Me wrote: > > > > On Monday, November 13, 2017 at 12:51:24 PM UTC+1, Julio Di Egidio wrote: > > > > > GG wrote: > > > > > > > > > > > > do you think YOU can explain, TO YOURSELF, how every countably-infinitely- > > > > > > wide bit-string encodes a real between 0 and 1, and how any real could be > > > > > > encoded as such a bit-string (certain rationals could be encoded as TWO of > > > > > > them, but they would always come in pairs ending in 100000.... and > > > > > > 011111...., and, as I've said before, there are simply too few of these TO > > > > > > EVER matter) ? > > > > > > > > > > > > If you can do THAT part > > > > > > > > > > > NO, I CANNOT: [..] how on Earth is it that simple sequences (i.e. not their > > > > > limits) are enough to reason about real numbers? That's *really* my question > > > > > and [...] > > > > > > > > Let's just consider the reals in (0, 1). Then each and every real in this interval has a "binary representation" (actually, as GG mentioned above, some of them have two). The mentioned sequences of 0 and 1 are just sequences of the binary digits of those "binary representations". > > > > > > But the sequence are NOT the same as the fractional expansions: indeed, > > > there are infinitely many (an equivalence class of) Cauchy sequences that > > > correspond to each real, but just up to two fractional expansions in any > > > given base. They are just NOT the same. And then again, we find plain > > > sequences in Cantor's arguments, not limits nor the fractional expansions > > > corresponding to those limits. -- Am I missing anything? > > > > The real numbers of ran(EF) basically establish the > > Cauchy criterion each from that each is of the > > course-of-passage of all the previous. > > The title of this discussion is What Cantor's Theorem Actually Says, so > your ran(EF) is simply OT. But yes, I think I get what the answer is, > yours as well as Alan's, that a Cauchy sequence is representative of the > whole class so there we have almost directly our real numbers: and I think > that is wrong. Again, we find *plain sequences* in Cantor's arguments, not > limits nor the fractional expansions *corresponding to those limits*. IOW, > we do not have the fractional expansions unless we are given the real > numbers themselves: but we are just given functions from |N to the alphabet, > so *at best* what we have (what Cantor has!) is the first-order definable > reals or something... > > Julio Where "Cantor proves the line is drawn" then the simple line segment as the course-of-passage through the elements in their normal order very much is "What Cantor's Theorem Actually Says". This is where, for example, real analysis and the line integral as the infinite sum of the infinitely many differential regions or patches (with countable additivity so established because real analysis needs its results from foundations) is all set theory says about real analysis in terms of real numbers.
[toc] | [prev] | [next] | [standalone]
| From | Julio Di Egidio <julio@diegidio.name> |
|---|---|
| Date | 2017-11-13 06:59 -0800 |
| Message-ID | <c06c79b4-7145-44a8-a3e1-9bf69976c425@googlegroups.com> |
| In reply to | #166800 |
On Monday, November 13, 2017 at 3:56:36 PM UTC+1, Ross A. Finlayson wrote: > On Monday, November 13, 2017 at 6:52:40 AM UTC-8, Julio Di Egidio wrote: > > On Monday, November 13, 2017 at 3:17:50 PM UTC+1, Ross A. Finlayson wrote: > > > On Monday, November 13, 2017 at 4:35:36 AM UTC-8, Julio Di Egidio wrote: > > > > On Monday, November 13, 2017 at 1:17:54 PM UTC+1, Me wrote: > > > > > On Monday, November 13, 2017 at 12:51:24 PM UTC+1, Julio Di Egidio wrote: > > > > > > GG wrote: > > > > > > > > > > > > > > do you think YOU can explain, TO YOURSELF, how every countably-infinitely- > > > > > > > wide bit-string encodes a real between 0 and 1, and how any real could be > > > > > > > encoded as such a bit-string (certain rationals could be encoded as TWO of > > > > > > > them, but they would always come in pairs ending in 100000.... and > > > > > > > 011111...., and, as I've said before, there are simply too few of these TO > > > > > > > EVER matter) ? > > > > > > > > > > > > > > If you can do THAT part > > > > > > > > > > > > > NO, I CANNOT: [..] how on Earth is it that simple sequences (i.e. not their > > > > > > limits) are enough to reason about real numbers? That's *really* my question > > > > > > and [...] > > > > > > > > > > Let's just consider the reals in (0, 1). Then each and every real in this interval has a "binary representation" (actually, as GG mentioned above, some of them have two). The mentioned sequences of 0 and 1 are just sequences of the binary digits of those "binary representations". > > > > > > > > But the sequence are NOT the same as the fractional expansions: indeed, > > > > there are infinitely many (an equivalence class of) Cauchy sequences that > > > > correspond to each real, but just up to two fractional expansions in any > > > > given base. They are just NOT the same. And then again, we find plain > > > > sequences in Cantor's arguments, not limits nor the fractional expansions > > > > corresponding to those limits. -- Am I missing anything? > > > > > > The real numbers of ran(EF) basically establish the > > > Cauchy criterion each from that each is of the > > > course-of-passage of all the previous. > > > > The title of this discussion is What Cantor's Theorem Actually Says, so > > your ran(EF) is simply OT. But yes, I think I get what the answer is, > > yours as well as Alan's, that a Cauchy sequence is representative of the > > whole class so there we have almost directly our real numbers: and I think > > that is wrong. Again, we find *plain sequences* in Cantor's arguments, not > > limits nor the fractional expansions *corresponding to those limits*. IOW, > > we do not have the fractional expansions unless we are given the real > > numbers themselves: but we are just given functions from |N to the alphabet, > > so *at best* what we have (what Cantor has!) is the first-order definable > > reals or something... > > Where "Cantor proves the line is drawn" then > the simple line segment as the course-of-passage > through the elements in their normal order very > much is "What Cantor's Theorem Actually Says". > > This is where, for example, real analysis and > the line integral as the infinite sum of the > infinitely many differential regions or patches > (with countable additivity so established because > real analysis needs its results from foundations) > is all set theory says about real analysis in > terms of real numbers. Amen, but that's just you missing the point. *Plonk* Julio
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2017-11-13 17:04 +0000 |
| Message-ID | <87bmk6un39.fsf@bsb.me.uk> |
| In reply to | #166799 |
Julio Di Egidio <julio@diegidio.name> writes:
> On Monday, November 13, 2017 at 3:17:50 PM UTC+1, Ross A. Finlayson wrote:
>> On Monday, November 13, 2017 at 4:35:36 AM UTC-8, Julio Di Egidio wrote:
<snip>
>> > But the sequence are NOT the same as the fractional expansions: indeed,
>> > there are infinitely many (an equivalence class of) Cauchy sequences that
>> > correspond to each real, but just up to two fractional expansions in any
>> > given base. They are just NOT the same. And then again, we find plain
>> > sequences in Cantor's arguments, not limits nor the fractional expansions
>> > corresponding to those limits. -- Am I missing anything?
>>
>> The real numbers of ran(EF) basically establish the
>> Cauchy criterion each from that each is of the
>> course-of-passage of all the previous.
>
> The title of this discussion is What Cantor's Theorem Actually Says, so
> your ran(EF) is simply OT. But yes, I think I get what the answer is,
> yours as well as Alan's, that a Cauchy sequence is representative of the
> whole class so there we have almost directly our real numbers: and I think
> that is wrong. Again, we find *plain sequences* in Cantor's arguments, not
> limits nor the fractional expansions *corresponding to those limits*. IOW,
> we do not have the fractional expansions unless we are given the real
> numbers themselves: but we are just given functions from |N to the alphabet,
> so *at best* what we have (what Cantor has!) is the first-order definable
> reals or something...
The theorem does not restrict the sequences to being definable. It
shows that no bijective function exists between N and sequences in a
binary alphabet ({w, m} was used in the original). You can then map
these sequences in lots of ways to show that other sets are uncountable;
the obvious one being P(N), but it's not hard to map {w, m} sequences to
unique reals. Yes, R must already have been defined to do that, but as
you say the title of the thread is "What Cantor's Theorem Actually Says"
and it's not about defining the reals, but about the existence of an
uncountable subset of them.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | "Ross A. Finlayson" <ross.finlayson@gmail.com> |
|---|---|
| Date | 2017-11-13 12:14 -0800 |
| Message-ID | <a1b0ee78-3571-43b0-a9ca-810a8748eed1@googlegroups.com> |
| In reply to | #166810 |
Indeed.
[toc] | [prev] | [next] | [standalone]
| From | "Ross A. Finlayson" <ross.finlayson@gmail.com> |
|---|---|
| Date | 2017-11-15 21:26 -0800 |
| Message-ID | <4e7c2ebb-3d33-475c-bd3a-c545a6ee3f24@googlegroups.com> |
| In reply to | #166814 |
On Monday, November 13, 2017 at 12:14:37 PM UTC-8, Ross A. Finlayson wrote: > Indeed. On Monday, November 13, 2017 at 12:14:37 PM UTC-8, Ross A. Finlayson wrote: > Indeed. Modern algebra's complete ordered field then for whether "Dedekind is sufficient" or "Dedekind is insufficient" (to model all the real numbers of all the systems of real numbers) with that Dedekind completeness has gaplessness or completeness for any model of the real number line: here the relevant point is that algebra's development is in many usual terms then the classical terms of the line. Then including sweep it seems quite well more complete. Here "it" is the formal mathematical models of the systems that model real numbers sufficient for topology, real analysis, et cetera.
[toc] | [prev] | [next] | [standalone]
| From | "Ross A. Finlayson" <ross.finlayson@gmail.com> |
|---|---|
| Date | 2017-11-16 22:47 -0800 |
| Message-ID | <9d8caf8f-762a-4c85-b915-06d7d83b1f93@googlegroups.com> |
| In reply to | #166932 |
On Wednesday, November 15, 2017 at 9:26:17 PM UTC-8, Ross A. Finlayson wrote: > On Monday, November 13, 2017 at 12:14:37 PM UTC-8, Ross A. Finlayson wrote: > > Indeed. > > > > On Monday, November 13, 2017 at 12:14:37 PM UTC-8, Ross A. Finlayson wrote: > > Indeed. > > Modern algebra's complete ordered field then > for whether "Dedekind is sufficient" or > "Dedekind is insufficient" > (to model all the real numbers > of all the systems of real numbers) > with that Dedekind completeness > has gaplessness or completeness > for any model of the real number line: > here the relevant point is that algebra's > development is in many usual terms then > the classical terms of the line. > > Then including sweep it seems > quite well more complete. > > Here "it" is the formal mathematical models > of the systems that model real numbers > sufficient for topology, real analysis, et cetera. It's a simple agen-da.
[toc] | [prev] | [next] | [standalone]
| From | George Greene <greeneg@email.unc.edu> |
|---|---|
| Date | 2017-11-15 15:19 -0800 |
| Message-ID | <63403c15-df17-4ecb-8b35-16227753800b@googlegroups.com> |
| In reply to | #166810 |
On Monday, November 13, 2017 at 12:04:29 PM UTC-5, Ben Bacarisse wrote:
> The theorem does not restrict the sequences to being definable.
The theorem doesn't say ANYthing about sequences PERIOD.
Sets are BY DEFINITION *UN*ordered and order DOES NOT MATTER in this context.
The theorem is fundamentally nothing more that corollaries of the
EXISTENCE OF A *TERM* -- it is odd to conflate a mere THING with a sequence
of SENTENCES (that's normally what we expect a proof of a theorem to be), but
the whole theorem SIMPLY comes down to THE EXISTENCE of the anti-diagonal.
The theorem is just the immediate corollaries of the FACT THAT YOU *CAN*SAY*,
in this language,
{seDom(f):~sef(s)}.
> It shows that no bijective function exists between N and sequences in a
> binary alphabet
Sequence arises here because and only because N happens to be a set that happens
to HAVE A NATURAL INTERNAL order -- sets in general DO NOT, and NO USE is made
of this OR ANY order in proving the theorem. Each of the individual s's in
Dom(f) in the term as presented above can get CONSIDERED and ACCEPTED INTO OR
REJECTED FROM the set being built, IN PARALLEL. No decision about acceptance or
rejection of any particular s depends in any way, sequential or otherwise, on
the decision for any other s.
> ({w, m} was used in the original).
In the set being constructed or out of it are used in the theorem as proved
HERE, NOW, in MODERN context and language.
> You can then map these sequences in lots of ways to
> show that other sets are uncountable;
> the obvious one being P(N), but
but that's backwards; the theorem IS ABOUT powersets AND NOT about other things.
N and countability are one case but that case IS NOT special beyond the fact that it produces THE FIRST uncountable set, unless you deny the continuum hypothesis and claim that aleph-one is smaller.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2017-11-16 00:15 +0000 |
| Message-ID | <87ineb2i50.fsf@bsb.me.uk> |
| In reply to | #166916 |
George Greene <greeneg@email.unc.edu> writes:
> On Monday, November 13, 2017 at 12:04:29 PM UTC-5, Ben Bacarisse wrote:
>> The theorem does not restrict the sequences to being definable.
>
> The theorem doesn't say ANYthing about sequences PERIOD.
I thought the original did, but my German is not really up to it.
<snip>
>> ({w, m} was used in the original).
>
> In the set being constructed or out of it are used in the theorem as proved
> HERE, NOW, in MODERN context and language.
Yes, I know how it is presented these days, but the original paper
appears to do things differently. I'm perfectly prepared to accept that
I've misread it. Do you know of a good English translation?
<snip>
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | George Greene <greeneg@email.unc.edu> |
|---|---|
| Date | 2017-11-16 18:00 -0800 |
| Message-ID | <76d869eb-6c65-4b11-89f4-9b27b3f30758@googlegroups.com> |
| In reply to | #166921 |
On Wednesday, November 15, 2017 at 7:15:41 PM UTC-5, Ben Bacarisse wrote: > Yes, I know how it is presented these days, but the original paper > appears to do things differently. I'm perfectly prepared to accept that > I've misread it. I doubt that very strongly. The original is not directly relevant to what I am trying to say, hence the "really" in the title OF THIS thread. *I* titled this discussion.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2017-11-17 02:12 +0000 |
| Message-ID | <87vai9y7pn.fsf@bsb.me.uk> |
| In reply to | #166967 |
George Greene <greeneg@email.unc.edu> writes: > On Wednesday, November 15, 2017 at 7:15:41 PM UTC-5, Ben Bacarisse wrote: >> Yes, I know how it is presented these days, but the original paper >> appears to do things differently. I'm perfectly prepared to accept that >> I've misread it. > > I doubt that very strongly. The original is not directly relevant to what > I am trying to say, hence the "really" in the title OF THIS thread. > *I* titled this discussion. Ah, I thought that was the problem. Threads drift. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Julio Di Egidio <julio@diegidio.name> |
|---|---|
| Date | 2017-11-19 09:12 -0800 |
| Message-ID | <86a2d278-143c-437e-9c84-159ef248fc58@googlegroups.com> |
| In reply to | #166916 |
On Thursday, November 16, 2017 at 12:19:29 AM UTC+1, George Greene wrote:
<snip>
> the whole theorem SIMPLY comes down to THE EXISTENCE of the anti-diagonal.
> The theorem is just the immediate corollaries of the FACT THAT YOU *CAN*SAY*,
> in this language,
>
> {seDom(f):~sef(s)}.
No, for all I know, one has to *prove* that the diagonal set is a set:
namely, given a formula, one has to prove that the formula defines a set.
Otherwise, e.g. Russell set would be a set, too... That said, can you or
anyone actually show such a proof?
Julio
[toc] | [prev] | [next] | [standalone]
| From | "Ross A. Finlayson" <ross.finlayson@gmail.com> |
|---|---|
| Date | 2017-11-19 09:34 -0800 |
| Message-ID | <196df189-4708-4db3-9f15-f30d278546fa@googlegroups.com> |
| In reply to | #167069 |
On Sunday, November 19, 2017 at 9:12:16 AM UTC-8, Julio Di Egidio wrote:
> On Thursday, November 16, 2017 at 12:19:29 AM UTC+1, George Greene wrote:
> <snip>
> > the whole theorem SIMPLY comes down to THE EXISTENCE of the anti-diagonal.
> > The theorem is just the immediate corollaries of the FACT THAT YOU *CAN*SAY*,
> > in this language,
> >
> > {seDom(f):~sef(s)}.
>
> No, for all I know, one has to *prove* that the diagonal set is a set:
> namely, given a formula, one has to prove that the formula defines a set.
> Otherwise, e.g. Russell set would be a set, too... That said, can you or
> anyone actually show such a proof?
>
> Julio
What do I say about it?
[toc] | [prev] | [next] | [standalone]
Page 8 of 10 — ← Prev page 1 … 6 7 [8] 9 10 Next page →
Back to top | Article view | sci.logic
csiph-web