Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > sci.logic > #170294 > unrolled thread
| Started by | Peter Percival <peterxpercival@hotmail.com> |
|---|---|
| First post | 2018-01-16 20:16 +0000 |
| Last post | 2018-01-19 18:02 +0000 |
| Articles | 20 on this page of 172 — 10 participants |
Back to article view | Back to sci.logic
This discussion starts older than the indexed window; earlier articles aren't shown. The article labeled Started by
below is the oldest one visible, not the original post.
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-16 20:16 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-16 12:26 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-16 20:29 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-16 12:34 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-16 20:44 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-16 13:22 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-16 13:28 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-16 16:41 -0600
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-16 16:28 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-16 16:30 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-16 16:34 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-16 17:18 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-16 16:37 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-16 16:52 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-16 17:00 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) j4n bur53 <janburse@fastmail.fm> - 2018-01-17 02:02 +0100
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-16 17:24 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-16 17:22 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-16 17:40 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-16 17:47 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-16 17:59 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-16 18:18 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-16 19:01 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-16 19:03 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-17 08:44 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-17 10:47 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-01-16 20:38 -0500
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Zeit Geist <Tucsondrew@me.com> - 2018-01-16 19:01 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-16 17:11 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-01-16 19:33 -0500
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-16 17:14 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-17 08:38 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-19 18:04 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-19 20:55 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-19 14:48 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-19 23:01 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-19 15:21 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-01-19 19:45 -0500
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-19 17:13 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-01-19 23:33 -0500
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-19 21:13 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-19 22:06 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-20 13:38 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-20 06:13 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-20 14:38 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-20 06:20 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-20 06:32 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-20 14:42 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-20 06:51 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-21 11:43 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-20 08:57 -0600
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-20 07:10 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-20 07:11 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-01-20 12:35 -0500
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-22 10:14 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-22 19:17 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-22 14:36 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-01-22 20:13 -0500
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-22 18:29 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-23 15:51 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-23 09:16 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-23 15:45 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-23 09:12 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-23 18:21 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-23 14:23 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-23 23:01 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-23 18:09 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-24 17:12 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-24 09:36 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-24 19:21 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-24 16:08 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-24 16:34 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) grahamcooper7@gmail.com - 2018-01-24 16:41 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-24 16:43 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) grahamcooper7@gmail.com - 2018-01-24 16:59 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-25 08:49 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) grahamcooper7@gmail.com - 2018-01-24 17:07 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) grahamcooper7@gmail.com - 2018-01-24 17:13 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) grahamcooper7@gmail.com - 2018-01-24 17:26 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-25 08:42 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-24 18:56 -0600
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-24 17:06 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) grahamcooper7@gmail.com - 2018-01-24 17:17 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-25 08:56 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-25 08:48 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-25 08:55 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-25 09:01 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-26 09:49 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-26 18:32 -0600
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-27 05:14 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-29 23:10 -0600
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-29 22:33 -0600
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-30 15:53 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-30 17:40 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 01:45 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-30 20:44 -0600
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-30 21:02 -0600
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-31 19:06 -0600
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-02-01 18:28 -0600
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) grahamcooper7@gmail.com - 2018-02-01 16:47 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-02-02 21:51 -0600
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-27 13:11 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) grahamcooper7@gmail.com - 2018-01-27 14:18 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-29 23:06 -0600
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-30 16:09 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-25 18:10 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-25 10:21 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-25 10:23 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-26 15:36 -0600
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-26 15:25 -0600
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-26 18:34 -0600
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-29 22:38 -0600
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-30 20:47 -0600
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-30 21:03 -0600
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-31 19:07 -0600
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-27 13:29 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-29 23:27 -0600
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-30 16:28 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-25 18:36 -0600
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-01-24 20:35 -0500
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-25 02:15 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-25 09:19 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) grahamcooper7@gmail.com - 2018-01-24 17:48 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) grahamcooper7@gmail.com - 2018-01-24 17:54 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-25 09:24 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-25 18:18 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-26 15:35 -0600
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-27 13:38 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-29 23:30 -0600
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-01-30 10:49 -0500
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-30 17:34 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 01:44 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-30 23:09 -0600
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 11:46 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-31 14:38 -0600
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 21:06 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-02-01 09:28 -0600
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-02-01 07:34 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-02-01 14:12 -0600
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-02-01 13:14 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-02-01 17:39 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-31 19:09 -0600
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-30 16:37 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-30 18:14 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-25 16:16 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-22 14:39 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-22 19:31 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-01-22 14:36 -0500
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-22 19:46 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-22 14:48 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-23 16:03 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-23 20:47 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-23 21:44 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-23 14:38 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-23 23:15 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-23 18:36 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-24 18:06 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-24 12:33 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-24 20:59 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-25 07:33 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-20 13:22 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-20 06:03 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-20 14:48 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-20 09:55 -0600
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-20 16:26 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-19 23:21 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-19 18:05 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-19 12:02 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-19 20:28 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-19 14:16 -0800
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-19 22:42 +0000
Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-19 18:02 +0000
Page 7 of 9 — ← Prev page 1 2 3 4 5 6 [7] 8 9 Next page →
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2018-01-25 02:15 +0000 |
| Message-ID | <87bmhipttd.fsf@bsb.me.uk> |
| In reply to | #170949 |
Jim Burns <james.g.burns@att.net> writes: <snip> > A different translation of P -> Q not so prone to being > misunderstood might be > "Q is at least as true as P" which, ironically, can be written in many programming languages as P <= Q The irony being purely symbolic, of course. (What a shame we have not been using => in this thread.) <snip> -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | peteolcott <peterolcott2@gmail.com> |
|---|---|
| Date | 2018-01-25 09:19 -0800 |
| Message-ID | <7333dec0-36db-4294-82bb-ae067b9ee45c@googlegroups.com> |
| In reply to | #170949 |
On Wednesday, January 24, 2018 at 7:35:21 PM UTC-6, Jim Burns wrote: > On 1/24/2018 7:08 PM, peteolcott wrote: > > On Wednesday, January 24, 2018 at 1:21:34 PM UTC-6, > > Peter Percival wrote: > > >> Your > >> It did not occur to me that ((P & ~P) -> P) was false > >> until Jim pointed it out. > >> wrong twice over: ((P & ~P) -> P) isn't false and Jim never > >> pointed out that it was. > > I'm curious: do you still claim that I told you > ((P & ~P)-> P) is false? > I carefully studied that expression for at least an hour when I was responding to Percival. ((P & ~P)-> P) is true ((P & ~P)-> ~P) is true > I wouldn't think that _what I've said_ should be very > controversial at all whether it was true or it was false. > Isn't that _you might have said something false_ an insufficient > reason for you to check whatever post you think I said that in > and clarify the record? > > > There is some rule of logic that says P -> P therefore > > (P & ~P) -> (P & ~P) // Contradiction > > (P & ~P) is a contradiction. > (P & ~P) -> (P & ~P) is not a contradiction, it's a tautology. > So then if we assume that in a tautology the consequent necessarily logically follows from the antecedent then in the above case where the consequent is a contradiction we have a tautology that concludes a contradiction. There may be a more conventional way of saying it than this but it seems like when-so=ever a contradiction is concluded then reasoning is incorrect. So the above convention [in a tautology the consequent necessarily logically follows from the antecedent] creates logical inconsistency. > I think that the problem here is that you see '->' and think > "If ... then ... " It only means one very specific sense of > "If ... then ... ", and it's not the one you're using, I'd bet. > This is a common malady. > <https://en.wikipedia.org/wiki/Paradoxes_of_material_implication> > https://en.wikipedia.org/wiki/Paradoxes_of_material_implication (~p ∧ p) → p and its negation imply q. This is the paradox of entailment. Ah great, so inconsistency is defined as an inherent aspect of implication. In this case we simply augment the notion of WFF to reject contradictions as antecedents. Instead of being able to conclude anything from a contradiction we now have it that nothing can be concluded from a contradiction. It is exactly this kind of screwy stuff that allows the 1931 GIT to incorrectly conclude that True(X) is not always Provable(X) and False(X) is not always Refutable(X).
[toc] | [prev] | [next] | [standalone]
| From | grahamcooper7@gmail.com |
|---|---|
| Date | 2018-01-24 17:48 -0800 |
| Message-ID | <2b941308-28f6-405a-96e6-4c10b2e0d46e@googlegroups.com> |
| In reply to | #170934 |
On Thursday, peteolcott wrote: > > This would seem to indicate that (P & ~P) is incorrect because we > concluded a contradiction on the basis of this contradiction, thus > (P & ~P) -> P is not a WFF. P is a formula ~P is a formula (P & ~P) is a formula X -> P is a formula ___________________________ (P & ~P) -> P is a formula use GSF .... Good Semantic Formula
[toc] | [prev] | [next] | [standalone]
| From | grahamcooper7@gmail.com |
|---|---|
| Date | 2018-01-24 17:54 -0800 |
| Message-ID | <0bdbe3f6-c42f-423e-8b86-5a446794c7a9@googlegroups.com> |
| In reply to | #170950 |
> On Thursday, peteolcott wrote: > > (P & ~P) -> P is not a WFF. Actually its very important PROOF meta-formula! ASSUME ~P AXIOMS & ~P ---> P CONTRADICTION _______________ THERFOR P
[toc] | [prev] | [next] | [standalone]
| From | peteolcott <peterolcott2@gmail.com> |
|---|---|
| Date | 2018-01-25 09:24 -0800 |
| Message-ID | <bc189894-505a-4b7b-a73e-12e44f5dbff7@googlegroups.com> |
| In reply to | #170950 |
On Wednesday, January 24, 2018 at 7:48:36 PM UTC-6, graham...@gmail.com wrote: > On Thursday, peteolcott wrote: > > > > This would seem to indicate that (P & ~P) is incorrect because we > > concluded a contradiction on the basis of this contradiction, thus > > (P & ~P) -> P is not a WFF. > > > P is a formula > ~P is a formula > (P & ~P) is a formula > X -> P is a formula > ___________________________ > > (P & ~P) -> P is a formula > > > > > use GSF .... Good Semantic Formula https://en.wikipedia.org/wiki/Paradoxes_of_material_implication (~p ∧ p) → p and its negation imply q. This is the paradox of entailment. (~p ∧ p) → p is a semantically incorrect formula that can be rejected by augmenting the notion of WFF such that contradictions are not allowed in antecedents.
[toc] | [prev] | [next] | [standalone]
| From | Peter Percival <peterxpercival@hotmail.com> |
|---|---|
| Date | 2018-01-25 18:18 +0000 |
| Message-ID | <p4d717$r2h$1@news.albasani.net> |
| In reply to | #171020 |
peteolcott wrote: > https://en.wikipedia.org/wiki/Paradoxes_of_material_implication > (~p ∧ p) → p and its negation imply q. This is the paradox of entailment. You've misquoted.
[toc] | [prev] | [next] | [standalone]
| From | Pete Olcott <Pete@NoEmail.address> |
|---|---|
| Date | 2018-01-26 15:35 -0600 |
| Message-ID | <C4KdnYEW25mNAvbHnZ2dnUU7-K_NnZ2d@giganews.com> |
| In reply to | #171027 |
On 1/25/2018 12:18 PM, Peter Percival wrote: > peteolcott wrote: > > >> https://en.wikipedia.org/wiki/Paradoxes_of_material_implication >> (~p ∧ p) → p and its negation imply q. This is the paradox of entailment. > > You've misquoted. (~p ∧ p) → q and its negation imply q. This is the paradox of entailment. Yes I did. p = dogs are dogs q = cats are goldfish Given that dogs are not dogs we can conclude that cats are goldfish. I would not call that the paradox of entailment, I would call that the screw-up of formal logic that gets entailment incorrectly. -- *∀X True(X) ↔ ∃Γ ⊆ Axioms Provable(Γ, X) *
[toc] | [prev] | [next] | [standalone]
| From | Peter Percival <peterxpercival@hotmail.com> |
|---|---|
| Date | 2018-01-27 13:38 +0000 |
| Message-ID | <p4hvco$q64$1@news.albasani.net> |
| In reply to | #171108 |
Pete Olcott wrote: > On 1/25/2018 12:18 PM, Peter Percival wrote: >> peteolcott wrote: >> >> >>> https://en.wikipedia.org/wiki/Paradoxes_of_material_implication >>> (~p ∧ p) → p and its negation imply q. This is the paradox of >>> entailment. >> >> You've misquoted. > > (~p ∧ p) → q and its negation imply q. This is the paradox of entailment. > > Yes I did. You've misquoted again. What https://en.wikipedia.org/wiki/Paradoxes_of_material_implication says is this - ( ¬ p ∧ p ) → q, p and its negation imply q. This is the paradox of entailment. For the benefit of newsreaders that might struggle with non-ASCII - (~p /\ p) -> q, p and its negation imply q. This is the paradox of entailment. And, for the hard of comprehending, what is meant is - (~p /\ p) -> q, i.e, p and its negation, ~p, imply q. This is the paradox of entailment. > p = dogs are dogs > q = cats are goldfish > Given that dogs are not dogs we can conclude that cats are goldfish. > > I would not call that the paradox of entailment, I would call > that the screw-up of formal logic that gets entailment incorrectly. >
[toc] | [prev] | [next] | [standalone]
| From | Pete Olcott <Pete@NoEmail.address> |
|---|---|
| Date | 2018-01-29 23:30 -0600 |
| Message-ID | <x6mdnQvyzq1Fn-3HnZ2dnUU7-aednZ2d@giganews.com> |
| In reply to | #171167 |
On 1/27/2018 7:38 AM, Peter Percival wrote: > Pete Olcott wrote: >> On 1/25/2018 12:18 PM, Peter Percival wrote: >>> peteolcott wrote: >>> >>> >>>> https://en.wikipedia.org/wiki/Paradoxes_of_material_implication >>>> (~p ∧ p) → p and its negation imply q. This is the paradox of entailment. >>> >>> You've misquoted. >> >> (~p ∧ p) → q and its negation imply q. This is the paradox of entailment. >> >> Yes I did. > > You've misquoted again. What https://en.wikipedia.org/wiki/Paradoxes_of_material_implication says is this - > > ( ¬ p ∧ p ) → q, p and its negation imply q. > This is the paradox of entailment. > > For the benefit of newsreaders that might struggle with non-ASCII - > > (~p /\ p) -> q, p and its negation imply q. > This is the paradox of entailment. > > And, for the hard of comprehending, what is meant is - > > (~p /\ p) -> q, i.e, p and its negation, ~p, imply q. > This is the paradox of entailment. > It proves that conventional logic is logically incoherent. You should have looked at my concrete example below: >> p = dogs are dogs >> q = cats are goldfish >> Given that dogs are not dogs we can conclude that cats are goldfish. >> >> I would not call that the paradox of entailment, I would call >> that the screw-up of formal logic that gets entailment incorrectly. >> > -- *∀X True(X) ↔ ∃Γ ⊆ Axioms Provable(Γ, X) *
[toc] | [prev] | [next] | [standalone]
| From | Jim Burns <james.g.burns@att.net> |
|---|---|
| Date | 2018-01-30 10:49 -0500 |
| Message-ID | <782c687f-d212-b1a6-e3af-3b50cea81785@att.net> |
| In reply to | #171323 |
On 1/30/2018 12:30 AM, Pete Olcott wrote:
> On 1/27/2018 7:38 AM, Peter Percival wrote:
>> And, for the hard of comprehending, what is meant is -
>> (~p /\ p) -> q, i.e, p and its negation, ~p, imply q.
>> This is the paradox of entailment.
>
> It proves that conventional logic is logically incoherent.
> You should have looked at my concrete example below:
>
>>> p = dogs are dogs
>>> q = cats are goldfish
>>> Given that dogs are not dogs we can conclude that
>>> cats are goldfish.
>>>
>>> I would not call that the paradox of entailment,
>>> I would call that the screw-up of formal logic that
>>> gets entailment incorrectly.
Why do you think that we _don't_ give that dogs are not
dogs? Because it spits up all sorts of nonsense.
This is an example of conventional logic behaving
_exactly as we want it to behave_ . If we're _wrong_
we _don't want_ it to go happily chugging along.
If we're wrong, we want it to _look wrong_ .
Why do we reject inconsistent formal systems? Because,
if we use them, we will end up calling cats goldfish.
How do we know when to reject them? They call cats goldfish
(or something else as bad).
Back before I gave up on you (PO), I tried very hard to
show you that MTT _is inconsistent_ . I couldn't get you
to care. This is why you should care: you are calling cats
goldfish.
If you have some formal system T expressive enough for
Godel's first incompleteness theorem to apply, and you
upgrade T to T' by _adding_ an axiom stating that GIT1
_does not_ apply, what you get is a formal system T' in
which _both_ GIT1 and ~GIT1 are "theorems".
(I use "scare quotes" because, technically, they are
both theorems, by the definition, but any sensible
correspondence to truth has broken down.)
You can't _remove_ theorems by _adding_ axioms. You didn't
get rid of GIT1, you just added ~GIT1.
MTT is inconsistent.
(Well, whatever you end up with when you end up with
something you will call MTT will be inconsistent.)
I expect you'll be able to prove whatever you want to
prove. You'll also be able to prove cats are goldfish.
[toc] | [prev] | [next] | [standalone]
| From | peteolcott <peterolcott2@gmail.com> |
|---|---|
| Date | 2018-01-30 17:34 -0800 |
| Message-ID | <7aadbf5e-c17c-44f0-a32c-0420b91a5eb7@googlegroups.com> |
| In reply to | #171354 |
On Tuesday, January 30, 2018 at 9:49:04 AM UTC-6, Jim Burns wrote: > On 1/30/2018 12:30 AM, Pete Olcott wrote: > > On 1/27/2018 7:38 AM, Peter Percival wrote: > > >> And, for the hard of comprehending, what is meant is - > >> (~p /\ p) -> q, i.e, p and its negation, ~p, imply q. > >> This is the paradox of entailment. > > > > It proves that conventional logic is logically incoherent. > > You should have looked at my concrete example below: > > > >>> p = dogs are dogs > >>> q = cats are goldfish > >>> Given that dogs are not dogs we can conclude that > >>> cats are goldfish. > >>> > >>> I would not call that the paradox of entailment, > >>> I would call that the screw-up of formal logic that > >>> gets entailment incorrectly. > > Why do you think that we _don't_ give that dogs are not > dogs? Because it spits up all sorts of nonsense. > > This is an example of conventional logic behaving > _exactly as we want it to behave_ . If we're _wrong_ > we _don't want_ it to go happily chugging along. > If we're wrong, we want it to _look wrong_ . > > Why do we reject inconsistent formal systems? Because, > if we use them, we will end up calling cats goldfish. > How do we know when to reject them? They call cats goldfish > (or something else as bad). > > Back before I gave up on you (PO), I tried very hard to > show you that MTT _is inconsistent_ . I couldn't get you > to care. This is why you should care: you are calling cats > goldfish. > > If you have some formal system T expressive enough for > Godel's first incompleteness theorem to apply, and you > upgrade T to T' by _adding_ an axiom stating that GIT1 > _does not_ apply, what you get is a formal system T' in > which _both_ GIT1 and ~GIT1 are "theorems". > (I use "scare quotes" because, technically, they are > both theorems, by the definition, but any sensible > correspondence to truth has broken down.) > You can't _remove_ theorems by _adding_ axioms. You didn't > get rid of GIT1, you just added ~GIT1. > > MTT is inconsistent. > (Well, whatever you end up with when you end up with > something you will call MTT will be inconsistent.) > I expect you'll be able to prove whatever you want to > prove. You'll also be able to prove cats are goldfish. MTT is consistent and it is also complete. Tarski might have well used the Liar Paradox to say there is no such thing as a Truth predicate. Garbage In Garbage Out.
[toc] | [prev] | [next] | [standalone]
| From | Peter Percival <peterxpercival@hotmail.com> |
|---|---|
| Date | 2018-01-31 01:44 +0000 |
| Message-ID | <p4r72d$2so$1@news.albasani.net> |
| In reply to | #171396 |
peteolcott wrote: > MTT is consistent and it is also complete. Prove both claims. Start by spelling out what it means to say of a logical calculus that it is consistent and complete.
[toc] | [prev] | [next] | [standalone]
| From | Pete Olcott <Pete@NoEmail.address> |
|---|---|
| Date | 2018-01-30 23:09 -0600 |
| Message-ID | <R7ednSlZv-AW0uzHnZ2dnUU7-KmdnZ2d@giganews.com> |
| In reply to | #171400 |
On 1/30/2018 7:44 PM, Peter Percival wrote: > peteolcott wrote: > >> MTT is consistent and it is also complete. > > Prove both claims. Start by spelling out what it means to say of a logical calculus that it is consistent and complete. > I don't know how to prove that it is consistent in less than an infinite amount of time. All that I do know is that all of the usual ways of proving that it is not consistent or complete fail. -- *∀X True(X) ↔ ∃Γ ⊆ Axioms Provable(Γ, X) *
[toc] | [prev] | [next] | [standalone]
| From | Peter Percival <peterxpercival@hotmail.com> |
|---|---|
| Date | 2018-01-31 11:46 +0000 |
| Message-ID | <p4saaq$oks$1@news.albasani.net> |
| In reply to | #171454 |
Pete Olcott wrote: > On 1/30/2018 7:44 PM, Peter Percival wrote: >> peteolcott wrote: >> >>> MTT is consistent and it is also complete. >> >> Prove both claims. Start by spelling out what it means to say of a >> logical calculus that it is consistent and complete. >> > > I don't know how to prove that it is consistent in less than an infinite > amount of time. > > All that I do know is that all of the usual ways of proving that it is > not consistent or complete fail. So what "MTT is consistent and it is also complete" means is "Pete Olcott has failed to prove that MTT is inconsistent and incomplete." Could you just tell us all of the usual ways of proving such things are?
[toc] | [prev] | [next] | [standalone]
| From | Pete Olcott <Pete@NoEmail.address> |
|---|---|
| Date | 2018-01-31 14:38 -0600 |
| Message-ID | <SJSdnT1HJsqmtO_HnZ2dnUU7-S2dnZ2d@giganews.com> |
| In reply to | #171483 |
On 1/31/2018 5:46 AM, Peter Percival wrote: > Pete Olcott wrote: >> On 1/30/2018 7:44 PM, Peter Percival wrote: >>> peteolcott wrote: >>> >>>> MTT is consistent and it is also complete. >>> >>> Prove both claims. Start by spelling out what it means to say of a logical calculus that it is consistent and complete. >>> >> >> I don't know how to prove that it is consistent in less than an infinite amount of time. >> >> All that I do know is that all of the usual ways of proving that it is not consistent or complete fail. > > So what "MTT is consistent and it is also complete" means is "Pete Olcott has failed to prove that MTT is inconsistent and incomplete." Could you just tell us all of the usual ways of proving such things are? > You have to respond to the words that I actually said. I have no idea how to prove that any formal system is complete and consistent in less than infinite time. -- *∀X True(X) ↔ ∃Γ ⊆ Axioms Provable(Γ, X) *
[toc] | [prev] | [next] | [standalone]
| From | Peter Percival <peterxpercival@hotmail.com> |
|---|---|
| Date | 2018-01-31 21:06 +0000 |
| Message-ID | <p4tb4e$5gj$1@news.albasani.net> |
| In reply to | #171514 |
Pete Olcott wrote: > On 1/31/2018 5:46 AM, Peter Percival wrote: >> Pete Olcott wrote: >>> On 1/30/2018 7:44 PM, Peter Percival wrote: >>>> peteolcott wrote: >>>> >>>>> MTT is consistent and it is also complete. >>>> >>>> Prove both claims. Start by spelling out what it means to say of a >>>> logical calculus that it is consistent and complete. >>>> >>> >>> I don't know how to prove that it is consistent in less than an >>> infinite amount of time. >>> >>> All that I do know is that all of the usual ways of proving that it >>> is not consistent or complete fail. >> >> So what "MTT is consistent and it is also complete" means is "Pete >> Olcott has failed to prove that MTT is inconsistent and incomplete." >> Could you just tell us all of the usual ways of proving such things are? >> > > You have to respond to the words that I actually said. I did. You said that MTT is consistent and it is also complete. I think I was entitled to ask for a proof. Later you said that you do know that all of the usual ways of proving that it is not consistent or complete fail. I think I was entitled to ask what you think all the usual ways are. > I have no idea how to prove that any formal system is complete and > consistent That's what I thought. So you know nothing about how to prove such things. Why on earth did you write "All that I do know is that all of the usual ways of proving that it is not consistent or complete fail"? Don't you think that is ridiculously arrogant? You will find example proofs in Mendelson. The following line has no relevance to the above. > in less than infinite time. > >
[toc] | [prev] | [next] | [standalone]
| From | Pete Olcott <Pete@NoEmail.address> |
|---|---|
| Date | 2018-02-01 09:28 -0600 |
| Message-ID | <HP-dndyakrqIr-7HnZ2dnUU7-QPNnZ2d@giganews.com> |
| In reply to | #171519 |
On 1/31/2018 3:06 PM, Peter Percival wrote: > Pete Olcott wrote: >> On 1/31/2018 5:46 AM, Peter Percival wrote: >>> Pete Olcott wrote: >>>> On 1/30/2018 7:44 PM, Peter Percival wrote: >>>>> peteolcott wrote: >>>>> >>>>>> MTT is consistent and it is also complete. >>>>> >>>>> Prove both claims. Start by spelling out what it means to say of a logical calculus that it is consistent and complete. >>>>> >>>> >>>> I don't know how to prove that it is consistent in less than an infinite amount of time. >>>> >>>> All that I do know is that all of the usual ways of proving that it is not consistent or complete fail. >>> >>> So what "MTT is consistent and it is also complete" means is "Pete Olcott has failed to prove that MTT is inconsistent and incomplete." Could you just tell us all of the usual ways of proving such things are? >>> >> >> You have to respond to the words that I actually said. > > I did. You said that MTT is consistent and it is also complete. I think I was entitled to ask for a proof. Later you said that you do know that all of the usual ways of proving that it is not consistent or complete fail. I think I was entitled to ask what you think all the usual ways are. > >> I have no idea how to prove that any formal system is complete and consistent > > That's what I thought. So you know nothing about how to prove such things. Why on earth did you write "All that I do know is that all of the usual ways of proving that it is not consistent or complete fail"? Don't you think that is ridiculously arrogant? You will find example proofs in Mendelson. > > The following line has no relevance to the above. > I do know how to prove that it is consistent and complete in infinite time, simply test every element of the set of all finite strings. The usual ways of "proving" that a system is either incomplete or inconsistent are to find an unprovable sentence in the language. >> in less than infinite time. >> >> > -- *∀X True(X) ↔ ∃Γ ⊆ Axioms Provable(Γ, X) *
[toc] | [prev] | [next] | [standalone]
| From | bursejan@gmail.com |
|---|---|
| Date | 2018-02-01 07:34 -0800 |
| Message-ID | <a45f4785-c38c-471e-8273-fb6ca226b8d5@googlegroups.com> |
| In reply to | #171592 |
As a start you could try to classify MTT, inside some cube. So its higher order? But how exactly? Lambda Calculi with Types - Henk Barendregt http://ttic.uchicago.edu/~dreyer/course/papers/barendregt.pdf Am Donnerstag, 1. Februar 2018 16:28:27 UTC+1 schrieb Pete Olcott: > On 1/31/2018 3:06 PM, Peter Percival wrote: > > Pete Olcott wrote: > >> On 1/31/2018 5:46 AM, Peter Percival wrote: > >>> Pete Olcott wrote: > >>>> On 1/30/2018 7:44 PM, Peter Percival wrote: > >>>>> peteolcott wrote: > >>>>> > >>>>>> MTT is consistent and it is also complete. > >>>>> > >>>>> Prove both claims. Start by spelling out what it means to say of a logical calculus that it is consistent and complete. > >>>>> > >>>> > >>>> I don't know how to prove that it is consistent in less than an infinite amount of time. > >>>> > >>>> All that I do know is that all of the usual ways of proving that it is not consistent or complete fail. > >>> > >>> So what "MTT is consistent and it is also complete" means is "Pete Olcott has failed to prove that MTT is inconsistent and incomplete." Could you just tell us all of the usual ways of proving such things are? > >>> > >> > >> You have to respond to the words that I actually said. > > > > I did. You said that MTT is consistent and it is also complete. I think I was entitled to ask for a proof. Later you said that you do know that all of the usual ways of proving that it is not consistent or complete fail. I think I was entitled to ask what you think all the usual ways are. > > > >> I have no idea how to prove that any formal system is complete and consistent > > > > That's what I thought. So you know nothing about how to prove such things. Why on earth did you write "All that I do know is that all of the usual ways of proving that it is not consistent or complete fail"? Don't you think that is ridiculously arrogant? You will find example proofs in Mendelson. > > > > The following line has no relevance to the above. > > > > I do know how to prove that it is consistent and complete in infinite time, > simply test every element of the set of all finite strings. > > The usual ways of "proving" that a system is either incomplete or inconsistent > are to find an unprovable sentence in the language. > > > >> in less than infinite time. > >> > >> > > > > > -- > *∀X True(X) ↔ ∃Γ ⊆ Axioms Provable(Γ, X) *
[toc] | [prev] | [next] | [standalone]
| From | Pete Olcott <Pete@NoEmail.address> |
|---|---|
| Date | 2018-02-01 14:12 -0600 |
| Message-ID | <i5GdndYrhqQ-6e7HnZ2dnUU7-TudnZ2d@giganews.com> |
| In reply to | #171594 |
On 2/1/2018 9:34 AM, bursejan@gmail.com wrote: > As a start you could try to classify MTT, inside > some cube. So its higher order? But how exactly? > > Lambda Calculi with Types - Henk Barendregt > http://ttic.uchicago.edu/~dreyer/course/papers/barendregt.pdf > Is apparently not Turing Complete. > Am Donnerstag, 1. Februar 2018 16:28:27 UTC+1 schrieb Pete Olcott: >> On 1/31/2018 3:06 PM, Peter Percival wrote: >>> Pete Olcott wrote: >>>> On 1/31/2018 5:46 AM, Peter Percival wrote: >>>>> Pete Olcott wrote: >>>>>> On 1/30/2018 7:44 PM, Peter Percival wrote: >>>>>>> peteolcott wrote: >>>>>>> >>>>>>>> MTT is consistent and it is also complete. >>>>>>> >>>>>>> Prove both claims. Start by spelling out what it means to say of a logical calculus that it is consistent and complete. >>>>>>> >>>>>> >>>>>> I don't know how to prove that it is consistent in less than an infinite amount of time. >>>>>> >>>>>> All that I do know is that all of the usual ways of proving that it is not consistent or complete fail. >>>>> >>>>> So what "MTT is consistent and it is also complete" means is "Pete Olcott has failed to prove that MTT is inconsistent and incomplete." Could you just tell us all of the usual ways of proving such things are? >>>>> >>>> >>>> You have to respond to the words that I actually said. >>> >>> I did. You said that MTT is consistent and it is also complete. I think I was entitled to ask for a proof. Later you said that you do know that all of the usual ways of proving that it is not consistent or complete fail. I think I was entitled to ask what you think all the usual ways are. >>> >>>> I have no idea how to prove that any formal system is complete and consistent >>> >>> That's what I thought. So you know nothing about how to prove such things. Why on earth did you write "All that I do know is that all of the usual ways of proving that it is not consistent or complete fail"? Don't you think that is ridiculously arrogant? You will find example proofs in Mendelson. >>> >>> The following line has no relevance to the above. >>> >> >> I do know how to prove that it is consistent and complete in infinite time, >> simply test every element of the set of all finite strings. >> >> The usual ways of "proving" that a system is either incomplete or inconsistent >> are to find an unprovable sentence in the language. >> >> >>>> in less than infinite time. >>>> >>>> >>> >> >> >> -- >> *∀X True(X) ↔ ∃Γ ⊆ Axioms Provable(Γ, X) * > -- *∀X True(X) ↔ ∃Γ ⊆ Axioms Provable(Γ, X) *
[toc] | [prev] | [next] | [standalone]
| From | bursejan@gmail.com |
|---|---|
| Date | 2018-02-01 13:14 -0800 |
| Message-ID | <83c3d675-c001-46fc-8c94-a2e68bc87229@googlegroups.com> |
| In reply to | #171623 |
obviously Complete Turing is it. http://n8waechter.info/wp-content/uploads/2017/10/joda.jpg Most of the lambda calculi are turing complete. You can relatively easily model numbers, this has become known as Curch numerals: https://en.wikipedia.org/wiki/Church_encoding#Church_numerals Am Donnerstag, 1. Februar 2018 21:12:26 UTC+1 schrieb Pete Olcott: > On 2/1/2018 9:34 AM, bursejan@gmail.com wrote: > > As a start you could try to classify MTT, inside > > some cube. So its higher order? But how exactly? > > > > Lambda Calculi with Types - Henk Barendregt > > http://ttic.uchicago.edu/~dreyer/course/papers/barendregt.pdf > > > > Is apparently not Turing Complete.
[toc] | [prev] | [next] | [standalone]
Page 7 of 9 — ← Prev page 1 2 3 4 5 6 [7] 8 9 Next page →
Back to top | Article view | sci.logic
csiph-web