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 9 of 10 — ← Prev page 1 … 7 8 [9] 10 Next page →
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2017-11-19 20:53 +0000 |
| Message-ID | <874lpqvvlu.fsf@bsb.me.uk> |
| In reply to | #167069 |
Julio Di Egidio <julio@diegidio.name> writes:
> 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.
That is asking too much. All George's set requires is a subset defined
from a formula and that follows from the axiom schema of restricted
comprehension. So yes, you need to show it's a set but that follows
from an axiom.
> Otherwise, e.g. Russell set would be a set, too...
No, the Russell set requires *unrestricted* comprehension (or at least a
very much less restricted form of comprehension than ZF permits).
> That said, can you or
> anyone actually show such a proof?
It's an axiom (in the usual presentation).
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | "Ross A. Finlayson" <ross.finlayson@gmail.com> |
|---|---|
| Date | 2017-11-21 22:38 -0800 |
| Message-ID | <263669e9-0b3e-4714-be76-39da7ef98d1d@googlegroups.com> |
| In reply to | #167076 |
On Sunday, November 19, 2017 at 12:53:21 PM UTC-8, Ben Bacarisse wrote:
> Julio Di Egidio <julio@diegidio.name> writes:
>
> > 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.
>
> That is asking too much. All George's set requires is a subset defined
> from a formula and that follows from the axiom schema of restricted
> comprehension. So yes, you need to show it's a set but that follows
> from an axiom.
>
> > Otherwise, e.g. Russell set would be a set, too...
>
> No, the Russell set requires *unrestricted* comprehension (or at least a
> very much less restricted form of comprehension than ZF permits).
>
> > That said, can you or
> > anyone actually show such a proof?
>
> It's an axiom (in the usual presentation).
>
> --
> Ben.
Russell's "unrestricted" comprehension as of the
just the finite elements themselves that then
there would be Russell's paradox not on all the
infinite sets why there is no top or universe,
but even there's Russell's "paradox" on just those
finite elements themselves just via deduction.
So, well-foundedness and ZF's "restricted" axiom
of infinity really does see that the same system
of "infinitely many" elements already admits the
non-well-foundedness of an infinite set, those.
The axioms of infinity and regularity in ZF then
actually are both restrictions of comprehension,
even though the axiom of infinity introduces a
second constant. Even though then the "completed"
or "built" infinity has all the results of simply
expansions of comprehension (and all the natural
schemas that result) there's still that getting
there besides that Goedel and incompleteness so
follow there's that the incompleteness of the
very constant itself so "defined" in ZF is already
quite very well so constructed in the non-well-founded
from lesser (thus in a sense stronger) logical
axioms and as from expansion of comprehension.
Then those are features that it _does_ have,
not features that it has that it doesn't.
[toc] | [prev] | [next] | [standalone]
| From | George Greene <greeneg@email.unc.edu> |
|---|---|
| Date | 2017-11-19 13:58 -0800 |
| Message-ID | <b6b5aff7-42a8-4882-bd3e-fb20a975f6e1@googlegroups.com> |
| In reply to | #167069 |
On Sunday, November 19, 2017 at 12:12:16 PM UTC-5, 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
Well, you don't know enough, then. IF one has to prove it,
then that is a trivially easy burden to meet. Indeed, as stated
above, the mere TERM above IS a proof that the anti-diagonal set
(the term itself, or its referent anyway) is a set!
HOW DO YOU EXPECT TO MAINTAIN credibility IF YOU DIDN'T KNOW
something THAT basic??
The *F* in ZF is for Frankel's contribution of THE AXIOM SCHEMA OF REPLACEMENT,
which has, AS A COROLLARY, an axiom that was already IN Z, NAMELY,
THE AXIOM SCHEMA OF *SEPARATION*!!
Separation takes two arguments, a bounding set AND A UNARY PREDICATE,
and makes it not just a theorem, BUT AN AXIOM, that the class of things that
both 1) belong to the bounding set, and 2) satisfy the unary predicate,
*IS*A*SET*!
You can't get respected in an argument about Z if you don't know THE MAIN
set-formation axiom *OF*Z*!!!
The proof that
{seDom(f):~sef(s)}
is a set is AS SHORT AS POSSIBLE -- it is ONE LINE long -- it is:
"It's an axiom."
Specifically, it's an instance of the axiom schema of separation with
Dom(f) as the set being separated and ~(.)ef(.) as the unary predicate.
The only way this could fail to be a set is if Dom(f) failed to be a set.
In that case, f would not be a set either and f would NOT EVEN EXIST
in a model of Z, SO THAT IS *NOT*POSSIBLE*.
We're only TRYING to prove the theorem ABOUT sets.
In ZF, *E*V*E*R*Y* element of the domain is a set. ANY variable being quantified over can range ONLY over sets.
JEEzus.
[toc] | [prev] | [next] | [standalone]
| From | Julio Di Egidio <julio@diegidio.name> |
|---|---|
| Date | 2017-11-19 16:11 -0800 |
| Message-ID | <8b58343e-c7ea-42ee-aaf2-6569cec2d6d9@googlegroups.com> |
| In reply to | #167089 |
On Sunday, November 19, 2017 at 10:58:03 PM UTC+1, George Greene wrote:
> On Sunday, November 19, 2017 at 12:12:16 PM UTC-5, 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.]
> Well, you don't know enough, then. IF one has to prove it,
> then that is a trivially easy burden to meet. Indeed, as stated
> above, the mere TERM above IS a proof that the anti-diagonal set
> (the term itself, or its referent anyway) is a set!
>
> HOW DO YOU EXPECT TO MAINTAIN credibility IF YOU DIDN'T KNOW
> something THAT basic??
Indeed basic, and the one who just said a BESTIALITY is just you: and I
couldn't believe it... But the way you admit your mistakes is then true
poetry. What a fucking fraud...
*Plonk*
Julio
[toc] | [prev] | [next] | [standalone]
| From | George Greene <greeneg@email.unc.edu> |
|---|---|
| Date | 2017-11-27 21:18 -0800 |
| Message-ID | <dc08a382-3b83-488a-b62f-1222a67f0175@googlegroups.com> |
| In reply to | #167100 |
On Sunday, November 19, 2017 at 7:11:51 PM UTC-5, Julio Di Egidio wrote: > [namely, given a formula, one has to prove that the formula defines a set.] NO, DUMBASS, THERE IS NOT ANY FORMULA defining a set INVOLVED here! The formula in question may NOT define a set IF you don't ALSO supply A BOUNDING set! THAT IS HOW SEPARATION WORKS!! YOU *DON'T*TRY* to prove that a formula IN ISOLATION "defines a set"! IT TAKES *TWO* ( a pre-KNOWN set AND a formula)!! If both are supplied then the result of separating the set according to the truth-values of the formula (over members of the set) *A*L*W*A*Y*S* defines a set (two sets, really), *BY*AXIOM*!!! Given both a set and a unary predicate, the sets MUST exist and there IS NOTHING *TO* prove!! > > HOW DO YOU EXPECT TO MAINTAIN credibility IF YOU DIDN'T KNOW > > something THAT basic?? > > Indeed basic, and the one who just said a BESTIALITY is just you: FUck you, you are just lying, and you certainly can't QUOTE me saying anything wrong. > and I > couldn't believe it... But the way you admit your mistakes FUCK you, I did NOT make any mistake HERE.
[toc] | [prev] | [next] | [standalone]
| From | "Ross A. Finlayson" <ross.finlayson@gmail.com> |
|---|---|
| Date | 2017-11-28 18:54 -0800 |
| Message-ID | <79cbcd5f-6798-4958-8beb-95b91bbaedf3@googlegroups.com> |
| In reply to | #167564 |
On Monday, November 27, 2017 at 9:18:59 PM UTC-8, George Greene wrote: > On Sunday, November 19, 2017 at 7:11:51 PM UTC-5, Julio Di Egidio wrote: > > [namely, given a formula, one has to prove that the formula defines a set.] > > NO, DUMBASS, THERE IS NOT ANY FORMULA defining a set INVOLVED here! > The formula in question may NOT define a set IF you don't ALSO supply A BOUNDING > set! THAT IS HOW SEPARATION WORKS!! YOU *DON'T*TRY* to prove that a formula > IN ISOLATION "defines a set"! IT TAKES *TWO* ( a pre-KNOWN set AND a formula)!! > If both are supplied then the result of separating the set according to the > truth-values of the formula (over members of the set) *A*L*W*A*Y*S* defines > a set (two sets, really), *BY*AXIOM*!!! Given both a set and a unary predicate, > the sets MUST exist and there IS NOTHING *TO* prove!! > > > > HOW DO YOU EXPECT TO MAINTAIN credibility IF YOU DIDN'T KNOW > > > something THAT basic?? > > > > Indeed basic, and the one who just said a BESTIALITY is just you: > FUck you, you are just lying, and you certainly can't QUOTE me saying anything > wrong. > > > and I > > couldn't believe it... But the way you admit your mistakes > > FUCK you, I did NOT make any mistake HERE. Constructivism? Crunch Crunch Crunch What Cantor's theorem actually says is that the line (segment) is only drawn, motion's course-of-passage through trans-finite induction is more than less the exactly "countable" model of the real with the countable additivity, where of course the complete ordered field is equivalent to the powerset of integers, and no other "function" than the line-drawing or sweep sees the reals of the complete ordered field not uncountable. Or "Finlayson's Cantor's theorem". This for example with all of ZFC. Clearly, I contend that's true, the mathematical foundations and all about them and all that.
[toc] | [prev] | [next] | [standalone]
| From | Julio Di Egidio <julio@diegidio.name> |
|---|---|
| Date | 2017-12-01 07:43 -0800 |
| Message-ID | <50f0450d-c0af-4061-bb5b-f13da0f7f2e6@googlegroups.com> |
| In reply to | #167595 |
On Wednesday, November 29, 2017 at 3:54:36 AM UTC+1, Ross A. Finlayson wrote: > What Cantor's theorem actually says is > that the line (segment) is only drawn, > motion's course-of-passage through trans-finite > induction is more than less the exactly > "countable" model of the real with the > countable additivity, where of course the > complete ordered field is equivalent to the > powerset of integers, and no other "function" > than the line-drawing or sweep sees the reals > of the complete ordered field not uncountable. > > Or "Finlayson's Cantor's theorem". > > This for example with all of ZFC. > > Clearly, I contend that's true, > the mathematical foundations > and all about them and all that. But there is an issue, that is a fact, and you are simply not nailing it: that standard mathematics indeed works, but in the finite and only in the finite. And that is a disagreement and a contention. -- With an analogy: it is not guns that kill people, it is people. Julio
[toc] | [prev] | [next] | [standalone]
| From | "Ross A. Finlayson" <ross.finlayson@gmail.com> |
|---|---|
| Date | 2017-12-01 23:20 -0800 |
| Message-ID | <eaba35cd-0112-42b7-8a89-8d9a4db589fe@googlegroups.com> |
| In reply to | #167660 |
On Friday, December 1, 2017 at 7:43:28 AM UTC-8, Julio Di Egidio wrote: > On Wednesday, November 29, 2017 at 3:54:36 AM UTC+1, Ross A. Finlayson wrote: > > > What Cantor's theorem actually says is > > that the line (segment) is only drawn, > > motion's course-of-passage through trans-finite > > induction is more than less the exactly > > "countable" model of the real with the > > countable additivity, where of course the > > complete ordered field is equivalent to the > > powerset of integers, and no other "function" > > than the line-drawing or sweep sees the reals > > of the complete ordered field not uncountable. > > > > Or "Finlayson's Cantor's theorem". > > > > This for example with all of ZFC. > > > > Clearly, I contend that's true, > > the mathematical foundations > > and all about them and all that. > > But there is an issue, that is a fact, and you are simply not nailing it: > that standard mathematics indeed works, but in the finite and only in the > finite. And that is a disagreement and a contention. -- With an analogy: > it is not guns that kill people, it is people. > > Julio I win all these!
[toc] | [prev] | [next] | [standalone]
| From | Julio Di Egidio <julio@diegidio.name> |
|---|---|
| Date | 2017-12-02 07:09 -0800 |
| Message-ID | <ee17efcb-cc54-4b54-8ad8-acbd22a774d7@googlegroups.com> |
| In reply to | #167705 |
On Saturday, December 2, 2017 at 8:20:15 AM UTC+1, Ross A. Finlayson wrote: <snip> > > finite. And that is a disagreement and a contention. -- With an analogy: > > it is not guns that kill people, it is people. > > I win all these! You just win the title of yet another ass with voting rights. *Plonk* Julio
[toc] | [prev] | [next] | [standalone]
| From | "Ross A. Finlayson" <ross.finlayson@gmail.com> |
|---|---|
| Date | 2017-12-02 10:06 -0800 |
| Message-ID | <856756dd-14fe-4eaf-8b4d-be4cea7bfd3e@googlegroups.com> |
| In reply to | #167709 |
I'm Cantor's successor.
[toc] | [prev] | [next] | [standalone]
| From | "Ross A. Finlayson" <ross.finlayson@gmail.com> |
|---|---|
| Date | 2017-12-10 20:18 -0800 |
| Message-ID | <b5e43c5b-6a11-46c6-98db-8a8c6454ea17@googlegroups.com> |
| In reply to | #167712 |
On Saturday, December 2, 2017 at 10:06:41 AM UTC-8, Ross A. Finlayson wrote: > I'm Cantor's successor. Zermelo and Fraenkel for example are responsible for formalizing and axiomatizing regular, ordinary set theory where all the sets are regular and ordinary even an infinite set (as from nothing). Yet, naive quantification over the elements of that set or over elements generally sees an irregular, extra-ordinary, infinite set, that for example: as all the numbers, contains itself. So, Quine and Aczel for example have formal, axiomatized theories as of the extra-ordinary and for example Scott and boxes and circles. A wide variety of constructivists build real analysis for example as with rational constructions or even firmly in terms of the usual methods of exhaustion besides the axiomatic connection from a "complete" ordered field via LUB or gaplessness then a sigma algebra and measure 1.0, all quite neatly as in foundations and formalisms. Then, I put the classic 1.0 back in that, also implementing a continuous basis and domain between 0 and 1 and also neatly implementing geometry for example with the spiral, space- filling curve as a natural continuum. That being "countable" then in terms of Cantor's theorems of the uncountability otherwise (for no other function) of the real numbers, is a step forward in the facts.
[toc] | [prev] | [next] | [standalone]
| From | Alan Smaill <smaill@SPAMinf.ed.ac.uk> |
|---|---|
| Date | 2017-11-13 12:36 +0000 |
| Message-ID | <fweinee73um.fsf@foxtrot.inf.ed.ac.uk> |
| In reply to | #166786 |
Julio Di Egidio <julio@diegidio.name> writes: > [...] 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, The usual answer: any Cauchy sequence determines a unique limit. So, as long as we are careful and realise that two distinct sequence can have the same limit, we can reason with the sequences, and indeed pointwise operations on the sequences. The usual story involves accepting that there are sequences that cannot be defined with a finite amount of information. So foundational alternatives are that such sequences should be definable in some given syntax or other; or that the sequences should be effective in some computable way. Are either of these issues behind your problem with the standard? > > Julio -- Alan Smaill
[toc] | [prev] | [next] | [standalone]
| From | Julio Di Egidio <julio@diegidio.name> |
|---|---|
| Date | 2017-11-13 04:49 -0800 |
| Message-ID | <8c11ce67-0846-4fd7-8565-abb9d9d6904c@googlegroups.com> |
| In reply to | #166789 |
On Monday, November 13, 2017 at 1:40:04 PM UTC+1, Alan Smaill wrote: > Julio Di Egidio <julio@diegidio.name> writes: > > > [...] 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, > > The usual answer: any Cauchy sequence determines a unique limit. > So, as long as we are careful and realise that two distinct sequence > can have the same limit, That's simply wrong (if I am not mistaken): infinitely many Cauchy sequences have that same limit. So, that's still conflating the sequences with the representations. -- See my last reply to Me for some better wording. Julio
[toc] | [prev] | [next] | [standalone]
| From | Alan Smaill <smaill@SPAMinf.ed.ac.uk> |
|---|---|
| Date | 2017-11-13 13:39 +0000 |
| Message-ID | <fwed14m70x7.fsf@foxtrot.inf.ed.ac.uk> |
| In reply to | #166792 |
Julio Di Egidio <julio@diegidio.name> writes: > On Monday, November 13, 2017 at 1:40:04 PM UTC+1, Alan Smaill wrote: >> Julio Di Egidio <julio@diegidio.name> writes: >> >> > [...] 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, >> >> The usual answer: any Cauchy sequence determines a unique limit. >> So, as long as we are careful and realise that two distinct sequence >> can have the same limit, > > That's simply wrong (if I am not mistaken): infinitely many Cauchy > sequences have that same limit. Right, my mistake. So, Cauchy equences like those based on binary represenantions do have the property I mentioned. And they are enough to reason about real numbers, in the sense I suggested. So I have not understood your overall objection so far. > > Julio -- Alan Smaill
[toc] | [prev] | [next] | [standalone]
| From | Julio Di Egidio <julio@diegidio.name> |
|---|---|
| Date | 2017-11-13 06:14 -0800 |
| Message-ID | <004d0dd0-eef2-41f5-ab68-71c056bab0a4@googlegroups.com> |
| In reply to | #166796 |
On Monday, November 13, 2017 at 2:40:03 PM UTC+1, Alan Smaill wrote: > Julio Di Egidio <julio@diegidio.name> writes: > > On Monday, November 13, 2017 at 1:40:04 PM UTC+1, Alan Smaill wrote: > >> Julio Di Egidio <julio@diegidio.name> writes: > >> > >> > [...] 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, > >> > >> The usual answer: any Cauchy sequence determines a unique limit. > >> So, as long as we are careful and realise that two distinct sequence > >> can have the same limit, > > > > That's simply wrong (if I am not mistaken): infinitely many Cauchy > > sequences have that same limit. > > Right, my mistake. Which one of the many? > So, Cauchy equences like those based on binary represenantions do have > the property I mentioned. The property of having a "unique" limit? And how's that an answer to my question? > And they are enough to reason about real > numbers, in the sense I suggested. In which sense?? I must have missed it. > So I have not understood your overall objection so far. You just snipped my objection: "So, that's still conflating the sequences with the representations." And then I wonder... Julio
[toc] | [prev] | [next] | [standalone]
| From | Alan Smaill <smaill@SPAMinf.ed.ac.uk> |
|---|---|
| Date | 2017-11-13 15:50 +0000 |
| Message-ID | <fwe60ae6uuw.fsf@foxtrot.inf.ed.ac.uk> |
| In reply to | #166797 |
Julio Di Egidio <julio@diegidio.name> writes: > On Monday, November 13, 2017 at 2:40:03 PM UTC+1, Alan Smaill wrote: >> Julio Di Egidio <julio@diegidio.name> writes: >> > On Monday, November 13, 2017 at 1:40:04 PM UTC+1, Alan Smaill wrote: >> >> Julio Di Egidio <julio@diegidio.name> writes: >> >> >> >> > [...] 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, >> >> >> >> The usual answer: any Cauchy sequence determines a unique limit. >> >> So, as long as we are careful and realise that two distinct >> >> sequence can have the same limit, >> > >> > That's simply wrong (if I am not mistaken): infinitely many Cauchy >> > sequences have that same limit. >> >> Right, my mistake. > > Which one of the many? You tell me. >> So, Cauchy equences like those based on binary represenantions do have >> the property I mentioned. > > The property of having a "unique" limit? And how's that an answer to my > question? Because in the that particular case, it is not true that infinitely many of the Cauchy sequences in question have the same limit. I took it that that was your important objection. Another mistake? >> And they are enough to reason about real >> numbers, in the sense I suggested. > > In which sense?? I must have missed it. In the sense that we can reason about equality and inequality of reals by reasoning about the corresponding sequences. >> So I have not understood your overall objection so far. > > You just snipped my objection: > > "So, that's still conflating the sequences with the representations." > > And then I wonder... To conflate, as I understand it, means to regard as *the same thing*. This is not what is happening here; it is fully recognised that two sequences may be different while the corresponding reals are in fact the same. > > Julio -- Alan Smaill
[toc] | [prev] | [next] | [standalone]
| From | Jim Burns <james.g.burns@att.net> |
|---|---|
| Date | 2017-11-13 11:40 -0500 |
| Message-ID | <f1c1806a-8dd7-63e4-5b36-6c3b8e1a3b7a@att.net> |
| In reply to | #166797 |
On 11/13/2017 9:14 AM, Julio Di Egidio wrote:
> On Monday, November 13, 2017 at 2:40:03 PM UTC+1,
> Alan Smaill wrote:
>> Julio Di Egidio <julio@diegidio.name> writes:
>>> On Monday, November 13, 2017 at 1:40:04 PM UTC+1,
>>> Alan Smaill wrote:
>>>> Julio Di Egidio <julio@diegidio.name> writes:
>>>>> [...] 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,
>>>>
>>>> The usual answer: any Cauchy sequence determines a unique
>>>> limit. So, as long as we are careful and realise that
>>>> two distinct sequence can have the same limit,
>>>
>>> That's simply wrong (if I am not mistaken): infinitely
>>> many Cauchy sequences have that same limit.
>>
>> Right, my mistake.
@Alan Smaill
But you _aren't_ mistaken.
For each Cauchy sequence in the reals, there is at least one
and at most one real number which is the limit of that sequence.
That's what you said.
That is not the same as saying that, for each real number,
there is at least one and at most one (or two) Cauchy
sequences for which that real is its limit. The first is
true, the second is false. It's my guess that the second
is related to what JDE is asking about.
> Which one of the many?
@Julio Di Egidio
I am understanding you to be asking which one Cauchy sequence
of many "determines" a given real.
You used a term earlier, "standard sequence". In base ten,
pi has the standard sequence
3., 3.1, 3.14, 3.141, 3.1415, 3.14159, ...
This is the unique _standard sequence_ that determines the real
number pi.
For every standard sequence, there is exactly one real number,
the limit of that Cauchy sequence. For every real number,
there is either exactly one or exactly two (for trailing 9s
and 0s) standard sequence(s).
It is this correspondence between real numbers and standard
sequences that makes the version of Cantor's Theorem with
the anti-diagonal infinite decimal representation a theorem
about _real numbers_ , not merely about decimal representations.
----
By the way, if I have by some chance not yet understood
what you are trying to say, it seems to me that it would move
the conversation forward a lot faster if you were to _explain_
_what you mean_ instead of declaring that I am evil and
flouncing off.
[toc] | [prev] | [next] | [standalone]
| From | "Ross A. Finlayson" <ross.finlayson@gmail.com> |
|---|---|
| Date | 2017-11-08 19:16 -0800 |
| Message-ID | <d564759d-1b4a-4d8b-b1a3-67f8c80a238f@googlegroups.com> |
| In reply to | #166483 |
On Wednesday, November 8, 2017 at 2:36:44 AM UTC-8, Zuhair wrote: > 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. You'd then have to prove that f is onto.
[toc] | [prev] | [next] | [standalone]
| From | Zeit Geist <Tucsondrew@me.com> |
|---|---|
| Date | 2017-11-08 19:47 -0800 |
| Message-ID | <b8770186-ba25-4c4e-9269-cfca6a92296d@googlegroups.com> |
| In reply to | #166517 |
Idiot! On Wednesday, November 8, 2017 at 8:16:12 PM UTC-7, Ross A. Finlayson wrote: > On Wednesday, November 8, 2017 at 2:36:44 AM UTC-8, Zuhair wrote: > > 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. > > You'd then have to prove that f is onto.
[toc] | [prev] | [next] | [standalone]
| From | "Ross A. Finlayson" <ross.finlayson@gmail.com> |
|---|---|
| Date | 2017-11-09 21:55 -0800 |
| Message-ID | <578da8df-5b84-4209-9cbd-600883e0d2bc@googlegroups.com> |
| In reply to | #166521 |
On Wednesday, November 8, 2017 at 7:47:57 PM UTC-8, Zeit Geist wrote: > Idiot! > > On Wednesday, November 8, 2017 at 8:16:12 PM UTC-7, Ross A. Finlayson wrote: > > On Wednesday, November 8, 2017 at 2:36:44 AM UTC-8, Zuhair wrote: > > > 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. > > > > You'd then have to prove that f is onto. Russell's paradox: apply it to the world of finite sets. Or, for example, consider a universe in a set theory and notice it contains itself and is its own powerset. These are among reasons why there are purely logical sets that are not well-founded or ordinary as among from the finite. Goedel's incompleteness provides that there are true statements about the objects of the ordinary theory beyond those extant theorems of the theory. "What Cantor's Theorem Actually Says": Cantor proves the line is only drawn. Then that there is more than Dedekind's definition of continuous as of a continuous domain has that there is a quite simpler model than as results of the usual course of modern abstract algebra, fundamentally establishing real analysis without the extra definitions of support of LUB (a definition) and measure 1.0 (a definition), with that "real analysis via ZFC" is "real analysis via ZFC and LUB and measure 1.0". Here then this line continuity as simply drawing a line between zero and one (and via extension in the integer lattice for the integer and non-integer part of real numbers) is simple, obvious, and clear, for those who understand there are extra-ordinary sets in set theory. (This then has simple notions of ubiquitous ordinals and again of the continuum for the role of successor as of Cantor's theorem and the missing element: none.) So, the only use of real analysis for transfinite cardinals is: there's a unique exception because the reals have more than one model (as sets), and, that's a usual, regular, infinity. And it's a real infinity.
[toc] | [prev] | [next] | [standalone]
Page 9 of 10 — ← Prev page 1 … 7 8 [9] 10 Next page →
Back to top | Article view | sci.logic
csiph-web