Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > sci.logic > #164770 > unrolled thread
| Started by | WM <wolfgang.mueckenheim@hs-augsburg.de> |
|---|---|
| First post | 2017-10-11 05:37 -0700 |
| Last post | 2017-10-21 00:04 -0700 |
| Articles | 20 on this page of 265 — 16 participants |
Back to article view | Back to sci.logic
Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-11 05:37 -0700
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-10-11 10:49 -0500
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-11 09:49 -0700
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-10-11 14:08 -0500
Re: Some axioms like the axiom of choice khongdongphong@gmail.com - 2017-10-11 12:23 -0700
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-10-11 15:50 -0500
Re: Some axioms like the axiom of choice khongdongphong@gmail.com - 2017-10-11 18:01 -0700
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-10-11 21:46 -0500
Re: Some axioms like the axiom of choice khongdongphong@gmail.com - 2017-10-11 20:03 -0700
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-10-11 22:48 -0500
Re: Some axioms like the axiom of choice khongdongphong@gmail.com - 2017-10-11 21:06 -0700
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-10-12 04:33 -0500
Re: Some axioms like the axiom of choice "Shobe, Martin" <martin.shobe@yahoo.com> - 2017-10-12 06:58 -0500
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-10-13 05:34 -0500
Re: Some axioms like the axiom of choice Peter Percival <peterxpercival@hotmail.com> - 2017-10-12 11:36 +0100
Re: Some axioms like the axiom of choice Peter Percival <peterxpercival@hotmail.com> - 2017-10-14 18:48 +0100
Re: Some axioms like the axiom of choice Peter Percival <peterxpercival@hotmail.com> - 2017-10-14 19:13 +0100
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-10-14 11:35 -0700
Re: Some axioms like the axiom of choice Peter Percival <peterxpercival@hotmail.com> - 2017-10-20 11:53 +0100
Re: Some axioms like the axiom of choice George Greene <greeneg@email.unc.edu> - 2017-10-14 19:33 -0700
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-10-15 08:57 -0500
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-10-15 08:59 -0500
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-10-15 09:07 -0500
Re: Some axioms like the axiom of choice George Greene <greeneg@email.unc.edu> - 2017-10-14 19:36 -0700
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-10-15 09:08 -0500
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-10-15 09:13 -0500
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-11 23:28 -0700
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-10-12 05:08 -0500
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-12 04:36 -0700
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-10-13 19:29 -0500
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-14 01:27 -0700
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-10-14 03:14 -0700
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-10-14 08:48 -0500
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-10-14 10:32 -0700
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-10-14 14:04 -0500
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-10-14 12:25 -0700
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-10-14 12:43 -0700
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-10-14 20:17 -0500
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-10-14 18:59 -0700
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-10-14 20:14 -0500
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-10-14 18:58 -0700
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-10-14 21:32 -0500
Re: Some axioms like the axiom of choice George Greene <greeneg@email.unc.edu> - 2017-10-25 20:47 -0700
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-11-01 19:36 -0500
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-10-14 12:35 -0700
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-10-14 21:00 -0500
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-10-14 12:39 -0700
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-10-14 21:22 -0500
Re: Some axioms like the axiom of choice George Greene <greeneg@email.unc.edu> - 2017-10-14 19:27 -0700
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-10-14 22:33 -0500
Re: Some axioms like the axiom of choice George Greene <greeneg@email.unc.edu> - 2017-10-14 19:28 -0700
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-10-14 22:39 -0500
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-10-15 14:32 -0500
Re: Some axioms like the axiom of choice grahamcooper7@gmail.com - 2017-10-16 14:42 -0700
Re: Some axioms like the axiom of choice Rupert <rupertmccallum@yahoo.com> - 2017-11-02 22:11 -0700
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-11-03 20:32 -0500
Re: Some axioms like the axiom of choice Rupert <rupertmccallum@yahoo.com> - 2017-11-04 10:24 -0700
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-11-05 18:19 -0600
Re: Some axioms like the axiom of choice Rupert <rupertmccallum@yahoo.com> - 2017-11-06 04:03 -0800
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-11-07 22:12 -0600
Re: Some axioms like the axiom of choice Jim Burns <james.g.burns@att.net> - 2017-11-13 19:51 -0500
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-11-15 20:37 -0600
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-11-03 20:49 -0500
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-11-04 06:48 -0500
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-11-04 08:45 -0500
Re: Some axioms like the axiom of choice George Greene <greeneg@email.unc.edu> - 2017-10-14 12:51 -0700
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-15 13:01 -0700
Re: Some axioms like the axiom of choice shionoro@googlemail.com - 2017-10-11 09:04 -0700
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-11 09:31 -0700
Re: Some axioms like the axiom of choice shionoro@googlemail.com - 2017-10-11 10:00 -0700
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-11 23:15 -0700
Re: Some axioms like the axiom of choice Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-12 11:24 +0100
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-12 04:44 -0700
Re: Some axioms like the axiom of choice Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-12 20:08 +0100
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-13 02:33 -0700
Re: Some axioms like the axiom of choice Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-13 21:41 +0100
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-14 00:32 -0700
Re: Some axioms like the axiom of choice Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-14 21:27 +0100
Re: Some axioms like the axiom of choice Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-16 00:35 +0100
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-15 23:57 -0700
Re: Some axioms like the axiom of choice George Greene <greeneg@email.unc.edu> - 2017-10-16 16:53 -0700
Re: Some axioms like the axiom of choice Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-17 02:01 +0100
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-17 03:02 -0700
Re: Some axioms like the axiom of choice Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-18 01:30 +0100
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-17 22:35 -0700
Re: Some axioms like the axiom of choice Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-18 16:04 +0100
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-18 23:30 -0700
Re: Some axioms like the axiom of choice Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-19 18:10 +0100
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-20 03:30 -0700
Re: Some axioms like the axiom of choice Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-21 00:01 +0100
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-20 23:12 -0700
Re: Some axioms like the axiom of choice Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-21 15:31 +0100
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-22 04:37 -0700
Re: Some axioms like the axiom of choice Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-22 21:41 +0100
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-23 02:57 -0700
Re: Some axioms like the axiom of choice Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-23 16:43 +0100
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-26 00:46 -0700
Re: Some axioms like the axiom of choice Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-26 23:32 +0100
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-27 02:57 -0700
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-10-27 03:07 -0700
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-27 08:45 -0700
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-10-27 14:55 -0700
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-28 05:00 -0700
Re: Some axioms like the axiom of choice Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-27 22:11 +0100
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-28 04:59 -0700
Re: Some axioms like the axiom of choice Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-28 18:24 +0100
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-29 07:04 -0700
Re: Some axioms like the axiom of choice Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-29 15:10 +0000
Re: Some axioms like the axiom of choice George Greene <greeneg@email.unc.edu> - 2017-10-30 04:04 -0700
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-30 08:18 -0700
Re: Some axioms like the axiom of choice bursejan@gmail.com - 2017-11-01 17:43 -0700
Re: Some axioms like the axiom of choice George Greene <greeneg@email.unc.edu> - 2017-11-02 18:55 -0700
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-11-03 03:02 -0700
Re: Some axioms like the axiom of choice Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-03 11:41 +0000
Re: Some axioms like the axiom of choice George Greene <greeneg@email.unc.edu> - 2017-11-17 12:31 -0800
Re: Some axioms like the axiom of choice Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-17 23:29 +0000
Re: Some axioms like the axiom of choice Zeit Geist <Tucsondrew@me.com> - 2017-11-17 17:04 -0800
Re: Some axioms like the axiom of choice "Shobe, Martin" <martin.shobe@yahoo.com> - 2017-11-17 19:19 -0600
Re: Some axioms like the axiom of choice Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2017-11-18 01:56 +0000
Re: Some axioms like the axiom of choice "Shobe, Martin" <martin.shobe@yahoo.com> - 2017-11-19 15:04 -0600
Re: Some axioms like the axiom of choice Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2017-11-19 22:56 +0000
Re: Some axioms like the axiom of choice Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-18 02:04 +0000
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-11-18 08:42 -0800
Re: Some axioms like the axiom of choice Zeit Geist <Tucsondrew@me.com> - 2017-11-18 15:30 -0800
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-11-19 02:08 -0800
Re: Some axioms like the axiom of choice Zeit Geist <Tucsondrew@me.com> - 2017-11-19 09:41 -0800
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-11-19 13:38 -0800
Re: Some axioms like the axiom of choice Zeit Geist <Tucsondrew@me.com> - 2017-11-20 09:28 -0800
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-11-20 09:33 -0800
Re: Some axioms like the axiom of choice Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2017-11-20 19:47 +0000
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-11-21 05:56 -0800
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-11-21 06:03 -0800
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-11-21 06:18 -0800
Re: Some axioms like the axiom of choice bursejan@gmail.com - 2017-11-21 07:34 -0800
Re: Some axioms like the axiom of choice bursejan@gmail.com - 2017-11-21 07:53 -0800
Re: Some axioms like the axiom of choice George Greene <greeneg@email.unc.edu> - 2017-11-27 21:10 -0800
Re: Some axioms like the axiom of choice Zeit Geist <Tucsondrew@me.com> - 2017-11-18 15:04 -0800
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-11-19 02:11 -0800
Re: Some axioms like the axiom of choice Zeit Geist <Tucsondrew@me.com> - 2017-11-19 09:43 -0800
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-11-19 13:39 -0800
Re: Some axioms like the axiom of choice "Shobe, Martin" <martin.shobe@yahoo.com> - 2017-11-19 15:14 -0600
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-11-18 08:36 -0800
Re: Some axioms like the axiom of choice bursejan@gmail.com - 2017-11-18 08:38 -0800
Re: Some axioms like the axiom of choice bursejan@gmail.com - 2017-11-18 08:39 -0800
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-11-18 08:51 -0800
Re: Some axioms like the axiom of choice bursejan@gmail.com - 2017-11-18 09:30 -0800
Re: Some axioms like the axiom of choice Zeit Geist <Tucsondrew@me.com> - 2017-11-18 15:31 -0800
Re: Some axioms like the axiom of choice Zeit Geist <Tucsondrew@me.com> - 2017-11-18 15:19 -0800
Re: Some axioms like the axiom of choice George Greene <greeneg@email.unc.edu> - 2017-11-17 21:05 -0800
Re: Some axioms like the axiom of choice George Greene <greeneg@email.unc.edu> - 2017-11-19 07:39 -0800
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-11-18 04:37 -0800
Re: Some axioms like the axiom of choice Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-19 02:14 +0000
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-11-19 02:03 -0800
Re: Some axioms like the axiom of choice Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-20 01:18 +0000
Re: Some axioms like the axiom of choice George Greene <greeneg@email.unc.edu> - 2017-11-19 01:22 -0800
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-11-18 04:38 -0800
Re: Some axioms like the axiom of choice Zeit Geist <Tucsondrew@me.com> - 2017-11-18 15:09 -0800
Re: Some axioms like the axiom of choice George Greene <greeneg@email.unc.edu> - 2017-11-19 01:24 -0800
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-11-19 01:56 -0800
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-11-19 03:18 -0800
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-11-19 13:39 -0800
Re: Some axioms like the axiom of choice bursejan@gmail.com - 2017-11-19 15:16 -0800
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-11-19 16:24 -0800
Re: Some axioms like the axiom of choice George Greene <greeneg@email.unc.edu> - 2017-11-07 16:57 -0800
Re: Some axioms like the axiom of choice George Greene <greeneg@email.unc.edu> - 2017-11-07 16:57 -0800
Re: Some axioms like the axiom of choice George Greene <greeneg@email.unc.edu> - 2017-10-24 16:57 -0700
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-10-24 22:54 -0700
Re: Some axioms like the axiom of choice Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-26 23:40 +0100
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-10-27 01:07 -0700
Re: Some axioms like the axiom of choice Jim Burns <james.g.burns@att.net> - 2017-10-27 11:15 -0400
Re: Some axioms like the axiom of choice Peter Percival <peterxpercival@hotmail.com> - 2017-10-27 16:48 +0100
Re: Some axioms like the axiom of choice George Greene <greeneg@email.unc.edu> - 2017-10-22 12:23 -0700
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-10-22 13:11 -0700
Re: Some axioms like the axiom of choice George Greene <greeneg@email.unc.edu> - 2017-10-25 20:38 -0700
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-26 00:22 -0700
Re: Some axioms like the axiom of choice shionoro@googlemail.com - 2017-10-13 02:08 -0700
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-13 02:30 -0700
Re: Some axioms like the axiom of choice shionoro@googlemail.com - 2017-10-13 02:37 -0700
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-13 03:02 -0700
Re: Some axioms like the axiom of choice shionoro@googlemail.com - 2017-10-13 03:50 -0700
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-13 13:20 -0700
Re: Some axioms like the axiom of choice shionoro@googlemail.com - 2017-10-14 08:02 -0700
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-14 11:17 -0700
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-10-14 11:46 -0700
Re: Some axioms like the axiom of choice shionoro@googlemail.com - 2017-10-14 12:04 -0700
Re: Some axioms like the axiom of choice George Greene <greeneg@email.unc.edu> - 2017-10-14 12:50 -0700
Re: Some axioms like the axiom of choice "Shobe, Martin" <martin.shobe@yahoo.com> - 2017-10-14 21:29 -0500
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-15 13:06 -0700
Re: Some axioms like the axiom of choice "Shobe, Martin" <martin.shobe@yahoo.com> - 2017-10-16 20:32 -0500
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-17 02:44 -0700
Re: Some axioms like the axiom of choice shionoro@googlemail.com - 2017-10-17 07:57 -0700
Re: Some axioms like the axiom of choice George Greene <greeneg@email.unc.edu> - 2017-10-17 12:56 -0700
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-10-17 13:20 -0700
Re: Some axioms like the axiom of choice shionoro@googlemail.com - 2017-10-17 20:51 -0700
Re: Some axioms like the axiom of choice khongdongphong@gmail.com - 2017-10-17 21:06 -0700
Re: Some axioms like the axiom of choice khongdongphong@gmail.com - 2017-10-17 22:14 -0700
Re: Some axioms like the axiom of choice shionoro@googlemail.com - 2017-10-18 02:53 -0700
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-17 22:44 -0700
Re: Some axioms like the axiom of choice khongdongphong@gmail.com - 2017-10-17 22:51 -0700
Re: Some axioms like the axiom of choice shionoro@googlemail.com - 2017-10-18 02:54 -0700
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-18 23:19 -0700
Re: Some axioms like the axiom of choice shionoro@googlemail.com - 2017-10-19 04:43 -0700
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-10-19 05:17 -0700
Re: Some axioms like the axiom of choice shionoro@googlemail.com - 2017-10-24 22:40 -0700
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-10-24 22:44 -0700
Re: Some axioms like the axiom of choice shionoro@googlemail.com - 2017-10-25 10:54 -0700
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-20 03:14 -0700
Re: Some axioms like the axiom of choice George Greene <greeneg@email.unc.edu> - 2017-10-17 12:54 -0700
Re: Some axioms like the axiom of choice George Greene <greeneg@email.unc.edu> - 2017-10-15 15:19 -0700
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-15 23:44 -0700
Re: Some axioms like the axiom of choice George Greene <greeneg@email.unc.edu> - 2017-10-16 16:50 -0700
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-17 02:45 -0700
Re: Some axioms like the axiom of choice George Greene <greeneg@email.unc.edu> - 2017-10-17 13:54 -0700
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-17 22:52 -0700
Re: Some axioms like the axiom of choice George Greene <greeneg@email.unc.edu> - 2017-10-17 13:55 -0700
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-17 22:53 -0700
Re: Some axioms like the axiom of choice George Greene <greeneg@email.unc.edu> - 2017-10-18 21:04 -0700
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-18 23:15 -0700
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-15 12:59 -0700
Re: Some axioms like the axiom of choice George Greene <greeneg@email.unc.edu> - 2017-10-15 15:23 -0700
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-15 23:46 -0700
Re: Some axioms like the axiom of choice George Greene <greeneg@email.unc.edu> - 2017-10-15 15:25 -0700
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-15 23:54 -0700
Re: Some axioms like the axiom of choice Peter Percival <peterxpercival@hotmail.com> - 2017-10-17 22:05 +0100
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-17 22:40 -0700
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-10-18 19:59 -0500
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-18 23:25 -0700
Re: Some axioms like the axiom of choice George Greene <greeneg@email.unc.edu> - 2017-10-19 20:10 -0700
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-10-19 20:30 -0700
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-10-19 20:36 -0700
Re: Some axioms like the axiom of choice George Greene <greeneg@email.unc.edu> - 2017-10-22 13:17 -0700
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-10-22 13:27 -0700
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-10-22 15:09 -0700
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-10-23 10:58 -0500
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-10-23 09:12 -0700
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-10-23 09:17 -0700
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-10-23 14:59 -0500
Re: Some axioms like the axiom of choice Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2017-10-23 17:32 +0100
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-10-23 09:47 -0700
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-10-23 09:51 -0700
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-10-23 16:10 -0500
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-10-23 15:39 -0700
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-10-24 10:27 -0500
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-10-23 15:17 -0500
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-10-23 15:51 -0700
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-10-24 05:23 -0500
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-10-24 08:33 -0700
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-10-24 14:43 -0500
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-10-24 22:40 -0700
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-10-24 14:58 -0500
Re: Some axioms like the axiom of choice Jim Burns <james.g.burns@att.net> - 2017-10-25 13:33 -0400
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-10-25 20:11 -0700
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-11-02 22:40 -0500
Re: Some axioms like the axiom of choice George Greene <greeneg@email.unc.edu> - 2017-10-25 20:31 -0700
Re: Some axioms like the axiom of choice mitch <mitch@dev.null> - 2017-10-26 05:35 -0500
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-10-22 15:05 -0700
Re: Some axioms like the axiom of choice George Greene <greeneg@email.unc.edu> - 2017-10-20 17:51 -0700
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-20 23:16 -0700
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-10-20 23:55 -0700
Re: Some axioms like the axiom of choice Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-21 15:14 +0100
Re: Some axioms like the axiom of choice WM <wolfgang.mueckenheim@hs-augsburg.de> - 2017-10-22 04:37 -0700
Re: Some axioms like the axiom of choice Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-22 21:42 +0100
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-10-22 13:48 -0700
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-10-20 23:46 -0700
Re: Some axioms like the axiom of choice Julio Di Egidio <julio@diegidio.name> - 2017-10-21 00:04 -0700
Page 8 of 14 — ← Prev page 1 … 6 7 [8] 9 10 … 14 Next page →
| From | "Shobe, Martin" <martin.shobe@yahoo.com> |
|---|---|
| Date | 2017-11-19 15:14 -0600 |
| Message-ID | <ouss7b$td8$1@dont-email.me> |
| In reply to | #167039 |
On 11/18/2017 5:04 PM, Zeit Geist wrote: > On Friday, November 17, 2017 at 6:19:59 PM UTC-7, Shobe, Martin wrote: >> On 11/17/2017 7:04 PM, Zeit Geist wrote: >>> On Friday, November 17, 2017 at 4:30:04 PM UTC-7, Ben Bacarisse wrote: >>>> George Greene <greeneg@email.unc.edu> writes: >>>> >>>>> On Friday, November 3, 2017 at 7:41:47 AM UTC-4, Ben Bacarisse wrote: >>>>>> But the binary tree with only finite paths is not the >>>>>> tree whose paths anyone is asking you to find an enumeration of. >>>>> >>>>> Careful, Ben, careful. >>>>> >>>>> This object DOES NOT EXIST, so you can't concede >>>>> that WM ever even referred to it, or ever even succeeded in any >>>>> attempt to refer to it. >>>> >>>> I don't think it's that clear cut. I think he did (maybe >>>> unintentionally) refer to such an object when he pretended to have a >>>> bijection between N and paths. He also hinted at this other kind of >>>> object (again maybe unintentionally) by talking about paths defined by >>>> (set of) nodes. >>>> >>>> If you ditch the idea that a tree is made of nodes and edges but is, >>>> instead, just a set of paths, you can have something that looks like a >>>> binary tree but has only finite paths. WM is not consistently thinking >>>> about such a thing (his PDF includes only two example paths and both are >>>> infinite), but it is a thing that *looks* like a binary tree. >>>> >>>>> "The binary tree with only finite paths", I repeat, DOES NOT EXIST. >>>> >>>> I don't see why such a thing can't be defined. It shreds a whole bunch >>>> of graph theory, but WM does that sort of thing before breakfast. >>> >>> I think what George is referring to is a binary tree with only finite paths, but which contains all finite paths. That object definitely does not exist. >>> >>> PROOF: Suppose T is a binary tree such for all n e N, we have all paths of length n are in T. Furthermore assume there are no infinite paths in T. Since T contains no infinite paths, there exist some natural N such that the longest path has length N. >> >> This doesn't follow immediately. There's no maximum length to the paths >> in the set of finite paths, but there's certainly no infinite paths in >> that set. > > Sure it does. Assume that the root node of tree represents the empty sequence. Also, assume in the tree that we take “follow the path to left” meaning append a 0 to the sequence, and “following the path to the right” meaning append a 1. Also assume that the root node represents the empty sequence. We know we have a path representing each finite sequence of 1’s. Also, if P is path representing a sequence of 1’s of length n and path Q represents a sequence of 1’s of length m, then P is a subpath of Q if and only if n <= m. Therefore, all paths representing the finite sequences of 1’s must be contained in an infinite path of 1’s. If you don’t believe that, then assume to contrary and follow what I wrote above. > > If I missing something, please let me know. Sure. Your conclusion if this argument isn't what you are trying to prove. Your conclusion is that an infinite path of 1s contains every finite path of 1s. What you are trying to prove is that a binary tree with no infinite paths must have a maximum path length. Martin Shobe
[toc] | [prev] | [next] | [standalone]
| From | WM <wolfgang.mueckenheim@hs-augsburg.de> |
|---|---|
| Date | 2017-11-18 08:36 -0800 |
| Message-ID | <12290293-e4ce-4b95-b659-5d8a9ec3572d@googlegroups.com> |
| In reply to | #167002 |
Am Samstag, 18. November 2017 02:05:00 UTC+1 schrieb Zeit Geist: > I think what George is referring to is a binary tree with only finite paths, but which contains all finite paths. That object definitely does not exist. That object definitely does exist if and only if a set |N exists that contains all finite natural numbers (or all nodes of the Binary Tree). > > PROOF: Suppose T is a binary tree such for all n e N, we have all paths of length n are in T. Furthermore assume there are no infinite paths in T. Since T contains no infinite paths, there exist some natural N such that the longest path has length N. That is equivalent to the non-existence proof of |N: PROOF: Suppose |N a set such that all numbers n are in |N. Furthermore assume there are no infinite number n. Since |N contains no infinite numbers, there exist some largest natural N. However, there’s exist a number N+1; and thus, we have a contradiction. Therefore, no set |N exists. Regards, WM
[toc] | [prev] | [next] | [standalone]
| From | bursejan@gmail.com |
|---|---|
| Date | 2017-11-18 08:38 -0800 |
| Message-ID | <9bcfa3f8-dd1f-4d7b-9819-38a08940c380@googlegroups.com> |
| In reply to | #167022 |
By axiom of infinity, such as set exists: Axioms of set Theory - Lec 02 - Frederic Schulle time 1:29:00 to 1:33:00 https://www.youtube.com/watch?v=AAJB9l-HAZs Am Samstag, 18. November 2017 17:36:08 UTC+1 schrieb WM: > Am Samstag, 18. November 2017 02:05:00 UTC+1 schrieb Zeit Geist: > > > I think what George is referring to is a binary tree with only finite paths, but which contains all finite paths. That object definitely does not exist. > > That object definitely does exist if and only if a set |N exists that contains all finite natural numbers (or all nodes of the Binary Tree). > > > > PROOF: Suppose T is a binary tree such for all n e N, we have all paths of length n are in T. Furthermore assume there are no infinite paths in T. Since T contains no infinite paths, there exist some natural N such that the longest path has length N. > > That is equivalent to the non-existence proof of |N: > > PROOF: Suppose |N a set such that all numbers n are in |N. Furthermore assume there are no infinite number n. Since |N contains no infinite numbers, there exist some largest natural N. > > However, there’s exist a number N+1; and thus, we have a contradiction. Therefore, no set |N exists. > > Regards, WM
[toc] | [prev] | [next] | [standalone]
| From | bursejan@gmail.com |
|---|---|
| Date | 2017-11-18 08:39 -0800 |
| Message-ID | <35c1522f-cf94-4e1a-9004-e7625f5f71f4@googlegroups.com> |
| In reply to | #167023 |
Damned again, Corr.: Axioms of set Theory - Lec 02 - Frederic Schuller Copy pasta error, the last r went missing. Am Samstag, 18. November 2017 17:38:31 UTC+1 schrieb burs...@gmail.com: > By axiom of infinity, such as set exists: > > Axioms of set Theory - Lec 02 - Frederic Schulle > time 1:29:00 to 1:33:00 > https://www.youtube.com/watch?v=AAJB9l-HAZs > > Am Samstag, 18. November 2017 17:36:08 UTC+1 schrieb WM: > > Am Samstag, 18. November 2017 02:05:00 UTC+1 schrieb Zeit Geist: > > > > > I think what George is referring to is a binary tree with only finite paths, but which contains all finite paths. That object definitely does not exist. > > > > That object definitely does exist if and only if a set |N exists that contains all finite natural numbers (or all nodes of the Binary Tree). > > > > > > PROOF: Suppose T is a binary tree such for all n e N, we have all paths of length n are in T. Furthermore assume there are no infinite paths in T. Since T contains no infinite paths, there exist some natural N such that the longest path has length N. > > > > That is equivalent to the non-existence proof of |N: > > > > PROOF: Suppose |N a set such that all numbers n are in |N. Furthermore assume there are no infinite number n. Since |N contains no infinite numbers, there exist some largest natural N. > > > > However, there’s exist a number N+1; and thus, we have a contradiction. Therefore, no set |N exists. > > > > Regards, WM
[toc] | [prev] | [next] | [standalone]
| From | WM <wolfgang.mueckenheim@hs-augsburg.de> |
|---|---|
| Date | 2017-11-18 08:51 -0800 |
| Message-ID | <dfbe541e-0419-489a-8807-29dfd4a133f3@googlegroups.com> |
| In reply to | #167023 |
Am Samstag, 18. November 2017 17:38:31 UTC+1 schrieb burs...@gmail.com: > By axiom of infinity, such as set exists: Then by the axiom of infinity the Binary Tree containing all finite paths exists. Then there are infinite paths that cannot be defined by nodes. Then there are subsets of |N that cannot be defined by their elements. Regards, WM
[toc] | [prev] | [next] | [standalone]
| From | bursejan@gmail.com |
|---|---|
| Date | 2017-11-18 09:30 -0800 |
| Message-ID | <9fc43c55-e9f9-4191-9867-63e6988fd7f9@googlegroups.com> |
| In reply to | #167026 |
Good thing is there are augsburg crank institute membes that can be define by the predication most childish and incompetent, mr. muckefunk it is. Am Samstag, 18. November 2017 17:51:38 UTC+1 schrieb WM: > Am Samstag, 18. November 2017 17:38:31 UTC+1 schrieb burs...@gmail.com: > > By axiom of infinity, such as set exists: > > Then by the axiom of infinity the Binary Tree containing all finite paths exists. > > Then there are infinite paths that cannot be defined by nodes. > Then there are subsets of |N that cannot be defined by their elements. > > Regards, WM
[toc] | [prev] | [next] | [standalone]
| From | Zeit Geist <Tucsondrew@me.com> |
|---|---|
| Date | 2017-11-18 15:31 -0800 |
| Message-ID | <110be60c-c6c0-458b-8bf0-f3a0491e576e@googlegroups.com> |
| In reply to | #167026 |
On Saturday, November 18, 2017 at 9:51:38 AM UTC-7, WM wrote: > Am Samstag, 18. November 2017 17:38:31 UTC+1 schrieb burs...@gmail.com: > > By axiom of infinity, such as set exists: > > Then by the axiom of infinity the Binary Tree containing all finite paths exists. > > Then there are infinite paths that cannot be defined by nodes. > Then there are subsets of |N that cannot be defined by their elements. Stuck in a corner? Just snip what you can’t rebut and then speak your own undefined language. Good job! > Regards, WM ZG
[toc] | [prev] | [next] | [standalone]
| From | Zeit Geist <Tucsondrew@me.com> |
|---|---|
| Date | 2017-11-18 15:19 -0800 |
| Message-ID | <c92a21cc-d9ea-4470-ae94-0a55c5254f70@googlegroups.com> |
| In reply to | #167022 |
On Saturday, November 18, 2017 at 9:36:08 AM UTC-7, WM wrote: > Am Samstag, 18. November 2017 02:05:00 UTC+1 schrieb Zeit Geist: > > > I think what George is referring to is a binary tree with only finite paths, but which contains all finite paths. That object definitely does not exist. > > That object definitely does exist if and only if a set |N exists that contains all finite natural numbers (or all nodes of the Binary Tree). > > > > PROOF: Suppose T is a binary tree such for all n e N, we have all paths of length n are in T. Furthermore assume there are no infinite paths in T. Since T contains no infinite paths, there exist some natural N such that the longest path has length N. > > That is equivalent to the non-existence proof of |N: > > PROOF: Suppose |N a set such that all numbers n are in |N. Furthermore assume there are no infinite number n. Since |N contains no infinite numbers, there exist some largest natural N. > > However, there’s exist a number N+1; and thus, we have a contradiction. Therefore, no set |N exists. Again, the more you talk the dumber you look. I never said that there exists an infinite level in the binary tree, which is analogous to your “There exist an infinite number”. Damn, you’re stupid. If want to change ito the natural numbers, you would “suppose there exist no infinite sequence of natural number”. Then the proof would then reach a contradiction. > Regards, WM ZG
[toc] | [prev] | [next] | [standalone]
| From | George Greene <greeneg@email.unc.edu> |
|---|---|
| Date | 2017-11-17 21:05 -0800 |
| Message-ID | <32280122-c5c8-4b79-a273-62cfdf2c8d49@googlegroups.com> |
| In reply to | #167000 |
On Friday, November 17, 2017 at 6:30:04 PM UTC-5, Ben Bacarisse wrote: > I don't think it's that clear cut. I think he did (maybe > unintentionally) refer to such an object when he pretended to have a > bijection between N and paths. No, it's abundantly clear that he did NOT refer to such an object when he had (that wasn't pretending; that bijection DOES exist so WE ALL have it) a bijection between N and the finite paths. There are only a countable number of nodes IN the tree and there is a unique path from the root to every node, so simply traversing *the* infininte (omega-depth, specifically) binary tree IN PREorder gives a bijection between N and every node in the tree, and, thence, between N and every path ending at the nth node. But the point is, those finite paths end at the nodes of THE INFINITE binary tree, and since this tree has infinite depth, IT MUST, DESPITE the fact that every node in it IS A FINITE distance from the root, ALSO HAVE INFINITE paths through it, IN ADDITION to all the finite ones. SO *IT*IS*NOT* the non-existent object he tried but failed to refer to (AS ALL such attempts must fail), i.e., "the binary tree with only finite paths". There ARE many binary trees "with only finite paths", BUT ALL THOSE BINARY TREES *ARE*FINITE*, so NONE of them CAN be the (non-existent) "The binary tree with only finite paths". > He also hinted at this other kind of > object (again maybe unintentionally) by talking about paths defined by > (set of) nodes. Well, fine, but if that happened, then that is, precisely as you just said, AN*OTHER*KIND of object, OTHER THAN a binary tree!
[toc] | [prev] | [next] | [standalone]
| From | George Greene <greeneg@email.unc.edu> |
|---|---|
| Date | 2017-11-19 07:39 -0800 |
| Message-ID | <973f11db-3710-43d4-8777-80076ef43fc8@googlegroups.com> |
| In reply to | #167010 |
On Saturday, November 18, 2017 at 12:05:50 AM UTC-5, George Greene wrote: > so simply traversing *the* infininte (omega-depth, specifically) binary tree > IN PREorder gives a bijection between N and every node in the tree, This was not correct; a preorder traversal would number the left edge of the tree (0)1,2,3,4,5,... and leave no numbers available for any other nodes; it would not complete, on an infinite tree; it would never get off the left edge. The simple binary tree traversal algorithms from intro CS were designed for finite trees. What I had in mind was basically&arguably a "breadth-first search" traversal, but that is also hard to describe here because 1) the wikipedia article IS A TOTAL piece of crap -- it brags about a non-recursive *implementation* WITHOUT EVEN STATING the (RECURSIVE) *definition*, and 2) we're not searching for anything here. After thinking about it harder, the best definition I can give for the traversal that produces the "horizontal" numbering is: (to traverse) 1) visit the root (IF it has not ALREADY been visited); that's a horrific kludge but otherwise everything except the overall root is going to get visited twice); 2) visit EACH (immediate) child-node (the root of each subtree) in some standard (left-to-right) order; 3) traverse each subtree, in the same order as 2). When performing step 3, when traversing a subtree, this will first perform step 1 on that subtree and visit its root, first, AGAIN, since the root was already visited in step 2). I'm SORRY about that but the simple straightforward recursive definition is not currently in the correct place and I personally do not fight wikipedia battles. I would be glad to start IF I COULD GET SOME ALLIES! In any case, this could also be described as a horizontal traversal >> 0 >>\\ //<< <<// \\>> 1 2 >>\\ //<< <<// \\>> 3 4 5 6 >>\\
[toc] | [prev] | [next] | [standalone]
| From | WM <wolfgang.mueckenheim@hs-augsburg.de> |
|---|---|
| Date | 2017-11-18 04:37 -0800 |
| Message-ID | <5a8e4f67-0290-4d9c-94f8-e3cad1cdfd71@googlegroups.com> |
| In reply to | #167000 |
Am Samstag, 18. November 2017 00:30:04 UTC+1 schrieb Ben Bacarisse: > George Greene <greeneg@email.unc.edu> writes: > > This object DOES NOT EXIST, so you can't concede > > that WM ever even referred to it, or ever even succeeded in any > > attempt to refer to it. > > I don't think it's that clear cut. I think he did (maybe > unintentionally) that's an insult! > refer to such an object when he pretended to have a > bijection between N and paths. There is a bijection: Every finite path can be mapped on its last node. Alas the assumption of "only all finite paths" leads to an absurdity. > WM is not consistently thinking > about such a thing (his PDF includes only two example paths and both are > infinite), but it is a thing that *looks* like a binary tree. https://www.hs-augsburg.de/~mueckenh/Transfinity/Transfinity/pdf contains all diversities of Binary Trees on pp. 289-303. Regards, WM
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2017-11-19 02:14 +0000 |
| Message-ID | <87o9nzvwu1.fsf@bsb.me.uk> |
| In reply to | #167019 |
WM <wolfgang.mueckenheim@hs-augsburg.de> writes: <snip> > There is a bijection: Every finite path can be mapped on its last > node. Ah, good, you repeat the error. You simply stopped posting in the last thread when I said I wanted you to repeat the mistake as often as possible. The binary tree includes infinite paths so the bijection you so proudly presented was clearly a mistake. If you try to pretend your bijection was not an error, you will have to come up with your own definitions of all the terms involved because what everybody else calls the binary tree includes paths not in the image of your erroneous bijection. The point about this particular mistake of Professor Mueckenheim's about the infinite binary tree is not that he made it, but that he won't admit it despite knowing that the binary tree includes paths that are not finite and are thus not mapped by his erroneous bijection. <snip> -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | WM <wolfgang.mueckenheim@hs-augsburg.de> |
|---|---|
| Date | 2017-11-19 02:03 -0800 |
| Message-ID | <74fc11ba-667a-49f2-aa90-f188b22610d6@googlegroups.com> |
| In reply to | #167046 |
Am Sonntag, 19. November 2017 03:14:33 UTC+1 schrieb Ben Bacarisse: > WM <wolfgang.mueckenheim@hs-augsburg.de> writes: > <snip> > > There is a bijection: Every finite path can be mapped on its last > > node. > > Ah, good, you repeat the error. You simply stopped posting in the last > thread when I said I wanted you to repeat the mistake as often as > possible. > > The binary tree includes infinite paths so the bijection you so proudly > presented was clearly a mistake. The really existing Binary Tree is potentially infinite. That is often confused with actual infinity. Alas there is nothing more than all nodes. > If you try to pretend your bijection > was not an error, It is not an error for possibly existing Binary Trees. > you will have to come up with your own definitions of > all the terms involved because what everybody else calls the binary tree > includes paths not in the image of your erroneous bijection. Such paths cannot be defined by nodes. It is stupid to accept them. Nevertheless I showed you how they can be counted too. Use al possible definitions, count them. And I proved by another argument that all paths are countable, because their number at every level is limited by the nodes of that level. So we get an upper estimation if we assume all nodes posited at one level. Regards, WM
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2017-11-20 01:18 +0000 |
| Message-ID | <87tvxpvjb0.fsf@bsb.me.uk> |
| In reply to | #167055 |
WM <wolfgang.mueckenheim@hs-augsburg.de> writes: > Am Sonntag, 19. November 2017 03:14:33 UTC+1 schrieb Ben Bacarisse: >> WM <wolfgang.mueckenheim@hs-augsburg.de> writes: >> <snip> >> > There is a bijection: Every finite path can be mapped on its last >> > node. >> >> Ah, good, you repeat the error. You simply stopped posting in the last >> thread when I said I wanted you to repeat the mistake as often as >> possible. >> >> The binary tree includes infinite paths so the bijection you so proudly >> presented was clearly a mistake. > > The really existing Binary Tree is potentially infinite. That is often > confused with actual infinity. Alas there is nothing more than all > nodes. Sprinkling the magic "potential" dust over everything does not let you evade your mistake. The really existing potentially infinite Binary Tree has potentially infinite paths, none of which are in the potentially infinite image of the potentially infinite bijection you erroneously gave. But this is all good. Keep repeating the mistake. Every repetition will make it just that bit easier for students taking your history course "Geschichte des Unendlichen" to find it. Unlike your other errors, this one is so obvious they will wonder why you did not simply admit it and move on. <snip> -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | George Greene <greeneg@email.unc.edu> |
|---|---|
| Date | 2017-11-19 01:22 -0800 |
| Message-ID | <9009aa18-0ba3-4f6d-9fb6-9bcbf2263569@googlegroups.com> |
| In reply to | #167019 |
On Saturday, November 18, 2017 at 7:37:52 AM UTC-5, WM wrote: > There is a bijection: Every finite path can be mapped > on its last node. Alas the assumption of > "only all finite paths" leads to an absurdity. It's only "alas" if you ever suspected that it could have been otherwise. These are THE PATHS THROUGH the infinite binary tree. You can speak of "the class of all paths through" ANY graph. One question then becomes how best to represent that class. Arguably THE BEST representation of it is the same (visual) presentation of/as THE GRAPH *ITSELF*. "All paths through" the graph (all paths that are subgraphs of the graph) ARE ALREADY PRESENT THERE IN the graph.
[toc] | [prev] | [next] | [standalone]
| From | WM <wolfgang.mueckenheim@hs-augsburg.de> |
|---|---|
| Date | 2017-11-18 04:38 -0800 |
| Message-ID | <fab1e3de-f2c6-42be-8503-86d6285cc4b8@googlegroups.com> |
| In reply to | #166997 |
Am Freitag, 17. November 2017 21:31:12 UTC+1 schrieb George Greene: > On Friday, November 3, 2017 at 7:41:47 AM UTC-4, Ben Bacarisse wrote: > > But the binary tree with only finite paths is not the > > tree whose paths anyone is asking you to find an enumeration of. > > Careful, Ben, careful. > > This object DOES NOT EXIST, so you can't concede > that WM ever even referred to it, or ever even succeeded in any attempt to refer to it. > "The binary tree with only finite paths", I repeat, DOES NOT EXIST. The Binary Tree with only all finite paths does not exist. But it would exist if the set |N with all finite naturals would exist. That's my point. Regards, WM
[toc] | [prev] | [next] | [standalone]
| From | Zeit Geist <Tucsondrew@me.com> |
|---|---|
| Date | 2017-11-18 15:09 -0800 |
| Message-ID | <bddee9f7-1613-411f-b024-e2a630fa9771@googlegroups.com> |
| In reply to | #167020 |
On Saturday, November 18, 2017 at 5:38:04 AM UTC-7, WM wrote: > Am Freitag, 17. November 2017 21:31:12 UTC+1 schrieb George Greene: > > On Friday, November 3, 2017 at 7:41:47 AM UTC-4, Ben Bacarisse wrote: > > > But the binary tree with only finite paths is not the > > > tree whose paths anyone is asking you to find an enumeration of. > > > > Careful, Ben, careful. > > > > This object DOES NOT EXIST, so you can't concede > > that WM ever even referred to it, or ever even succeeded in any attempt to refer to it. > > "The binary tree with only finite paths", I repeat, DOES NOT EXIST. > > The Binary Tree with only all finite paths does not exist. But it would exist if the set |N with all finite naturals would exist. > > That's my point. Do you have a proof? Or spewing more BS? > Regards, WM ZG
[toc] | [prev] | [next] | [standalone]
| From | George Greene <greeneg@email.unc.edu> |
|---|---|
| Date | 2017-11-19 01:24 -0800 |
| Message-ID | <a770283a-296d-4510-a403-1fbc6aa2acc7@googlegroups.com> |
| In reply to | #167020 |
On Saturday, November 18, 2017 at 7:38:04 AM UTC-5, WM wrote: > The Binary Tree with only all finite paths > does not exist. But it would exist if the set |N with > all finite naturals would exist. > > That's my point. That's NOT a point. THAT'S an absurdity. N DOES exist and "the binary tree with only all finite paths CAN'T exist since there are AN INFINITE NUMBER OF THESE which NECESSARILY ENTAILS that there must BE INFINITE PATHS AS WELL. That is, of course, if we're talking about paths THROUGH A BINARY TREE in the usual sense of tree. I don't see why you think you can prove an absurdity from "N exists". It's not like you know what a proof is anyway. And it's not like "exists" IS EVEN A FIRST-ORDER PREDICATE!
[toc] | [prev] | [next] | [standalone]
| From | WM <wolfgang.mueckenheim@hs-augsburg.de> |
|---|---|
| Date | 2017-11-19 01:56 -0800 |
| Message-ID | <3c5e5e24-36f6-4351-afb7-1a1fe9be9920@googlegroups.com> |
| In reply to | #167052 |
Am Sonntag, 19. November 2017 10:24:57 UTC+1 schrieb George Greene: > On Saturday, November 18, 2017 at 7:38:04 AM UTC-5, WM wrote: > > The Binary Tree with only all finite paths > > does not exist. But it would exist if the set |N with > > all finite naturals would exist. > > > > That's my point. > > That's NOT a point. That's my point. > THAT'S an absurdity. Of course. That's my point! > N DOES exist and "the binary tree with only all finite paths CAN'T exist since there are AN INFINITE NUMBER OF THESE which NECESSARILY ENTAILS that there must BE INFINITE PATHS AS WELL. What is the difference to |N? Every paths has aleph_0 nodes at finite distance from the root. > That is, of course, if we're talking about paths THROUGH A BINARY TREE in the usual sense of tree. Every path is a model of |N. > > I don't see why you think you can prove an absurdity from "N exists". That's my point. "|N exists" is already an absurdity. Finished infinity! Only matheologians immune to absurdities can read these words without shuddering about the state of present proponents of "mathematics". > It's not like you know what a proof is anyway. And it's not like "exists" IS EVEN A FIRST-ORDER PREDICATE! That's my point. Present proponents of logics are way below the level of astrologers. Or should we say astrologians? Regards, WM
[toc] | [prev] | [next] | [standalone]
| From | Julio Di Egidio <julio@diegidio.name> |
|---|---|
| Date | 2017-11-19 03:18 -0800 |
| Message-ID | <17b9553c-a9e6-4c48-992b-159a79bbad31@googlegroups.com> |
| In reply to | #167054 |
On Sunday, November 19, 2017 at 10:56:31 AM UTC+1, WM wrote: > Am Sonntag, 19. November 2017 10:24:57 UTC+1 schrieb George Greene: <snip> > > I don't see why you think you can prove an absurdity from "N exists". > > That's my point. "|N exists" is already an absurdity. Finished infinity! And your point remains exactly upside down: the problem with |N, if any, is that it is an *un*finished infinity! -- You are still just the other side of the same broken coin. Julio
[toc] | [prev] | [next] | [standalone]
Page 8 of 14 — ← Prev page 1 … 6 7 [8] 9 10 … 14 Next page →
Back to top | Article view | sci.logic
csiph-web