Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > sci.logic > #170812 > unrolled thread

Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review)

Started byPeter Percival <peterxpercival@hotmail.com>
First post2018-01-23 15:17 +0000
Last post2018-01-24 17:31 +0000
Articles 20 on this page of 254 — 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.


Contents

  Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-23 15:17 +0000
    Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-23 08:54 -0800
      Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) j4n bur53 <janburse@fastmail.fm> - 2018-01-23 18:47 +0100
        Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) j4n bur53 <janburse@fastmail.fm> - 2018-01-23 18:52 +0100
        Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-23 18:27 +0000
          Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-23 14:30 -0800
            Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-23 23:03 +0000
              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-23 16:28 -0800
                Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-23 16:31 -0800
                  Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-23 17:53 -0800
            Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-23 15:04 -0800
      Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-23 18:13 +0000
        Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-23 14:20 -0800
          Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-23 22:56 +0000
            Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-23 18:01 -0800
              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-24 16:52 +0000
          Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-01-23 20:03 -0500
            Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-23 18:45 -0800
              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-01-23 21:53 -0500
                Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-23 21:00 -0600
                  Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-24 18:26 +0000
                Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-23 19:16 -0800
                  Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-24 19:12 +0000
                    Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-24 12:46 -0800
                      Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-24 21:15 +0000
                        Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-01-24 18:44 -0500
                          Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-25 08:27 -0800
                            Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-25 17:44 +0000
                              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-26 15:22 -0600
                                Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-27 13:25 +0000
                                  Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-29 23:24 -0600
                        Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-25 07:48 -0800
                          Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-25 17:32 +0000
                            Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-26 09:53 -0800
                              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-27 13:13 +0000
                                Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-29 23:09 -0600
                                  Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-30 16:18 +0000
                  Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-01-24 19:11 -0500
                    Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-25 08:37 -0800
              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-24 18:17 +0000
                Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-24 12:42 -0800
                  Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-24 21:04 +0000
                    Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-25 07:37 -0800
                      Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-25 16:53 +0000
                        Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-26 09:45 -0800
                          Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-26 09:58 -0800
                            Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) grahamcooper7@gmail.com - 2018-01-26 18:01 -0800
                            Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-29 20:07 -0800
                              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-30 14:11 +0000
                              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-01-30 11:32 -0500
                          Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-27 13:08 +0000
                            Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-29 23:01 -0600
                  Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-01-24 21:19 -0500
                    Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-25 09:42 -0800
                      Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-25 18:25 +0000
                        Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-26 15:46 -0600
                          Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-27 13:49 +0000
                            Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-29 23:31 -0600
                              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-30 16:42 +0000
                              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-01-30 12:26 -0500
                                Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-30 17:46 -0800
                                  Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 01:50 +0000
                                    Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-30 23:15 -0600
                                      Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 13:08 +0000
                                        Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-31 14:48 -0600
                                          Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 21:35 +0000
                                            Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-02-01 15:29 -0600
                                              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-02-01 21:38 +0000
                                          Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-01-31 18:51 -0500
                                            Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-02-01 16:53 -0600
                                              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-02-02 13:42 +0000
                                  Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-01-30 21:59 -0500
                                    Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-30 21:22 -0600
                                      Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-01-30 22:47 -0500
                                        Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-31 00:52 -0600
                                          Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 14:00 +0000
                                            Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-31 19:16 -0600
            Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-23 19:38 -0800
              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-24 18:44 +0000
      Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-23 18:46 +0000
        Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-23 14:35 -0800
          Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-23 23:08 +0000
            Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-23 18:14 -0800
              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-01-23 21:44 -0500
                Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-23 19:01 -0800
                  Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-24 19:07 +0000
                Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-24 08:48 -0800
                  Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-24 19:15 +0000
                    Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-24 12:52 -0800
                      Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-24 21:24 +0000
                        Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-25 07:58 -0800
                          Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-25 17:37 +0000
                            Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-26 15:12 -0600
                              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-26 14:00 -0800
                                Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-26 14:05 -0800
                                  Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-26 14:13 -0800
                                    Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) j4n bur53 <janburse@fastmail.fm> - 2018-01-26 23:15 +0100
                                      Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-26 14:28 -0800
                                        Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-29 22:28 -0600
                                      Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-29 22:18 -0600
                                        Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-30 14:17 +0000
                                Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-29 20:11 -0800
                              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) grahamcooper7@gmail.com - 2018-01-26 17:53 -0800
                                Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-29 22:39 -0600
                              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-27 13:20 +0000
                                Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-29 23:21 -0600
                                  Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-30 16:25 +0000
                  Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-01-25 09:30 -0500
                    Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-25 10:31 -0800
                      Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-25 14:08 -0800
                        Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-25 14:15 -0800
                          Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) grahamcooper7@gmail.com - 2018-01-25 20:28 -0800
                        Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) grahamcooper7@gmail.com - 2018-01-25 16:56 -0800
                        Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-26 15:49 -0600
                          Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-27 13:50 +0000
                            Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-29 23:33 -0600
                              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-30 16:49 +0000
                      Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-01-25 22:20 -0500
                        Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-25 22:41 -0600
                          Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-01-26 00:45 -0500
                            Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-26 16:28 -0600
                              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-26 14:30 -0800
                                Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-26 14:34 -0800
                                Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-29 22:31 -0600
                                  Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-30 15:43 +0000
                                    Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-30 17:30 -0800
                                      Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-01-30 20:54 -0500
                                        Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-30 18:55 -0800
                                          Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 03:04 +0000
                                            Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-30 23:25 -0600
                                              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 13:26 +0000
                                                Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-31 15:25 -0600
                                                  Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 21:44 +0000
                                                    Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-02-01 15:36 -0600
                                                      Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-02-01 21:41 +0000
                                                  Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-31 19:23 -0600
                                          Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-01-30 22:29 -0500
                                            Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-31 00:45 -0600
                                            Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-31 01:19 -0600
                                              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 14:14 +0000
                                                Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-31 16:09 -0600
                                                  Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 22:25 +0000
                                                    Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-02-01 16:27 -0600
                                                      Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-02-02 13:31 +0000
                                              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-01-31 12:43 -0500
                                                Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-31 22:15 -0600
                                                Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-31 22:36 -0600
                                                  Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-02-01 09:13 -0500
                                                    Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-02-01 13:50 -0600
                                                      Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-02-01 19:49 -0500
                                                        Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) grahamcooper7@gmail.com - 2018-02-01 17:06 -0800
                                                          Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-02-01 20:37 -0500
                                                            Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) grahamcooper7@gmail.com - 2018-02-01 18:22 -0800
                                                              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-02-01 21:56 -0500
                                                                Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) grahamcooper7@gmail.com - 2018-02-01 19:21 -0800
                                                                Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-02-02 00:35 -0800
                                                                  Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-02-02 11:25 -0500
                                                                    Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Alan Smaill <smaill@SPAMinf.ed.ac.uk> - 2018-02-02 16:55 +0000
                                                                    Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-02-02 18:52 +0000
                                                                    Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-02-02 11:03 -0800
                                                                      Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-02-02 11:38 -0800
                                                                      Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-02-02 19:41 +0000
                                                                        Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-02-02 11:48 -0800
                                                                          Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-02-02 12:18 -0800
                                                                            Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-02-02 16:24 -0800
                                                                              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-02-02 16:31 -0800
                                                        Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-02-01 22:57 -0600
                                                          Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-02-02 01:19 -0500
                                                            Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) grahamcooper7@gmail.com - 2018-02-01 22:39 -0800
                                                              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-02-02 13:16 -0500
                                        Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) grahamcooper7@gmail.com - 2018-01-31 00:03 -0800
                                          Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-31 10:56 -0600
                                      Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 15:15 +0000
                                        Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-31 16:11 -0600
                                          Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 22:29 +0000
                                            Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-02-01 16:42 -0600
                                              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-02-02 13:28 +0000
                              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-01-27 13:08 -0500
                                Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-29 22:57 -0600
                                  Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-01-30 12:03 -0500
                                    Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-30 17:50 -0800
                                      Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 01:53 +0000
                                        Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-30 18:41 -0800
                                          Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 02:56 +0000
                                            Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-30 21:04 -0600
                                              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 03:30 +0000
                                                Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-31 00:48 -0600
                                                  Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 13:52 +0000
                                                    Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-31 15:44 -0600
                                                      Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 21:59 +0000
                                                      Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-31 19:34 -0600
                                                        Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-02-01 19:00 -0600
                                                          Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-02-02 22:05 -0600
                                                            Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) grahamcooper7@gmail.com - 2018-02-02 21:57 -0800
                                                              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-02-03 14:43 -0600
                                        Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-30 23:16 -0600
                                          Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 12:12 +0000
                                            Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-31 14:43 -0600
                                              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 21:14 +0000
                                                Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-02-01 15:30 -0800
                                                  Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-02-01 15:35 -0800
                                                    Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-02-01 15:41 -0800
                                                      Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-02-01 16:01 -0800
                                                        Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-02-01 16:06 -0800
                                                        Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) grahamcooper7@gmail.com - 2018-02-01 16:24 -0800
                                                    Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) grahamcooper7@gmail.com - 2018-02-01 15:51 -0800
                                                  Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-02-01 15:44 -0800
                                              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-01-31 19:03 -0500
                                                Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-02-01 16:54 -0600
                                                  Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-02-02 13:18 +0000
                                          Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 13:20 +0000
                                            Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-31 15:17 -0600
                                      Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-01-30 21:11 -0500
                                        Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-30 21:00 -0600
                                          Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 03:08 +0000
                                            Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-30 23:33 -0600
                                              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 13:33 +0000
                                                Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-31 15:33 -0600
                                                  Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 21:53 +0000
                                                    Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-02-01 15:50 -0600
                                                      Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-02-01 21:54 +0000
                          Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-26 00:41 -0800
                            Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) j4n bur53 <janburse@fastmail.fm> - 2018-01-26 09:44 +0100
                              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-01-26 00:47 -0800
                          Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-26 13:57 +0000
                            Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-27 00:22 -0600
                              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-27 20:31 +0000
                                Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-29 22:42 -0600
                              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-30 21:55 +0000
                                Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) peteolcott <peterolcott2@gmail.com> - 2018-01-30 17:42 -0800
                                  Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 01:47 +0000
                                    Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-30 23:10 -0600
                                      Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 12:01 +0000
                                        Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-31 14:40 -0600
                                          Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-31 21:08 +0000
                                            Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-02-01 09:48 -0600
                                              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) bursejan@gmail.com - 2018-02-01 08:01 -0800
                                                Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-02-01 14:57 -0600
                                                  Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-02-01 21:08 +0000
                                              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-02-01 17:04 +0000
                                                Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) grahamcooper7@gmail.com - 2018-02-01 15:13 -0800
                          Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-27 14:04 +0000
                            Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-29 23:43 -0600
                              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-30 16:50 +0000
                          Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-27 14:10 +0000
                            Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-29 23:45 -0600
                              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-01-30 10:12 -0500
                              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-30 16:51 +0000
                      Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Jim Burns <james.g.burns@att.net> - 2018-01-26 00:06 -0500
                        Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-26 16:12 -0600
                          Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-27 12:54 +0000
                            Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Pete Olcott <Pete@NoEmail.address> - 2018-01-29 22:59 -0600
                              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-30 16:06 +0000
              Re: Adding a FOPL Provable() Predicate to Propositional Logic (for review) Peter Percival <peterxpercival@hotmail.com> - 2018-01-24 17:31 +0000

Page 9 of 13 — ← Prev page 1 … 7 8 [9] 10 11 … 13  Next page →


#171722

Frombursejan@gmail.com
Date2018-02-02 11:38 -0800
Message-ID<c4fa24b2-a391-4fb8-a09b-196738e4bc7d@googlegroups.com>
In reply to#171721
Ok, I already got one of the equality axioms going.
This is a logical law, I guess provable from
the rest of calculus Gödel is using:

   |- forall z(x(z) <-> x(z))

Now if we apply extensionality, we get:

   |- x = x

For the other stuff I would for example need the 
converse of extensionality, namely I would need 
the following, which I couldn't show yet:

    x = y -> forall z(x(z) <-> y(z)) ?

Any ideas to show the converse of extensionality?
The converse of extensionality would follow
from the more simpler:

    x = y /\ x(z) -> y(z) ?

Any idea how to prove the above in Gödel. Maybe
need to consult PM. A small fix would be if we 
would read Gödels axiom V, with bi-implication
and not only with implication as in [2]:

  forall z(x(z) <-> y(z)) <-> x = y ?

But the original says implication and not 
bi-implication. A PDF of the original is here:

Kurt Gödel. ¨UBER FORMAL UNENTSCHEIDBARE S¨ATZE 
DER. “PRINCIPIA MATHEMATICA”.
http://www.w-k-essler.de/pdfs/goedel.pdf

Am Freitag, 2. Februar 2018 20:03:29 UTC+1 schrieb burs...@gmail.com:
> Am Freitag, 2. Februar 2018 17:25:53 UTC+1 schrieb Jim Burns:
> > >      Eu Av (u(v) <-> a)           /* comprehension */
> > >      Az (x(z) <-> y(z)) -> x = y  /* extensionality */
> > 
> > Unrestricted comprehension...  Is the theory P which Godel
> > used inconsistent? I know, that would be no disaster for
> > the result, his proof has been repeated for many other
> > theories. But it would be weird, and maybe a bit upsetting.
> 
> Well, I guess there is no reason for an alarm. 
> Recall that in Gödels system all variables are
> typed, so they have type 1, type 2 or etc..
> So usually they are written as:
> 
>     x_1, y_2, z_1, etc..
>     /* check reference [2] */
> 
> Where 1, 2, 1, etc.. indicate the type. So the 
> comprehension axiom is a schema that has its 
> full expression as follows with indicating 
> the type level:
> 
>     Eu_n+1 Av_n (u_n+1(v_n) <-> a)
> 
> So the variables range over some small set. Which
> exists by means of set theory and hence the comprehension
> is not anymore naive, and exists as well viewed
> from set theory. What are small sets? Here is my guess:
> 
>     Small Sets = { P^n(N) | n in N }
> 
> Where P^n(N) denotes taking n times the power set.
> So we have for example:
> 
>    type 1 = i  /* individuals */ = P^0(N) = N
> 
>    type 2 = i -> o /* classes */ = P^1(N) = P(N)
> 
>    type 3 = (i -> o) -> o /* classes of classes */
>   
>           = P^2(N) = P(P(N))
> 
> > > But then axioms for equality are missing, there
> > > are no axioms such as:
> > >      x = x
> > >      x = y -> y = x
> > >      x = y /\ y = z   ->   x = z
> > >      x = y /\ z(x)   ->   z(y)
> > > Can they be derived somehow?
> > 
> > I suspect they can be derived.
> >     (For _this_ paper? Of course I suspect that.)
> > I don't see how to do that right now.
> 
> I am waiting. I am pretty courious how they would
> pop up. I even don't remember whether I tried to 
> do it sometime or have tried to look it up somewhere.

[toc] | [prev] | [next] | [standalone]


#171723

FromPeter Percival <peterxpercival@hotmail.com>
Date2018-02-02 19:41 +0000
Message-ID<p52eu7$4av$1@news.albasani.net>
In reply to#171721
bursejan@gmail.com wrote:
> Am Freitag, 2. Februar 2018 17:25:53 UTC+1 schrieb Jim Burns:
>>>       Eu Av (u(v) <-> a)           /* comprehension */
>>>       Az (x(z) <-> y(z)) -> x = y  /* extensionality */
>>
>> Unrestricted comprehension...  Is the theory P which Godel
>> used inconsistent? I know, that would be no disaster for
>> the result, his proof has been repeated for many other
>> theories. But it would be weird, and maybe a bit upsetting.
> 
> Well, I guess there is no reason for an alarm.
> Recall that in Gödels system all variables are
> typed, so they have type 1, type 2 or etc..
> So usually they are written as:
> 
>      x_1, y_2, z_1, etc..
>      /* check reference [2] */
> 
> Where 1, 2, 1, etc.. indicate the type. So the
> comprehension axiom is a schema that has its
> full expression as follows with indicating
> the type level:
> 
>      Eu_n+1 Av_n (u_n+1(v_n) <-> a)

u_{n+1} not free in a.

> 

[toc] | [prev] | [next] | [standalone]


#171724

Frombursejan@gmail.com
Date2018-02-02 11:48 -0800
Message-ID<404532a8-fe1c-4d84-8930-ba3c621b7bfc@googlegroups.com>
In reply to#171723
Yes agreed. We can check how good the transcript [2] is.
In the original we have this side condition:

    die u nicht frei enthalt
    http://www.w-k-essler.de/pdfs/goedel.pdf
    (See PDF page 7, or numbered page 178)

Its also in the transcript [2], as the side condition
"for a a formula that has no free occurrence of u."

Am Freitag, 2. Februar 2018 20:42:02 UTC+1 schrieb Peter Percival:
> bursejan@gmail.com wrote:
> > Am Freitag, 2. Februar 2018 17:25:53 UTC+1 schrieb Jim Burns:
> >>>       Eu Av (u(v) <-> a)           /* comprehension */
> >>>       Az (x(z) <-> y(z)) -> x = y  /* extensionality */
> >>
> >> Unrestricted comprehension...  Is the theory P which Godel
> >> used inconsistent? I know, that would be no disaster for
> >> the result, his proof has been repeated for many other
> >> theories. But it would be weird, and maybe a bit upsetting.
> > 
> > Well, I guess there is no reason for an alarm.
> > Recall that in Gödels system all variables are
> > typed, so they have type 1, type 2 or etc..
> > So usually they are written as:
> > 
> >      x_1, y_2, z_1, etc..
> >      /* check reference [2] */
> > 
> > Where 1, 2, 1, etc.. indicate the type. So the
> > comprehension axiom is a schema that has its
> > full expression as follows with indicating
> > the type level:
> > 
> >      Eu_n+1 Av_n (u_n+1(v_n) <-> a)
> 
> u_{n+1} not free in a.
> 
> >

[toc] | [prev] | [next] | [standalone]


#171725

Frombursejan@gmail.com
Date2018-02-02 12:18 -0800
Message-ID<60fc7293-edf8-4c52-b409-2add2ece1c9c@googlegroups.com>
In reply to#171724
Axiom IV already asked on MSE:
https://math.stackexchange.com/q/2181152/4414

Axiom V now asked on MSE:
https://math.stackexchange.com/q/2633262/4414

Am Freitag, 2. Februar 2018 20:48:37 UTC+1 schrieb burs...@gmail.com:
> Yes agreed. We can check how good the transcript [2] is.
> In the original we have this side condition:
> 
>     die u nicht frei enthalt
>     http://www.w-k-essler.de/pdfs/goedel.pdf
>     (See PDF page 7, or numbered page 178)
> 
> Its also in the transcript [2], as the side condition
> "for a a formula that has no free occurrence of u."
> 
> Am Freitag, 2. Februar 2018 20:42:02 UTC+1 schrieb Peter Percival:
> > bursejan@gmail.com wrote:
> > > Am Freitag, 2. Februar 2018 17:25:53 UTC+1 schrieb Jim Burns:
> > >>>       Eu Av (u(v) <-> a)           /* comprehension */
> > >>>       Az (x(z) <-> y(z)) -> x = y  /* extensionality */
> > >>
> > >> Unrestricted comprehension...  Is the theory P which Godel
> > >> used inconsistent? I know, that would be no disaster for
> > >> the result, his proof has been repeated for many other
> > >> theories. But it would be weird, and maybe a bit upsetting.
> > > 
> > > Well, I guess there is no reason for an alarm.
> > > Recall that in Gödels system all variables are
> > > typed, so they have type 1, type 2 or etc..
> > > So usually they are written as:
> > > 
> > >      x_1, y_2, z_1, etc..
> > >      /* check reference [2] */
> > > 
> > > Where 1, 2, 1, etc.. indicate the type. So the
> > > comprehension axiom is a schema that has its
> > > full expression as follows with indicating
> > > the type level:
> > > 
> > >      Eu_n+1 Av_n (u_n+1(v_n) <-> a)
> > 
> > u_{n+1} not free in a.
> > 
> > >

[toc] | [prev] | [next] | [standalone]


#171736

Frombursejan@gmail.com
Date2018-02-02 16:24 -0800
Message-ID<b74a9ab8-b1c1-4bb6-b9b6-df06cf9ad1d9@googlegroups.com>
In reply to#171725
Riddle solved. There is a frigging foot note
in Gödels paper, footnote 21 defines x = y as
forall w(w(x) -> w(y)).

We could then write u=λv.a as a memo for 
Gödels IV comprehension axiom ∃u∀v(u(v) <-> a). 
If we then use u=λv.v(z), we get u(x) <-> x(z) 
and u(y) <-> y(z). The rest follows from x=y 
implies u(x) -> u(y) with the foot 
note definition. 

Credits: Peter Smith
https://math.stackexchange.com/a/2633525/4414

The foot note is not replicated in the
transcription [2]n (at least I couldn't find
it). Its only found in the original.

Its on numbered page 177, Gödel refers
to PM I, * 13. I guess this is a definition
in principia mathematica volume I.

And schame, the principia says in the intro 
of 13, exactly that the "reduction" aka "comprehension" 
does the job to give a substition property.
https://archive.org/stream/PrincipiaMathematicaVolumeI/WhiteheadRussell-PrincipiaMathematicaVolumeI#page/n211/mode/2up

PM is a monster, in 13.191 they even use Peano 
notation, which they define in the intro already.

Am Freitag, 2. Februar 2018 21:18:35 UTC+1 schrieb burs...@gmail.com:
> Axiom IV already asked on MSE:
> https://math.stackexchange.com/q/2181152/4414
> 
> Axiom V now asked on MSE:
> https://math.stackexchange.com/q/2633262/4414
> 
> Am Freitag, 2. Februar 2018 20:48:37 UTC+1 schrieb burs...@gmail.com:
> > Yes agreed. We can check how good the transcript [2] is.
> > In the original we have this side condition:
> > 
> >     die u nicht frei enthalt
> >     http://www.w-k-essler.de/pdfs/goedel.pdf
> >     (See PDF page 7, or numbered page 178)
> > 
> > Its also in the transcript [2], as the side condition
> > "for a a formula that has no free occurrence of u."
> > 
> > Am Freitag, 2. Februar 2018 20:42:02 UTC+1 schrieb Peter Percival:
> > > bursejan@gmail.com wrote:
> > > > Am Freitag, 2. Februar 2018 17:25:53 UTC+1 schrieb Jim Burns:
> > > >>>       Eu Av (u(v) <-> a)           /* comprehension */
> > > >>>       Az (x(z) <-> y(z)) -> x = y  /* extensionality */
> > > >>
> > > >> Unrestricted comprehension...  Is the theory P which Godel
> > > >> used inconsistent? I know, that would be no disaster for
> > > >> the result, his proof has been repeated for many other
> > > >> theories. But it would be weird, and maybe a bit upsetting.
> > > > 
> > > > Well, I guess there is no reason for an alarm.
> > > > Recall that in Gödels system all variables are
> > > > typed, so they have type 1, type 2 or etc..
> > > > So usually they are written as:
> > > > 
> > > >      x_1, y_2, z_1, etc..
> > > >      /* check reference [2] */
> > > > 
> > > > Where 1, 2, 1, etc.. indicate the type. So the
> > > > comprehension axiom is a schema that has its
> > > > full expression as follows with indicating
> > > > the type level:
> > > > 
> > > >      Eu_n+1 Av_n (u_n+1(v_n) <-> a)
> > > 
> > > u_{n+1} not free in a.
> > > 
> > > >

[toc] | [prev] | [next] | [standalone]


#171738

Frombursejan@gmail.com
Date2018-02-02 16:31 -0800
Message-ID<e3aa4526-81fb-49b4-800b-a6fd5fc2b908@googlegroups.com>
In reply to#171736
Concerning the transcription [2], it says
expressis verbis:

   This translation omits all foot-notes from 
   the original, and only contains sections 1
   and 2 (out of four).

Not good for scholars that place their
nuggets in foot notes.

Am Samstag, 3. Februar 2018 01:24:06 UTC+1 schrieb burs...@gmail.com:
> Riddle solved. There is a frigging foot note
> in Gödels paper, footnote 21 defines x = y as
> forall w(w(x) -> w(y)).
> 
> We could then write u=λv.a as a memo for 
> Gödels IV comprehension axiom ∃u∀v(u(v) <-> a). 
> If we then use u=λv.v(z), we get u(x) <-> x(z) 
> and u(y) <-> y(z). The rest follows from x=y 
> implies u(x) -> u(y) with the foot 
> note definition. 
> 
> Credits: Peter Smith
> https://math.stackexchange.com/a/2633525/4414
> 
> The foot note is not replicated in the
> transcription [2]n (at least I couldn't find
> it). Its only found in the original.
> 
> Its on numbered page 177, Gödel refers
> to PM I, * 13. I guess this is a definition
> in principia mathematica volume I.
> 
> And schame, the principia says in the intro 
> of 13, exactly that the "reduction" aka "comprehension" 
> does the job to give a substition property.
> https://archive.org/stream/PrincipiaMathematicaVolumeI/WhiteheadRussell-PrincipiaMathematicaVolumeI#page/n211/mode/2up
> 
> PM is a monster, in 13.191 they even use Peano 
> notation, which they define in the intro already.
> 
> Am Freitag, 2. Februar 2018 21:18:35 UTC+1 schrieb burs...@gmail.com:
> > Axiom IV already asked on MSE:
> > https://math.stackexchange.com/q/2181152/4414
> > 
> > Axiom V now asked on MSE:
> > https://math.stackexchange.com/q/2633262/4414
> > 
> > Am Freitag, 2. Februar 2018 20:48:37 UTC+1 schrieb burs...@gmail.com:
> > > Yes agreed. We can check how good the transcript [2] is.
> > > In the original we have this side condition:
> > > 
> > >     die u nicht frei enthalt
> > >     http://www.w-k-essler.de/pdfs/goedel.pdf
> > >     (See PDF page 7, or numbered page 178)
> > > 
> > > Its also in the transcript [2], as the side condition
> > > "for a a formula that has no free occurrence of u."
> > > 
> > > Am Freitag, 2. Februar 2018 20:42:02 UTC+1 schrieb Peter Percival:
> > > > bursejan@gmail.com wrote:
> > > > > Am Freitag, 2. Februar 2018 17:25:53 UTC+1 schrieb Jim Burns:
> > > > >>>       Eu Av (u(v) <-> a)           /* comprehension */
> > > > >>>       Az (x(z) <-> y(z)) -> x = y  /* extensionality */
> > > > >>
> > > > >> Unrestricted comprehension...  Is the theory P which Godel
> > > > >> used inconsistent? I know, that would be no disaster for
> > > > >> the result, his proof has been repeated for many other
> > > > >> theories. But it would be weird, and maybe a bit upsetting.
> > > > > 
> > > > > Well, I guess there is no reason for an alarm.
> > > > > Recall that in Gödels system all variables are
> > > > >...

[toc] | [prev] | [next] | [standalone]


#171692

FromPete Olcott <Pete@NoEmail.address>
Date2018-02-01 22:57 -0600
Message-ID<EMedneCyw74hcu7HnZ2dnUU7-WmdnZ2d@giganews.com>
In reply to#171665
On 2/1/2018 6:49 PM, Jim Burns wrote:
> On 2/1/2018 2:50 PM, Pete Olcott wrote:
>> On 2/1/2018 8:13 AM, Jim Burns wrote:
>>> On 1/31/2018 11:36 PM, Pete Olcott wrote:
>>>> On 1/31/2018 11:43 AM, Jim Burns wrote:
> 
>>>>> Q(x) :<->  Ey:( ~LprovL(y)  &  LsubL(x,x) = y )
> 
>>>>> qx  :=  [Q(x)]
> 
>>>>> qqx  :=  [Q(qx)]
>>>>>
>>>>> This is a theorem of L:
>>>>> Q(qx)  <->  ~LprovL[Q(qx)]
>>>>> Call it theorem G.
> 
>>>> G is logically incoherent, not merely inconsistent.
>>>
>>> There is nothing incoherent about theorem G
>>>     Q(qx)  <->  ~LprovL[Q(qx)]
>>> You have all its definitions available. You could verify
>>> that it's not self-referential, if you wanted to.
>>
>> LP <-> ~True(LP)
>>   G <-> ~Provable(G)
>> (Using Saul Kripke's terms) are semantically ungrounded.
>> http://liarparadox.org/Prolog_Detects_Pathological_Self_Reference.pdf
> 
> You did it again. You replaced what *I* am talking about

You said:
>>> There is nothing incoherent about theorem G

I proved otherwise. You ignored everything that I said.
I had to prove what was wrong with G by using analogies
that you (apparently) can't understand.

[toc] | [prev] | [next] | [standalone]


#171697

FromJim Burns <james.g.burns@att.net>
Date2018-02-02 01:19 -0500
Message-ID<22c79a55-364e-5052-e7d8-ceefceedf740@att.net>
In reply to#171692
On 2/1/2018 11:57 PM, Pete Olcott wrote:
> On 2/1/2018 6:49 PM, Jim Burns wrote:
>> On 2/1/2018 2:50 PM, Pete Olcott wrote:
>>> On 2/1/2018 8:13 AM, Jim Burns wrote:
>>>> On 1/31/2018 11:36 PM, Pete Olcott wrote:
>>>>> On 1/31/2018 11:43 AM, Jim Burns wrote:

>>>>>> Q(x) :<->  Ey:( ~LprovL(y)  &  LsubL(x,x) = y )
>>
>>>>>> qx  :=  [Q(x)]
>>
>>>>>> qqx  :=  [Q(qx)]
>>>>>>
>>>>>> This is a theorem of L:
>>>>>> Q(qx)  <->  ~LprovL[Q(qx)]
>>>>>> Call it theorem G.
>>
>>>>> G is logically incoherent, not merely inconsistent.
>>>>
>>>> There is nothing incoherent about theorem G
>>>>     Q(qx)  <->  ~LprovL[Q(qx)]
>>>> You have all its definitions available. You could verify
>>>> that it's not self-referential, if you wanted to.
>>>
>>> LP <-> ~True(LP)
>>>   G <-> ~Provable(G)
>>> (Using Saul Kripke's terms) are semantically ungrounded.
>>> http://liarparadox.org/Prolog_Detects_Pathological_Self_Reference.pdf
>>
>> You did it again. You replaced what *I* am talking about
> 
> You said:
>>>> There is nothing incoherent about theorem G

And then I proved it.

> I proved otherwise.

You claimed otherwise. Don't you know the difference
between a claim and a proof?

Of course you don't. *LEARN SOMETHING*

> You ignored everything that I said.
> I had to prove what was wrong with G by using analogies
> that you (apparently) can't understand.

So, if I _make an analogy_ between your "proof" and
something bad, dividing by zero in the reals, rotten meat,
whatever, you will consider yourself refuted?

Consider the analogy made. Or doesn't it work if I
don't write it out?

You said that _that sentence_
    (forget about the convenience of labeling it G.
    You don't know what _our_ variables are yet,
    and you think G means variable.)
is pathologically self-referential. I went to the trouble
of compiling _all the references_ in the Forty-Six
Definitions. *Nowhere* do they loop. _There is no_
_self-reference_

You could return to my earlier post and see that.
However, I'll make it easy for you. Here it is again.
Just _look_ .

--------------------
The Forty-Six Definitions and Their Well-Grounded-Ness

     name[2] name[1] listed # << uses #

              provable Bew 46 << 45
                proofFor B 45 << 44 7 6
          isProofFigure Bw 44 << 43 42 7 6
              immConseq Fl 43 << 32 15 12
                isAxiom Ax 42 << 41 40 39 38 36 34
             setAxiom M-Ax 41 << 33
            reduAxiom R-Ax 40 << 32 26 23 15 11 10 9 8
       quantor2Axiom L2-Ax 39 << 32 26 23 15 14 12
       quantor1Axiom L1-Ax 38 << 37 32 31 23 19 15 11
  quantor1AxiomCondition Q 37 << 25 24 7 6
            propAxiom A-Ax 36 << 35
          prop1Axiom A1-Ax 35 << 32 23 14   (see note in paper)
           peanoAxiom Z-Ax 34 <<            (see note in paper)
               typeLift Th 33 << 7 6 3
                   imp Imp 32 << 15 14 13
                32 and Con 32 << 15 14 13
                 equiv Aeq 32 << 15 14 13
                 exists Ex 32 << 15 14 13
                  subst Sb 31 << 30 29
                subst' Sb0 30 << 28 27
             nFreePlaces A 29 << 28 7
              freePlace St 28 << 25 7
                 insert Su 27 << 9 8 7 6 5
                free(2) Fr 26 << 25 7
                free(3) Fr 25 << 24 23 12 7 6
                 bound Geb 24 << 23 15 12 8 7
                 isFm Form 23 << 22 7 6 5
                  fmSeq FR 22 << 21 20 7 6
                     op Op 21 << 15 13 14 12
                  elFm Elf 20 << 19 10 8
               stype Typ_n 19 << 18 11 9
              stype1 Typ1' 18 << 16 11 9
                  number Z 17 << 16 9
                  succ_n N 16 << 9
                forall Gen 15 << 10 9 8
                    or Dis 14 << 10 9 8
                   not Neg 13 << 10 9 8
                 isVar Var 12 << 11
                 vtype Var 11 << 2
                   paren E 10 << 9 8
                      seq R 9 <<
                        o * 8 << 7 6 5
                   length l 7 << 3
                    item Gl 6 << 3 1
                nthPrime Pr 5 << 4 2
                        ! ! 4 <<
                prFactor Pr 3 << 2 1
               isPrime Prim 2 << 1
                          | / <<

[1]
http://jacqkrol.x10.mx/assets/articles/godel-1931.pdf
[2]
https://www.research.ibm.com/people/h/hirzel/papers/canon00-goedel.pdf

[toc] | [prev] | [next] | [standalone]


#171699

Fromgrahamcooper7@gmail.com
Date2018-02-01 22:39 -0800
Message-ID<04f820a8-f5d9-46e4-b97a-b466eaae4f3e@googlegroups.com>
In reply to#171697
On Friday, February 2, 2018 at 4:19:10 PM UTC+10, Jim Burns wrote:
>
> is self-referential. I went to the trouble
> of compiling _all the references_ in the Forty-Six
> Definitions. *Nowhere* do they loop. _There is no_
> _self-reference_
> 
> You could return to my earlier post and see that.
> However, I'll make it easy for you. Here it is again.
> Just _look_ .
> 



https://en.wikipedia.org/wiki/Proof_sketch_for_G%C3%B6del%27s_first_incompleteness_theorem


Proof sketch for Gödel's first incompleteness theorem


Contents  
1 Hypotheses of the theory
2 Outline of the proof
3 Gödel numbering
4 The provability relation
5 Self-referential formula 

[toc] | [prev] | [next] | [standalone]


#171719

FromJim Burns <james.g.burns@att.net>
Date2018-02-02 13:16 -0500
Message-ID<ca6bfc08-9699-9a13-ffb9-95d0533ebdb1@att.net>
In reply to#171699
On 2/2/2018 1:39 AM, grahamcooper7@gmail.com wrote:
> On Friday, February 2, 2018 at 4:19:10 PM UTC+10,
> Jim Burns wrote:

>> is self-referential. I went to the trouble
>> of compiling _all the references_ in the Forty-Six
>> Definitions. *Nowhere* do they loop. _There is no_
>> _self-reference_
>> You could return to my earlier post and see that.
>> However, I'll make it easy for you. Here it is again.
>> Just _look_ .
> 
> https://en.wikipedia.org/wiki/Proof_sketch_for_G%C3%B6del%27s_first_incompleteness_theorem
> Proof sketch for Gödel's first incompleteness theorem
> Contents
> 1 Hypotheses of the theory
> 2 Outline of the proof
> 3 Gödel numbering
> 4 The provability relation
> 5 Self-referential formula

I can see how it could be useful to _speak as though_ there is
some sort of semantic loop, leading to a contradiction, with
the result being there is no proof possible. But that is only
a (possibly enlightening) way of speaking.

Suppose we prove in a theory T, for a particular sentence G,
    T  |-  G <-> ~Prov_T[G]
The definition of G *IS NOT* ~Prov_T[G]. We know what the
definition of G is, it's in the proof, and that's not it.

The Incoherence Objection claims that there is no such G,
because (allegedly) defining G requires the use of G. But
that's wrong. The definition of G is elsewhere, and you can
see, when you look at it elsewhere, that it doesn't require
the use of G. This is an interesting property of G, not its
definition:
    T  |-  G <-> Prov_T[G]

Consider the claim that, for a particular natural number g,
    g = g*g

I would like to prove this claim. Let g be 0. Done.
Notice that the definition of g _is not_
    g = g*g
The definition is 0. g = g*g is an interesting(?) property
that g (when defined to be 0) has.

----
If we are concerned about whether the sentence G is
semantically grounded, a more accurate way to see what
is going on is that we arrive at the same place
(metaphorically) by two different routes. It is the
requirement that the two routes end at _the same place_
which forces G to have no proof in T.

I've got my definitions below.[1]

One way to arrive at qqx (AKA the Godel number of G)
is to take the formula Q(x)
    Ey:( ~Prov_T(y) & sub(x,[x],x) = y)
calculate the Godel number for that
    qx = [Ey:( ~Prov_T(y) & sub(x,[x],x) = y)]
substitute qx in that for the free variable x in Q(x)
    Ey:( ~Prov_T(y) & sub(qx,[x],qx) = y)
and then calculate the Godel number for that new formula
    qqx = [Ey:( ~Prov_T(y) & sub(x,[x],x) = y)]

A second way to arrive at qqx is to take qx (as above)
and apply sub() to it:
    sub(qx,[x],qx) = qqx

I claim that we can show that
    sub(qx,[x],qx) = [Q(qx)]

    (With a proper definition of sub(), proving this ought to
    be straightforward.)
This is not self-referential.
 From the diagonal lemma,
    Ey:( ~P(y)  &  f(b) = y ) <-> ~P(f(b))
we get
    Q(qx) <-> ~Prov_T(sub(qx,[x],qx))
 From those we get
    Q(qx) <-> ~Prov_T[Q(qx)]

[1]
Q(x) :<-> Ey:( ~Prov_T(y) & sub(x,[x],x) = y)

Q(x) is defined to be this formula with one free variable x.

qx := [Ey:( ~Prov_T(y) & sub(x,[x],x) = y)]

qx is defined to be the Godel number which represents
the formula-with-free-variable Q(x). It's a particular
number, just as Q(x) is a particular formula.

Q(qx) :<-> Ey:( ~Prov_T(y) & sub(qx,[x],qx) = y)

qqx := [Ey:( ~Prov_T(y) & sub(qx,[x],qx) = y)]

[toc] | [prev] | [next] | [standalone]


#171478

Fromgrahamcooper7@gmail.com
Date2018-01-31 00:03 -0800
Message-ID<2f85e8cd-6438-4c51-828c-9778f1f8405e@googlegroups.com>
In reply to#171407
On Wednesday, January 31, 2018 at 11:54:09 AM UTC+10, Jim Burns wrote:
> On 1/30/2018 8:30 PM, peteolcott wrote:
> 
> > I can't understand why FOPL was ever created when it is so
> > easy to totally eliminate the restriction to FO. MY HOL is
> > the tiniest little change from FOL and it can express any
> > order of logic from 0 to N.
> 
> What you did, expressing the logic, writing things down, is the
> easy part. You haven't gotten started on the harder parts yet,
> it would seem.
> 
> <wiki>
>     It is a corollary of Gödel's incompleteness theorem that
>     there is no deductive system (that is, no notion of
>     provability) for second-order formulas that simultaneously
>     satisfies these three desired attributes:[4]

      -- (Soundness) Every provable second-order sentence is
         universally valid, i.e., true in all domains under
         standard semantics.
      -- (Completeness) Every universally valid second-order
         formula, under standard semantics, is provable.
      -- (Effectiveness) There is a proof-checking algorithm that
         can correctly decide whether a given sequence of symbols
         is a proof or not.



How you Qualify "not(exist(proof(X))) = X" with 

SOUNDNESS
COMPLETENESS
EFFECTIVENESS


qualifies the BiGGEST BALONY SAMMICH! in FRIEKN' HisTREE Me FRIEND!

[toc] | [prev] | [next] | [standalone]


#171507

FromPete Olcott <Pete@NoEmail.address>
Date2018-01-31 10:56 -0600
Message-ID<4O6dnQlW3PmxaOzHnZ2dnUU7-fednZ2d@giganews.com>
In reply to#171478
On 1/31/2018 2:03 AM, grahamcooper7@gmail.com wrote:
> On Wednesday, January 31, 2018 at 11:54:09 AM UTC+10, Jim Burns wrote:
>> On 1/30/2018 8:30 PM, peteolcott wrote:
>>
>>> I can't understand why FOPL was ever created when it is so
>>> easy to totally eliminate the restriction to FO. MY HOL is
>>> the tiniest little change from FOL and it can express any
>>> order of logic from 0 to N.
>>
>> What you did, expressing the logic, writing things down, is the
>> easy part. You haven't gotten started on the harder parts yet,
>> it would seem.
>>
>> <wiki>
>>      It is a corollary of Gödel's incompleteness theorem that
>>      there is no deductive system (that is, no notion of
>>      provability) for second-order formulas that simultaneously
>>      satisfies these three desired attributes:[4]
> 
>        -- (Soundness) Every provable second-order sentence is
>           universally valid, i.e., true in all domains under
>           standard semantics.
>        -- (Completeness) Every universally valid second-order
>           formula, under standard semantics, is provable.
>        -- (Effectiveness) There is a proof-checking algorithm that
>           can correctly decide whether a given sequence of symbols
>           is a proof or not.
> 
> 
> 
> How you Qualify "not(exist(proof(X))) = X" with
> 
> SOUNDNESS
> COMPLETENESS
> EFFECTIVENESS
> 
> 
> qualifies the BiGGEST BALONY SAMMICH! in FRIEKN' HisTREE Me FRIEND!
> 

That is very easy, yet so far no one beside me has seen this
"not(exist(proof(X))) = X"
is not a sentence, it is semantically ill-formed.

-- 
*∀X True(X) ↔ ∃Γ ⊆ Axioms Provable(Γ, X) *

[toc] | [prev] | [next] | [standalone]


#171495

FromPeter Percival <peterxpercival@hotmail.com>
Date2018-01-31 15:15 +0000
Message-ID<p4smjd$oje$1@news.albasani.net>
In reply to#171395
peteolcott wrote:

> I can't understand why FOPL was ever created when it is so easy
> to totally eliminate the restriction to FO. 

FOL behaves nicely, HOL doesn't.  But one can get the benefit of HO 
quantification in set theory.  One has a set of "things", and the 
subsets of that set are also "things", and the subsets of the 
subsets,...  So that when one FO quantifies over the things one is 
really SO quantifying, and TO quantifying,...  The set theorists would 
like (x in y : some condition on x} to be a set whenever y is.  But 
what's a condition on x?  Answer, a FO formula with x free.

But type theory is flourishing too.  Russell's was a bit of a mess, to 
be honest, but Alonzo Church and Per Martin-Löf have both given nice 
accounts.  One reason for the rehabilitation of type theory has been its 
significance for computing due to the similarity of meaning of "type" in 
the two domains.

> MY HOL is the

Your HOL! :-)  As if.

> tiniest little change from FOL and it can express any order
> of logic from 0 to N.
> 

[toc] | [prev] | [next] | [standalone]


#171536

FromPete Olcott <Pete@NoEmail.address>
Date2018-01-31 16:11 -0600
Message-ID<PsOdnQ1ZQYixou_HnZ2dnUU7-WednZ2d@giganews.com>
In reply to#171495
On 1/31/2018 9:15 AM, Peter Percival wrote:
> peteolcott wrote:
> 
>> I can't understand why FOPL was ever created when it is so easy
>> to totally eliminate the restriction to FO. 
> 
> FOL behaves nicely, HOL doesn't.  But one can get the benefit of HO quantification in set theory.  One has a set of "things", and the subsets of that set are also "things", and the subsets of the subsets,...  So that when one FO quantifies over the things one is really SO quantifying, and TO quantifying,...  The set theorists would like (x in y : some condition on x} to be a set whenever y is.  But what's a condition on x?  Answer, a FO formula with x free.
> 
> But type theory is flourishing too.  Russell's was a bit of a mess, to be honest, but Alonzo Church and Per Martin-Löf have both given nice accounts.  One reason for the rehabilitation of type theory has been its significance for computing due to the similarity of meaning of "type" in the two domains.
> 
>> MY HOL is the
> 
> Your HOL! :-)  As if.

I am the author of its BNF specification and no one else has a single
language that can express any order of predicate logic from 0 to N.

> 
>> tiniest little change from FOL and it can express any order
>> of logic from 0 to N.
>>
> 



-- 
*∀X True(X) ↔ ∃Γ ⊆ Axioms Provable(Γ, X) *

[toc] | [prev] | [next] | [standalone]


#171539

FromPeter Percival <peterxpercival@hotmail.com>
Date2018-01-31 22:29 +0000
Message-ID<p4tg0u$pgu$1@news.albasani.net>
In reply to#171536
Pete Olcott wrote:
> On 1/31/2018 9:15 AM, Peter Percival wrote:
>> peteolcott wrote:
>>
>>> I can't understand why FOPL was ever created when it is so easy
>>> to totally eliminate the restriction to FO. 
>>
>> FOL behaves nicely, HOL doesn't.  But one can get the benefit of HO 
>> quantification in set theory.  One has a set of "things", and the 
>> subsets of that set are also "things", and the subsets of the 
>> subsets,...  So that when one FO quantifies over the things one is 
>> really SO quantifying, and TO quantifying,...  The set theorists would 
>> like (x in y : some condition on x} to be a set whenever y is.  But 
>> what's a condition on x?  Answer, a FO formula with x free.
>>
>> But type theory is flourishing too.  Russell's was a bit of a mess, to 
>> be honest, but Alonzo Church and Per Martin-Löf have both given nice 
>> accounts.  One reason for the rehabilitation of type theory has been 
>> its significance for computing due to the similarity of meaning of 
>> "type" in the two domains.
>>
>>> MY HOL is the
>>
>> Your HOL! :-)  As if.
> 
> I am the author of its BNF specification and no one else has a single
> language that can express any order of predicate logic from 0 to N.

How do you know?  You have read nothing about logic.  I exaggerate: you 
read the first sentence and confidently assert "this is wrong".

If there is such a thing as your HOL, then you ought to be able to 
answer simple question about it such as - what are its substitution rules?

>>
>>> tiniest little change from FOL and it can express any order
>>> of logic from 0 to N.
>>>
>>
> 
> 
> 

[toc] | [prev] | [next] | [standalone]


#171642

FromPete Olcott <Pete@NoEmail.address>
Date2018-02-01 16:42 -0600
Message-ID<O5mdncPwkP1PCu7HnZ2dnUU7-KHNnZ2d@giganews.com>
In reply to#171539
On 1/31/2018 4:29 PM, Peter Percival wrote:
> Pete Olcott wrote:
>> On 1/31/2018 9:15 AM, Peter Percival wrote:
>>> peteolcott wrote:
>>>
>>>> I can't understand why FOPL was ever created when it is so easy
>>>> to totally eliminate the restriction to FO. 
>>>
>>> FOL behaves nicely, HOL doesn't.  But one can get the benefit of HO quantification in set theory.  One has a set of "things", and the subsets of that set are also "things", and the subsets of the subsets,...  So that when one FO quantifies over the things one is really SO quantifying, and TO quantifying,...  The set theorists would like (x in y : some condition on x} to be a set whenever y is.  But what's a condition on x?  Answer, a FO formula with x free.
>>>
>>> But type theory is flourishing too.  Russell's was a bit of a mess, to be honest, but Alonzo Church and Per Martin-Löf have both given nice accounts.  One reason for the rehabilitation of type theory has been its significance for computing due to the similarity of meaning of "type" in the two domains.
>>>
>>>> MY HOL is the
>>>
>>> Your HOL! :-)  As if.
>>
>> I am the author of its BNF specification and no one else has a single
>> language that can express any order of predicate logic from 0 to N.
> 
> How do you know?  You have read nothing about logic.  

My thirty years as a software engineer allows me to reverse-engineer how these things must work.
This process is not helpful in understanding terminological conventions.

> I exaggerate: you read the first sentence and confidently assert "this is wrong".
> 
> If there is such a thing as your HOL, then you ought to be able to answer simple question about it such as - what are its substitution rules?
> 

I have only defined HOL with self-reference semantics at the syntax level:

Names refer to integer subscripts of root nodes of directed acyclic graphs.
A HOL expression can quantify over any of these names and these names can
be defined within a hierarchy of increasing orders of logic.

I have not yet defined its inference engine so I don't yet know things such
as the equivalent of Lambda Calculus Beta reduction.

copyright 2018 Pete Olcott

-- 
*∀X True(X) ↔ ∃Γ ⊆ Axioms Provable(Γ, X) *

[toc] | [prev] | [next] | [standalone]


#171708

FromPeter Percival <peterxpercival@hotmail.com>
Date2018-02-02 13:28 +0000
Message-ID<p51p1n$ot3$1@news.albasani.net>
In reply to#171642
Pete Olcott wrote:

>> If there is such a thing as your HOL, then you ought to be able to 
>> answer simple question about it such as - what are its substitution 
>> rules?
>>
> 
> I have only defined HOL with self-reference semantics at the syntax level:

Substitution is a matter of syntax.

> 
> Names refer to integer subscripts of root nodes of directed acyclic graphs.
> A HOL expression can quantify over any of these names and these names can
> be defined within a hierarchy of increasing orders of logic.
> 
> I have not yet defined its inference engine so I don't yet know things such
> as the equivalent of Lambda Calculus Beta reduction.
> 
> copyright 2018 Pete Olcott
> 

[toc] | [prev] | [next] | [standalone]


#171187

FromJim Burns <james.g.burns@att.net>
Date2018-01-27 13:08 -0500
Message-ID<5ab2f382-0d07-65fc-417f-4119ac2f368e@att.net>
In reply to#171118
On 1/26/2018 5:28 PM, Pete Olcott wrote:
> On 1/25/2018 11:45 PM, Jim Burns wrote:
>> On 1/25/2018 11:41 PM, Pete Olcott wrote:
>>> On 1/25/2018 9:20 PM, Jim Burns wrote:
>>>> On 1/25/2018 1:31 PM, peteolcott wrote:

>>>>> Summed up using different notation as this:
>>>>> ∃Γ ⊆ Q ~Provable(Γ, X)
>>>>
>>>> No, that really doesn't sum up what I said. That says
>>>> neither that Provable(x) is written in the language of Q
>>>> nor that Provable determines whether X has a proof _in Q_.
>>>
>>> (1) I said it incorrectly. I posted a correction.
>>>
>>> (2) I was trying to concisely formalize your paragraph.
>>>
>>> (3) This is my correction: ~∃Γ ⊆ Q Provable(Γ, X)
>>
>> No, that really doesn't sum up what I said. That says
>> neither that Provable(x) is written in the language of Q
>> nor that Provable determines whether X has a proof _in Q_.
>> How many times are we going to go around on this?
> 
> Until you realize that I am not talking about a proof in
> the language of Q and am instead talking about an enormously
> simplified analogous proof in the language of H.

Then that's not what *I* said, right?
Please be so kind as to stop lying about what *I'm* saying.
Thanks in advance.

Suppose, as a fixed goal, we are trying to prove that
(presumably consistent) Q is incomplete.

    (If I am wrong about what we are trying to do, that maybe
    we want to prove that some other theory, one that we don't
    need to define a provability predicate for, is incomplete,
    then you're right, the proof is enormously simplified.
    It's basically just the Diagonal Lemma. Should we go over
    the Diagonal Lemma again, in order to look for errors in it?)

Let us ask the question
<PO>
    So why can't we simplify all that and define the same
    thing in HOL?
</PO>

The broad outline of the proof that Q is incomplete is: Provide
a counter-example to the claim that Q is complete, ie, a sentence
in the language of Q with some unusual properties, which we will
refer to as G for convenience.

    (The claims that Q is complete or incomplete involve a
    definition of what a proof in Q is (determined by its axioms
    and inference rules) and a definition of what a sentence in
    Q is (a completely syntactic notion: a formula entirely in
    the language of arithmetic (S,0,+,*) in which every occurrence
    of every variable is associated with a quantifier). If we
    change our definitions -- of the axioms, of the rules, of the
    sentences -- then we are no longer trying to arrive at our
    _fixed goal_ stated above, no matter what we _say_ we're doing.)

The counter-example G incorporates an expression which can be
interpreted as
    "x is the number of a sentence in Q which has a proof in Q"
I think it's a little redundant to say "in Q" twice there, the
only thing Q can prove are sentences in Q, but it's possible
to do worse than be a little redundant.

In what language is that expression? Our menu presents two
options, Robinson arithmetic Q and a higher order logic H
which has a pre-defined provability-in-Q predicate. These are
necessarily different expressions, Q doesn't have such a
pre-defined predicate and the point of H is to _use_ its
pre-defined predicate. We'll call them QprovQ() and HprovQ().

Suppose that there is an expression which can be interpreted as
    "the number for an expression which had one free variable
    but which now has had a numeral substituted for that free
    variable"
for specific free-variabled expressions and specific numerals.

I think the expression that gets its variable substituted for
must be in Q. This is about sentences in Q, after all.

In what language is that expression-which-can-be-interpreted?
Perhaps it is in the language of Q, perhaps it is in the language
of H. Depending upon which it is, we will call it QsubstQ() or
HsubstQ().

What does the prospective counter-example G look like?

If we are working in Q, we must use expressions in the language
of Q. Let's make definitions for

the predicate (AKA expression with one free variable)
    B(x) :<->  Ey:( ~QprovQ(y) & QsubstQ(x,x) = y )

the number for the predicate B(x), with x free
    bx  :=  [Ey:( ~QprovQ(y) & QsubstQ(x,x) = y )]

the number for the _sentence_ B(bx) which has bx substituted
for x, and so has no free variable
    bbx  :=  [Ey:( ~QprovQ(y) & QsubstQ(bx,bx) = y )]
    bbx = [B(bx)]

The diagonal lemma shows that it is a theorem
    Q  |-  B(bx) <-> ~QprovQ([B(bx)])

We see from the definition of B(x) that QprovQ() and QsubstQ()
are in the language of Q. Therefore, B(bx) is a sentence in
the language of Q with the property that, if B(bx) is true,
then it has no proof-in-Q, and, if it is false, there is a
proof-in-Q that it is true.


On the other hand, if we are working in H, our definitions are

the predicate (AKA expression with one free variable)
    C(x) :<->  Ey:( ~HprovQ(y) & HsubstQ(x,x) = y )

the number for the predicate C(x), with x free
    cx  :=  [Ey:( ~HprovQ(y) & HsubstQ(x,x) = y )]

the number for the _sentence_ C(cx) which has cx substituted
for x, and so has no free variable
    ccx  :=  [Ey:( ~HprovQ(y) & HsubstQ(cx,cx) = y )]
    ccx = [C(cx)]

The diagonal lemma shows that it is a theorem
    H  |-  C(cx) <-> ~HprovQ([C(cx)])

We see from the definition of C(x) that C(cx) is a sentence
_in the language of H_ such that, if C(cx) is true, then
C(cx) has no proof-in-Q, and, if it is false, there is a
proof-in-Q that it is true.

C(cx) is not a sentence in the language of Q, so it can't be
a counter-example to Q's completeness.

    I don't think it's relevant, but, in the case of C(cx)
    being false, keep in mind that C(cx) can be false in H
    and true in Q. They're different formal systems, with
    different axioms and different rules.

> If we can create a proof that is precisely analogous to the
> 1931 GIT and make this analogous proof 100,000  times simpler,
> thenn (then and only then) a much deeper understanding of
> the original proof becomes possible through analogy.

<https://plato.stanford.edu/entries/logic-provability/>

> MTT is H, and I am almost done redesigning it. Types are
> now optional. So a subset of MTT is HOL with self-reference
> semantics.

You are moving the argument to MTT _in the hopes_ that you
will find some error in the proof-in-Q over there. I would
wish you much enjoyment of your search for an error over there,
knowing that one can learn a lot, even in a doomed search.
    (I'm sure Ponce de Leon learned a lot about mosquitoes
    and alligators while he was looking for the Fountain of
    Youth in Florida.)

The irritating thing is not that you're looking for something
I have good reason to think doesn't exist. I find it very
irritating that you wobble into claims that you have already
found your personal Fountain of Youth, and that we are liars for
not acknowledging your victory.

> To make HOL with self-reference semantics only required less than
> a dozen additional lines of BNF (formal language specification)
> over and above the BNF of FOL. This HOL can express any finite
> order of logic from 0 to N. (Propositional Logic is 0).

This
    B(bx)
does not require any self-reference semantics. It is in the
language of arithmetic (S,0,+,*). If you know what S,0,+,* are,
then you're good to go.

Consider Robinson arithmetic Q as a box of crayons which we are
using to draw a box of crayons. It is not at all paradoxical.

We are fortunate in that, instead of using real crayons to draw
a real box of crayons, we are drawing with formal sentences
our "box of crayons" which is really a formal theory. That means
that our drawing can be _perfectly accurate_ . But that perfect
accuracy does not make it paradoxical.

[toc] | [prev] | [next] | [standalone]


#171313

FromPete Olcott <Pete@NoEmail.address>
Date2018-01-29 22:57 -0600
Message-ID<99KdnWCOXuu2ZvLHnZ2dnUU7-Y3NnZ2d@giganews.com>
In reply to#171187
On 1/27/2018 12:08 PM, Jim Burns wrote:
> On 1/26/2018 5:28 PM, Pete Olcott wrote:
>> On 1/25/2018 11:45 PM, Jim Burns wrote:
>>> On 1/25/2018 11:41 PM, Pete Olcott wrote:
>>>> On 1/25/2018 9:20 PM, Jim Burns wrote:
>>>>> On 1/25/2018 1:31 PM, peteolcott wrote:
> 
>>>>>> Summed up using different notation as this:
>>>>>> ∃Γ ⊆ Q ~Provable(Γ, X)
>>>>>
>>>>> No, that really doesn't sum up what I said. That says
>>>>> neither that Provable(x) is written in the language of Q
>>>>> nor that Provable determines whether X has a proof _in Q_.
>>>>
>>>> (1) I said it incorrectly. I posted a correction.
>>>>
>>>> (2) I was trying to concisely formalize your paragraph.
>>>>
>>>> (3) This is my correction: ~∃Γ ⊆ Q Provable(Γ, X)
>>>
>>> No, that really doesn't sum up what I said. That says
>>> neither that Provable(x) is written in the language of Q
>>> nor that Provable determines whether X has a proof _in Q_.
>>> How many times are we going to go around on this?
>>
>> Until you realize that I am not talking about a proof in
>> the language of Q and am instead talking about an enormously
>> simplified analogous proof in the language of H.
> 
> Then that's not what *I* said, right?
> Please be so kind as to stop lying about what *I'm* saying.
> Thanks in advance.
> 
> Suppose, as a fixed goal, we are trying to prove that
> (presumably consistent) Q is incomplete.
> 

I am not willing to discuss that. The analogous proof that I am
willing to discuss is 100,000-fold less convoluted such that the
human mind can actually grasp the relevant interactions and not
get so bogged down in convoluted detail to totally obscure these
key interactions.

You kept trying to explain to me the process for substituting
one finite string for another such that the finite strings are
so long that no one can every actually look and see the result
string.

The Godel proof in a language with provability predicates does
not require the enormous convolutions of 46 different definitions
just to simulate a provability predicate with the diagonal lemma.

BTW what are your credentials? I am asking everyone.
I have a BSBA and all the computer science courses required
for a computer science degree. I graduated from UNO Omaha in 1986
with a 3.51 GPA on a 4.0 scale.

I have two software engineering patents:
https://patents.google.com/patent/US7046848B1/en?oq=7046848
https://patents.google.com/patent/US9171207B1/en?oq=9171207++
and thirty years as a software engineer.

George has a MSCS.

[toc] | [prev] | [next] | [standalone]


#171382

FromJim Burns <james.g.burns@att.net>
Date2018-01-30 12:03 -0500
Message-ID<fcdb3e26-454c-1578-32b9-2491e6ab2598@att.net>
In reply to#171313
On 1/29/2018 11:57 PM, Pete Olcott wrote:
> On 1/27/2018 12:08 PM, Jim Burns wrote:

>> Suppose, as a fixed goal, we are trying to prove that
>> (presumably consistent) Q is incomplete.
> 
> I am not willing to discuss that.

You aren't willing to discuss _anything_

*In my next paragraph*
<JB>
    (If I am wrong about what we are trying to do, that maybe
    we want to prove that some other theory, one that we don't
    need to define a provability predicate for, is incomplete,
    then you're right, the proof is enormously simplified.
    It's basically just the Diagonal Lemma. Should we go over
    the Diagonal Lemma again, in order to look for errors in it?)
</JB>

> The analogous proof that I am willing to discuss is
> 100,000-fold less convoluted such that the human mind can
> actually grasp the relevant interactions and not get so
> bogged down in convoluted detail to totally obscure these
> key interactions.

The Forty-Six Definitions _do not_ obscure the detail. That
is _why_ we use definitions. That is _how_ we humans grasp
the relevant interactions, by packing details into
definitions.

I am not super-human, and yet I can read those 46 definitions
and say to myself
    "Aha! Godel starts out defining what he needs to define
    tools that can manipulate finite lists of numbers. Then he
    describes a formal language, then he describes axioms, then
    he describes inference rules and proof and, finally,
    provability."
It is _those definitions_ which give Provable(x) the meaning
    "x is the number of a sentence which has a proof in the
    theory described"
_not_ the name "Provable".

For whatever good it will do you, though, you have had for some
time now what you're asking for here.
<https://plato.stanford.edu/entries/logic-provability/>

[toc] | [prev] | [next] | [standalone]


Page 9 of 13 — ← Prev page 1 … 7 8 [9] 10 11 … 13  Next page →

Back to top | Article view | sci.logic


csiph-web