Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > sci.logic > #167044 > unrolled thread
| Started by | Rupert <rupertmccallum@yahoo.com> |
|---|---|
| First post | 2017-11-18 16:34 -0800 |
| Last post | 2017-11-19 19:18 -0800 |
| Articles | 20 on this page of 68 — 8 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: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Rupert <rupertmccallum@yahoo.com> - 2017-11-18 16:34 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Rupert <rupertmccallum@yahoo.com> - 2017-11-18 18:40 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? peteolcott <peterolcott2@gmail.com> - 2017-11-18 18:59 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? grahamcooper7@gmail.com - 2017-11-18 20:31 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? grahamcooper7@gmail.com - 2017-11-19 04:28 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? peteolcott <peterolcott2@gmail.com> - 2017-11-20 05:55 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? grahamcooper7@gmail.com - 2017-11-20 18:11 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? peteolcott <peterolcott2@gmail.com> - 2017-11-21 06:48 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Rupert <rupertmccallum@yahoo.com> - 2017-11-20 14:14 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? peteolcott <peterolcott2@gmail.com> - 2017-11-20 14:43 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-21 00:29 +0000
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? peteolcott <peterolcott2@gmail.com> - 2017-11-20 17:11 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-21 01:44 +0000
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? peteolcott <peterolcott2@gmail.com> - 2017-11-20 17:49 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-21 12:30 +0000
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Pete Olcott <Pete@NoEmail.address> - 2017-11-21 13:06 -0600
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Pete Olcott <Pete@NoEmail.address> - 2017-11-21 13:28 -0600
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-22 01:31 +0000
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? peteolcott <peterolcott2@gmail.com> - 2017-11-21 17:53 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-22 21:39 +0000
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? peteolcott <peterolcott2@gmail.com> - 2017-11-22 18:35 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-23 23:43 +0000
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? peteolcott <peterolcott2@gmail.com> - 2017-11-23 16:39 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-24 01:05 +0000
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? grahamcooper7@gmail.com - 2017-11-23 20:23 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? grahamcooper7@gmail.com - 2017-11-23 20:24 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-24 12:30 +0000
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Pete Olcott <Pete@NoEmail.address> - 2017-11-24 08:51 -0600
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Jim Burns <james.g.burns@att.net> - 2017-11-24 10:37 -0500
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? peteolcott <peterolcott2@gmail.com> - 2017-11-24 07:47 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Jim Burns <james.g.burns@att.net> - 2017-11-24 11:10 -0500
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-24 20:29 +0000
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Pete Olcott <Pete@NoEmail.address> - 2017-11-24 20:50 -0600
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-25 12:47 +0000
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-24 20:29 +0000
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Jim Burns <james.g.burns@att.net> - 2017-11-23 20:54 -0500
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Rupert <rupertmccallum@yahoo.com> - 2017-11-20 17:16 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? peteolcott <peterolcott2@gmail.com> - 2017-11-20 17:31 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Rupert <rupertmccallum@yahoo.com> - 2017-11-20 17:51 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? peteolcott <peterolcott2@gmail.com> - 2017-11-20 17:55 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Rupert <rupertmccallum@yahoo.com> - 2017-11-20 17:52 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? peteolcott <peterolcott2@gmail.com> - 2017-11-20 18:01 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Rupert <rupertmccallum@yahoo.com> - 2017-11-20 23:08 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Rupert <rupertmccallum@yahoo.com> - 2017-11-21 11:02 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Pete Olcott <Pete@NoEmail.address> - 2017-11-21 13:30 -0600
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Peter Percival <peterxpercival@hotmail.com> - 2017-11-21 20:09 +0000
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Peter Percival <peterxpercival@hotmail.com> - 2017-11-21 20:54 +0000
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Jim Burns <james.g.burns@att.net> - 2017-11-21 16:18 -0500
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Rupert <rupertmccallum@yahoo.com> - 2017-11-21 22:31 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? grahamcooper7@gmail.com - 2017-11-23 17:03 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Rupert <rupertmccallum@yahoo.com> - 2017-11-20 17:04 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? peteolcott <peterolcott2@gmail.com> - 2017-11-20 17:22 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Rupert <rupertmccallum@yahoo.com> - 2017-11-20 17:54 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? peteolcott <peterolcott2@gmail.com> - 2017-11-20 18:03 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Newberry <newberryxy@gmail.com> - 2017-11-20 20:35 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? grahamcooper7@gmail.com - 2017-11-20 22:01 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Peter Percival <peterxpercival@hotmail.com> - 2017-11-21 09:44 +0000
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? grahamcooper7@gmail.com - 2017-11-21 02:30 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? peteolcott <peterolcott2@gmail.com> - 2017-11-21 10:36 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Peter Percival <peterxpercival@hotmail.com> - 2017-11-21 09:38 +0000
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Peter Percival <peterxpercival@hotmail.com> - 2017-11-21 11:56 +0000
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? grahamcooper7@gmail.com - 2017-11-21 04:29 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? grahamcooper7@gmail.com - 2017-11-21 04:31 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Peter Percival <peterxpercival@hotmail.com> - 2017-11-21 14:37 +0000
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Newberry <newberryxy@gmail.com> - 2017-11-21 21:42 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Newberry <newberryxy@gmail.com> - 2017-11-22 06:36 -0800
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Jim Burns <james.g.burns@att.net> - 2017-11-22 13:44 -0500
Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? Newberry <newberryxy@gmail.com> - 2017-11-19 19:18 -0800
Page 1 of 4 [1] 2 3 4 Next page →
| From | Rupert <rupertmccallum@yahoo.com> |
|---|---|
| Date | 2017-11-18 16:34 -0800 |
| Subject | Re: Is this not a correct simplification of the 1931 Incompleteness Theorem formula? |
| Message-ID | <637844cc-0e35-45a0-aff5-2c7b426b5f90@googlegroups.com> |
On Thursday, November 16, 2017 at 6:27:50 PM UTC+1, Pete Olcott wrote: > https://plato.stanford.edu/entries/goedel-incompleteness/#FirIncTheCom > > (G) F ⊢ GF ↔ ¬ProvF(⌈GF⌉). > -- > Defining Tarski’s ∀x True(x) ↔ φ(x) > ∀x True(x) ↔ ∃y Provable(y, x) // True entirely defined by Provability > ∀x False(x) ↔ ∃y Provable(y, ~x) // False entirely defined by Refutability What you have after the (G) is correct, yes. The formal theory F proves that the Goedel sentence G_F is equivalent to ¬Prov_F(G_F).
[toc] | [next] | [standalone]
| From | Rupert <rupertmccallum@yahoo.com> |
|---|---|
| Date | 2017-11-18 18:40 -0800 |
| Message-ID | <8d368fb7-6f43-4540-ae12-de651776bdd0@googlegroups.com> |
| In reply to | #167044 |
On Sunday, November 19, 2017 at 2:37:47 AM UTC+1, Pete Olcott wrote: > On 11/18/2017 6:34 PM, Rupert wrote: > > > > On Thursday, November 16, 2017 at 6:27:50 PM UTC+1, Pete Olcott wrote: > > > https://plato.stanford.edu/entries/goedel-incompleteness/#FirIncTheCom > > (G) F ⊢ GF ↔ ¬ProvF(⌈GF⌉). > -- > Defining Tarski’s ∀x True(x) ↔ φ(x) > ∀x True(x) ↔ ∃y Provable(y, x) // True entirely defined by Provability > ∀x False(x) ↔ ∃y Provable(y, ~x) // False entirely defined by Refutability > > > What you have after the (G) is correct, yes. > > The formal theory F proves that the Goedel sentence G_F is equivalent to ¬Prov_F(G_F). > > > > > OK then you are saying that the Stanford University form of the > 1931 Incompleteness Theorem (shown above) accurately sums up the > essence of the formula at the top of page 57 of the original > paper? > > > > https://monoskop.org/images/9/93/Kurt_Gödel_On_Formally_Undecidable_Propositions_of_Principia_Mathematica_and_Related_Systems_1992.pdf > > > > -- > Defining Tarski’s ∀x True(x) ↔ φ(x) > ∀x True(x) ↔ ∃y Provable(y, x) // True entirely defined by Provability > ∀x False(x) ↔ ∃y Provable(y, ~x) // False entirely defined by Refutability No.
[toc] | [prev] | [next] | [standalone]
| From | peteolcott <peterolcott2@gmail.com> |
|---|---|
| Date | 2017-11-18 18:59 -0800 |
| Message-ID | <5a30261e-800b-4895-8f96-9f49dd502f89@googlegroups.com> |
| In reply to | #167048 |
On Saturday, November 18, 2017 at 8:40:51 PM UTC-6, Rupert wrote: > On Sunday, November 19, 2017 at 2:37:47 AM UTC+1, Pete Olcott wrote: > > On 11/18/2017 6:34 PM, Rupert wrote: > > > > > > > > On Thursday, November 16, 2017 at 6:27:50 PM UTC+1, Pete Olcott wrote: > > > > > > https://plato.stanford.edu/entries/goedel-incompleteness/#FirIncTheCom > > > > (G) F ⊢ GF ↔ ¬ProvF(⌈GF⌉). > > -- > > Defining Tarski’s ∀x True(x) ↔ φ(x) > > ∀x True(x) ↔ ∃y Provable(y, x) // True entirely defined by Provability > > ∀x False(x) ↔ ∃y Provable(y, ~x) // False entirely defined by Refutability > > > > > > What you have after the (G) is correct, yes. > > > > The formal theory F proves that the Goedel sentence G_F is equivalent to ¬Prov_F(G_F). > > > > > > > > > > OK then you are saying that the Stanford University form of the > > 1931 Incompleteness Theorem (shown above) accurately sums up the > > essence of the formula at the top of page 57 of the original > > paper? > > > > > > > > https://monoskop.org/images/9/93/Kurt_Gödel_On_Formally_Undecidable_Propositions_of_Principia_Mathematica_and_Related_Systems_1992.pdf > > > > > > > > -- > > Defining Tarski’s ∀x True(x) ↔ φ(x) > > ∀x True(x) ↔ ∃y Provable(y, x) // True entirely defined by Provability > > ∀x False(x) ↔ ∃y Provable(y, ~x) // False entirely defined by Refutability > > No. So Stanford University got it wrong ?
[toc] | [prev] | [next] | [standalone]
| From | grahamcooper7@gmail.com |
|---|---|
| Date | 2017-11-18 20:31 -0800 |
| Message-ID | <0ac51a8a-a82e-4c26-b561-e5a8a44b6e79@googlegroups.com> |
| In reply to | #167049 |
On Sunday, November 19, 2017 at 1:59:51 PM UTC+11, peteolcott wrote: > > So Stanford University got it wrong ? Yes! Its just a cyclic argument. This is BIG G ( g<->~EpP(p,g) ) ^ g It says that g<->~Ep Prf(p,g) AND ~Ep Prf(p,g) ALL IN 1! It creates the SAME DILLEMA as Godel's Proof L-O-G-I-C-A-L-L-Y
[toc] | [prev] | [next] | [standalone]
| From | grahamcooper7@gmail.com |
|---|---|
| Date | 2017-11-19 04:28 -0800 |
| Message-ID | <06f82fc1-2233-417d-a858-77428178ee81@googlegroups.com> |
| In reply to | #167050 |
Defining Tarski’s ∀x True(x) ↔ φ(x) ∀x True(x) ↔ ∃y Provable(y, x) // True entirely defined by Provability ∀x False(x) ↔ ∃y Provable(y, ~x) // False entirely defined by Refutability tRY tHIS iN pROLOG! b >= 0. b+1 >= s+1 <- b >= s EG 4>=2 IF 3>=1 3>=1 IF 2>=0 3>=1 IF TRUE 4>=2 IF 3>=1 4>=2 IF TRUE 4>=2 Cycles in directed graphs of logical expressions are erroneous http://liarparadox.org/index.php/2017/11/03/refuting-the-conclusion-of-godels-1931-incompleteness-theorem/
[toc] | [prev] | [next] | [standalone]
| From | peteolcott <peterolcott2@gmail.com> |
|---|---|
| Date | 2017-11-20 05:55 -0800 |
| Message-ID | <f2fb31cf-5c06-4471-bd0f-6f1317d8227c@googlegroups.com> |
| In reply to | #167063 |
On Sunday, November 19, 2017 at 6:28:33 AM UTC-6, graham...@gmail.com wrote: > Defining Tarski’s ∀x True(x) ↔ φ(x) > ∀x True(x) ↔ ∃y Provable(y, x) // True entirely defined by Provability > ∀x False(x) ↔ ∃y Provable(y, ~x) // False entirely defined by Refutability > > > > tRY tHIS iN pROLOG! > > > b >= 0. > > > b+1 >= s+1 <- b >= s > > > > > EG > > 4>=2 IF 3>=1 > > 3>=1 IF 2>=0 > > > 3>=1 IF TRUE > > 4>=2 IF 3>=1 > > 4>=2 IF TRUE > > 4>=2 > > > > > Cycles in directed graphs of logical expressions are erroneous > http://liarparadox.org/index.php/2017/11/03/refuting-the-conclusion-of-godels-1931-incompleteness-theorem/ Currently I only know Prolog well enough to know that it detects the Pathological Self-Reference error (pete olcott 2004 comp.theory). https://groups.google.com/forum/#!original/comp.theory/RO9Z9eCabeE/Ka8-xS2rdEEJ The Stanford University simplification of the 1931 Incompleteness Theorem has this error. There were quality control issues with Lightning Source UK Ltd printing of my Clocksin Mellish text that took three months to resolve. Make sure that you avoid buying any PRINT-ON-DEMAND books, especially from this source. PRINT-ON-DEMAND books are a new way for publishers to reduce inventory carrying costs that currently have enormous quality control issues. These books are printed at what looks like low DPI JPG images. Bookfinder.com lets you screen out these books.
[toc] | [prev] | [next] | [standalone]
| From | grahamcooper7@gmail.com |
|---|---|
| Date | 2017-11-20 18:11 -0800 |
| Message-ID | <2bdb2711-ccd4-4293-913f-31e5ad1f29d8@googlegroups.com> |
| In reply to | #167115 |
On Tuesday, November 21, 2017 at 12:55:42 AM UTC+11, peteolcott wrote: > On Sunday, November 19, 2017 at 6:28:33 AM UTC-6, graham...@gmail.com wrote: > > Defining Tarski’s ∀x True(x) ↔ φ(x) > > ∀x True(x) ↔ ∃y Provable(y, x) // True entirely defined by Provability > > ∀x False(x) ↔ ∃y Provable(y, ~x) // False entirely defined by Refutability > > > > > > > > tRY tHIS iN pROLOG! > > > > > > b >= 0. > > > > > > b+1 >= s+1 <- b >= s > > > > > > > > > > EG > > > > 4>=2 IF 3>=1 > > > > 3>=1 IF 2>=0 > > > > > > 3>=1 IF TRUE > > > > 4>=2 IF 3>=1 > > > > 4>=2 IF TRUE > > > > 4>=2 > > > > > > > > > > Cycles in directed graphs of logical expressions are erroneous > > http://liarparadox.org/index.php/2017/11/03/refuting-the-conclusion-of-godels-1931-incompleteness-theorem/ > > Currently I only know Prolog well enough to know that it detects the Pathological Self-Reference error (pete olcott 2004 comp.theory). > https://groups.google.com/forum/#!original/comp.theory/RO9Z9eCabeE/Ka8-xS2rdEEJ Thanks for the Link! The prolog error you described which parses in most versions f(Q) UNIFY Q is trying to UNIFY the 2 expressions... (see if they fit) u( X,X ) u( Q,f(Q) ) UNIFY is NOT equivalance G <-> f(G) or G <- f(G) or G :- f(G) is standard prolog recursion. > > The Stanford University simplification of the 1931 Incompleteness Theorem has this error. > [PO] The primary benefit of solving the Halting Problem was to detect programs that failed to halt, thus were incorrect. Pathological self-reference can also be viewed as a form of error. If the Halting Problem is redefined (which does not refute anyone), then this redefined problem can be easily solved. Now we have three possible correct results: (a) Halts (b) Does Not Halt (c) Pathological Self Reference to Halt RIGHT! but that still doesn't solve whether a TURING MACHINE can input ANY PROGRAM,INPUT pair and return HALTS or NOT A TM has to INPUT a TM HOW do you solve _THAT_ self reference? If you put BLANKS in the HALT TABLE i - 1 2 3 4 5 p 1 - H H H 2 - T T T 3 - H * H 4 Then you DONT KNOW whether TM3(2) halts! The rules of REALITY are TM(2) halts or doesnt halt. So if you have *'s all over the HALT TABLE then TURING WINS!
[toc] | [prev] | [next] | [standalone]
| From | peteolcott <peterolcott2@gmail.com> |
|---|---|
| Date | 2017-11-21 06:48 -0800 |
| Message-ID | <4ab388ce-60dc-4c11-bd8b-829e47a5af74@googlegroups.com> |
| In reply to | #167165 |
On Monday, November 20, 2017 at 8:11:42 PM UTC-6, graham...@gmail.com wrote: > On Tuesday, November 21, 2017 at 12:55:42 AM UTC+11, peteolcott wrote: > > On Sunday, November 19, 2017 at 6:28:33 AM UTC-6, graham...@gmail.com wrote: > > > Defining Tarski’s ∀x True(x) ↔ φ(x) > > > ∀x True(x) ↔ ∃y Provable(y, x) // True entirely defined by Provability > > > ∀x False(x) ↔ ∃y Provable(y, ~x) // False entirely defined by Refutability > > > > > > > > > > > > tRY tHIS iN pROLOG! > > > > > > > > > b >= 0. > > > > > > > > > b+1 >= s+1 <- b >= s > > > > > > > > > > > > > > > EG > > > > > > 4>=2 IF 3>=1 > > > > > > 3>=1 IF 2>=0 > > > > > > > > > 3>=1 IF TRUE > > > > > > 4>=2 IF 3>=1 > > > > > > 4>=2 IF TRUE > > > > > > 4>=2 > > > > > > > > > > > > > > > Cycles in directed graphs of logical expressions are erroneous > > > http://liarparadox.org/index.php/2017/11/03/refuting-the-conclusion-of-godels-1931-incompleteness-theorem/ > > > > Currently I only know Prolog well enough to know that it detects the Pathological Self-Reference error (pete olcott 2004 comp.theory). > > https://groups.google.com/forum/#!original/comp.theory/RO9Z9eCabeE/Ka8-xS2rdEEJ > > > Thanks for the Link! > > > The prolog error you described which parses in most versions > The Prolog error that I described parses correctly in most versions only because detecting this error is turned off by default. unify_with_occurs_check/2 catches and reports the pathological self reference error. > > f(Q) UNIFY Q > > > is trying to UNIFY the 2 expressions... (see if they fit) > > u( X,X ) > u( Q,f(Q) ) > http://liarparadox.org/Prolog_Detects_Pathological_Self_Reference.pdf equal(X, X). ?- equal(foo(Y), Y). In this example, foo(Y) is matched against Y, which appears within it. As a result, Y will stand for foo(Y), which is foo(foo(Y)) (because of what Y stands for), which is foo(foo(foo(Y))), and so on. So Y ends up standing for some kind of infinite structure. > > > UNIFY is NOT equivalance > > > G <-> f(G) > > or > > G <- f(G) > > or > > G :- f(G) > > > is standard prolog recursion. > > > > > > > > > The Stanford University simplification of the 1931 Incompleteness Theorem has this error. > > > > > > [PO] > The primary benefit of solving the Halting Problem was to > detect programs that failed to halt, thus were incorrect. > Pathological self-reference can also be viewed as a form > of error. If the Halting Problem is redefined (which does not > refute anyone), then this redefined problem can be easily > solved. > > Now we have three possible correct results: > (a) Halts > (b) Does Not Halt > (c) Pathological Self Reference to Halt > > > > RIGHT! but that still doesn't solve whether a TURING MACHINE can input ANY PROGRAM,INPUT pair and return HALTS or NOT > > A TM has to INPUT a TM > > HOW do you solve _THAT_ self reference? > > I have spent at least 3000 hours on this since 2004. I don't want to work on it again until sometime after my refutation of the 1931 GIT is accepted as correct.
[toc] | [prev] | [next] | [standalone]
| From | Rupert <rupertmccallum@yahoo.com> |
|---|---|
| Date | 2017-11-20 14:14 -0800 |
| Message-ID | <3cdf26ed-a49a-4a18-904f-264ace2424b0@googlegroups.com> |
| In reply to | #167049 |
Peter Olcott: So Stafford University got it wrong? Me: No. They did not make the claim you attributed to them.
[toc] | [prev] | [next] | [standalone]
| From | peteolcott <peterolcott2@gmail.com> |
|---|---|
| Date | 2017-11-20 14:43 -0800 |
| Message-ID | <1215edaf-1e2b-492a-bac1-419d66ecd255@googlegroups.com> |
| In reply to | #167143 |
On Monday, November 20, 2017 at 4:14:59 PM UTC-6, Rupert wrote: > Peter Olcott: So Stafford University got it wrong? > > Me: No. They did not make the claim you attributed to them. Sure they did and here is where they did: https://plato.stanford.edu/entries/goedel-incompleteness/#FirIncTheCom
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2017-11-21 00:29 +0000 |
| Message-ID | <87d14ctqx8.fsf@bsb.me.uk> |
| In reply to | #167145 |
peteolcott <peterolcott2@gmail.com> writes: > On Monday, November 20, 2017 at 4:14:59 PM UTC-6, Rupert wrote: >> Peter Olcott: So Stafford University got it wrong? >> >> Me: No. They did not make the claim you attributed to them. > > Sure they did and here is where they did: > https://plato.stanford.edu/entries/goedel-incompleteness/#FirIncTheCom Rupert is a careful poster. The "no" was placed after this text: | Defining Tarski’s ∀x True(x) ↔ φ(x) | ∀x True(x) ↔ ∃y Provable(y, x) // True entirely defined by Provability | ∀x False(x) ↔ ∃y Provable(y, ~x) // False entirely defined by Refutability none of which can be found on that page. And since I'm posting, did you ever say what the binary Provable means? -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | peteolcott <peterolcott2@gmail.com> |
|---|---|
| Date | 2017-11-20 17:11 -0800 |
| Message-ID | <7f8c5039-b09b-4be9-ad6d-182bfe0be226@googlegroups.com> |
| In reply to | #167151 |
On Monday, November 20, 2017 at 6:29:43 PM UTC-6, Ben Bacarisse wrote: > peteolcott <peterolcott> writes: > > > On Monday, November 20, 2017 at 4:14:59 PM UTC-6, Rupert wrote: > >> Peter Olcott: So Stafford University got it wrong? > >> > >> Me: No. They did not make the claim you attributed to them. > > > > Sure they did and here is where they did: > > https://plato.stanford.edu/entries/goedel-incompleteness/#FirIncTheCom > > Rupert is a careful poster. The "no" was placed after this text: > > | Defining Tarski’s ∀x True(x) ↔ φ(x) > | ∀x True(x) ↔ ∃y Provable(y, x) // True entirely defined by Provability > | ∀x False(x) ↔ ∃y Provable(y, ~x) // False entirely defined by Refutability > > none of which can be found on that page. And since I'm posting, did you > ever say what the binary Provable means? > > -- > Ben. That is just my signature, Ben. It is also correct and indirectly relevant.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2017-11-21 01:44 +0000 |
| Message-ID | <877euktng0.fsf@bsb.me.uk> |
| In reply to | #167153 |
peteolcott <peterolcott2@gmail.com> writes: > On Monday, November 20, 2017 at 6:29:43 PM UTC-6, Ben Bacarisse wrote: >> peteolcott <peterolcott> writes: >> >> > On Monday, November 20, 2017 at 4:14:59 PM UTC-6, Rupert wrote: >> >> Peter Olcott: So Stafford University got it wrong? >> >> >> >> Me: No. They did not make the claim you attributed to them. >> > >> > Sure they did and here is where they did: >> > https://plato.stanford.edu/entries/goedel-incompleteness/#FirIncTheCom >> >> Rupert is a careful poster. The "no" was placed after this text: >> >> | Defining Tarski’s ∀x True(x) ↔ φ(x) >> | ∀x True(x) ↔ ∃y Provable(y, x) // True entirely defined by Provability >> | ∀x False(x) ↔ ∃y Provable(y, ~x) // False entirely defined by Refutability >> >> none of which can be found on that page. And since I'm posting, did you >> ever say what the binary Provable means? >> > > That is just my signature, Ben. Nothing prevents someone commenting on it. Anyway, it seems that was *not* the point Rupert was making. > It is also correct and indirectly relevant. As far as I know you have never answered the key questions that would let anyone know what it even means. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | peteolcott <peterolcott2@gmail.com> |
|---|---|
| Date | 2017-11-20 17:49 -0800 |
| Message-ID | <61d90b37-7a78-42d5-a174-65093d57ab00@googlegroups.com> |
| In reply to | #167157 |
On Monday, November 20, 2017 at 7:44:50 PM UTC-6, Ben Bacarisse wrote: > peteolcott <peterolcott> writes: > > > On Monday, November 20, 2017 at 6:29:43 PM UTC-6, Ben Bacarisse wrote: > >> peteolcott <peterolcott> writes: > >> > >> > On Monday, November 20, 2017 at 4:14:59 PM UTC-6, Rupert wrote: > >> >> Peter Olcott: So Stafford University got it wrong? > >> >> > >> >> Me: No. They did not make the claim you attributed to them. > >> > > >> > Sure they did and here is where they did: > >> > https://plato.stanford.edu/entries/goedel-incompleteness/#FirIncTheCom > >> > >> Rupert is a careful poster. The "no" was placed after this text: > >> > >> | Defining Tarski’s ∀x True(x) ↔ φ(x) > >> | ∀x True(x) ↔ ∃y Provable(y, x) // True entirely defined by Provability > >> | ∀x False(x) ↔ ∃y Provable(y, ~x) // False entirely defined by Refutability > >> > >> none of which can be found on that page. And since I'm posting, did you > >> ever say what the binary Provable means? > >> > > > > That is just my signature, Ben. > > Nothing prevents someone commenting on it. Anyway, it seems that was > *not* the point Rupert was making. > > > It is also correct and indirectly relevant. > > As far as I know you have never answered the key questions that would > let anyone know what it even means. > > -- > Ben. They are all answered here: http://LiarParadox.org // I have 3000 hours invested in these pages
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2017-11-21 12:30 +0000 |
| Message-ID | <871skru84e.fsf@bsb.me.uk> |
| In reply to | #167158 |
peteolcott <peterolcott2@gmail.com> writes: > On Monday, November 20, 2017 at 7:44:50 PM UTC-6, Ben Bacarisse wrote: >> peteolcott <peterolcott> writes: <snip> >> >> | Defining Tarski’s ∀x True(x) ↔ φ(x) >> >> | ∀x True(x) ↔ ∃y Provable(y, x) // True entirely defined by Provability >> >> | ∀x False(x) ↔ ∃y Provable(y, ~x) // False entirely defined by Refutability <snip> >> As far as I know you have never answered the key questions that would >> let anyone know what it even means. > > They are all answered here: > http://LiarParadox.org // I have 3000 hours invested in these pages That's fine. You are under no obligation to explain yourself here and it's much simpler for me to assume that the above formulas are similar to kind of poetic symbol noise you always used to post. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Pete Olcott <Pete@NoEmail.address> |
|---|---|
| Date | 2017-11-21 13:06 -0600 |
| Message-ID | <oc6dnTcNnta75InHnZ2dnUU7-WednZ2d@giganews.com> |
| In reply to | #167196 |
On 11/21/2017 6:30 AM, Ben Bacarisse wrote: > peteolcott <peterolcott2@gmail.com> writes: > >> On Monday, November 20, 2017 at 7:44:50 PM UTC-6, Ben Bacarisse wrote: >>> peteolcott <peterolcott> writes: > <snip> >>>>> | Defining Tarski’s ∀x True(x) ↔ φ(x) >>>>> | ∀x True(x) ↔ ∃y Provable(y, x) // True entirely defined by Provability >>>>> | ∀x False(x) ↔ ∃y Provable(y, ~x) // False entirely defined by Refutability > <snip> >>> As far as I know you have never answered the key questions that would >>> let anyone know what it even means. >> >> They are all answered here: >> http://LiarParadox.org // I have 3000 hours invested in these pages > > That's fine. You are under no obligation to explain yourself here and > it's much simpler for me to assume that the above formulas are similar > to kind of poetic symbol noise you always used to post. > I will no longer endlessly repeat myself to you. If you are not simply trolling go read what I have written. It took me 3000 hours to write it. It will take less than 2 hours to read it. -- Defining Tarski’s ∀x True(x) ↔ φ(x) ∀x True(x) ↔ ∃y Provable(y, x) // True entirely defined by Provability ∀x False(x) ↔ ∃y Provable(y, ~x) // False entirely defined by Refutability
[toc] | [prev] | [next] | [standalone]
| From | Pete Olcott <Pete@NoEmail.address> |
|---|---|
| Date | 2017-11-21 13:28 -0600 |
| Message-ID | <E4OdnQPlSLT644nHnZ2dnUU7-cWdnZ2d@giganews.com> |
| In reply to | #167228 |
On 11/21/2017 1:06 PM, Pete Olcott wrote: > On 11/21/2017 6:30 AM, Ben Bacarisse wrote: >> peteolcott <peterolcott2@gmail.com> writes: >> >>> On Monday, November 20, 2017 at 7:44:50 PM UTC-6, Ben Bacarisse wrote: >>>> peteolcott <peterolcott> writes: >> <snip> >>>>>> | Defining Tarski’s ∀x True(x) ↔ φ(x) >>>>>> | ∀x True(x) ↔ ∃y Provable(y, x) // True entirely defined by Provability >>>>>> | ∀x False(x) ↔ ∃y Provable(y, ~x) // False entirely defined by Refutability >> <snip> >>>> As far as I know you have never answered the key questions that would >>>> let anyone know what it even means. >>> >>> They are all answered here: >>> http://LiarParadox.org // I have 3000 hours invested in these pages >> >> That's fine. You are under no obligation to explain yourself here and >> it's much simpler for me to assume that the above formulas are similar >> to kind of poetic symbol noise you always used to post. >> > > I will no longer endlessly repeat myself to you. > If you are not simply trolling go read what I have written. > It took me 3000 hours to write it. It will take less than 2 hours to read it. > Only 22 pages of text altogether. -- Defining Tarski’s ∀x True(x) ↔ φ(x) ∀x True(x) ↔ ∃y Provable(y, x) // True entirely defined by Provability ∀x False(x) ↔ ∃y Provable(y, ~x) // False entirely defined by Refutability
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2017-11-22 01:31 +0000 |
| Message-ID | <87vai3rte0.fsf@bsb.me.uk> |
| In reply to | #167228 |
Pete Olcott <Pete@NoEmail.address> writes: > On 11/21/2017 6:30 AM, Ben Bacarisse wrote: >> peteolcott <peterolcott2@gmail.com> writes: >> >>> On Monday, November 20, 2017 at 7:44:50 PM UTC-6, Ben Bacarisse wrote: >>>> peteolcott <peterolcott> writes: >> <snip> >>>>>> | Defining Tarski’s ∀x True(x) ↔ φ(x) >>>>>> | ∀x True(x) ↔ ∃y Provable(y, x) // True entirely defined by Provability >>>>>> | ∀x False(x) ↔ ∃y Provable(y, ~x) // False entirely defined by Refutability >> <snip> >>>> As far as I know you have never answered the key questions that would >>>> let anyone know what it even means. >>> >>> They are all answered here: >>> http://LiarParadox.org // I have 3000 hours invested in these pages >> >> That's fine. You are under no obligation to explain yourself here and >> it's much simpler for me to assume that the above formulas are similar >> to kind of poetic symbol noise you always used to post. >> > > I will no longer endlessly repeat myself to you. As I said that's fine. I'm sure you've never told me the answer but it's crank 101 to say you've answered 100 times and I may have missed it. > If you are not simply trolling go read what I have written. > It took me 3000 hours to write it. It will take less than 2 hours to > read it. Ideally you would keep it all on the site. The bits the spill out onto Usenet raise questions. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | peteolcott <peterolcott2@gmail.com> |
|---|---|
| Date | 2017-11-21 17:53 -0800 |
| Message-ID | <b85f1d98-76dc-4094-aa66-c511df8532a0@googlegroups.com> |
| In reply to | #167247 |
On Tuesday, November 21, 2017 at 7:31:38 PM UTC-6, Ben Bacarisse wrote: > Pete Olcott writes: > > > On 11/21/2017 6:30 AM, Ben Bacarisse wrote: > >> peteolcott writes: > >> > >>> On Monday, November 20, 2017 at 7:44:50 PM UTC-6, Ben Bacarisse wrote: > >>>> peteolcott <peterolcott> writes: > >> <snip> > >>>>>> | Defining Tarski’s ∀x True(x) ↔ φ(x) > >>>>>> | ∀x True(x) ↔ ∃y Provable(y, x) // True entirely defined by Provability > >>>>>> | ∀x False(x) ↔ ∃y Provable(y, ~x) // False entirely defined by Refutability > >> <snip> > >>>> As far as I know you have never answered the key questions that would > >>>> let anyone know what it even means. > >>> > >>> They are all answered here: > >>> http://LiarParadox.org // I have 3000 hours invested in these pages > >> > >> That's fine. You are under no obligation to explain yourself here and > >> it's much simpler for me to assume that the above formulas are similar > >> to kind of poetic symbol noise you always used to post. > >> > > > > I will no longer endlessly repeat myself to you. > > As I said that's fine. I'm sure you've never told me the answer but > it's crank 101 to say you've answered 100 times and I may have missed > it. > > > If you are not simply trolling go read what I have written. > > It took me 3000 hours to write it. It will take less than 2 hours to > > read it. > > Ideally you would keep it all on the site. The bits the spill out onto > Usenet raise questions. > > -- > Ben. I am striving to make my words increasingly more clear through a dialogue. After I hit an increment of increased clarity I update the site. Even though I have spent 3000 hours on this since 16 months ago there are only about 22 pages on the site. A good chunk of this time was spent writing a Minimal Type Theory to Directed Acyclic Graph compiler.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2017-11-22 21:39 +0000 |
| Message-ID | <87k1yiro22.fsf@bsb.me.uk> |
| In reply to | #167248 |
peteolcott <peterolcott2@gmail.com> writes: <snip> > Even though I have spent 3000 hours on this since 16 months ago there > are only about 22 pages on the site. > > A good chunk of this time was spent writing a Minimal Type Theory to > Directed Acyclic Graph compiler. I'll wait for the peer-reviewed paper, but as a precaution, I won't hold my breath. -- Ben.
[toc] | [prev] | [next] | [standalone]
Page 1 of 4 [1] 2 3 4 Next page →
Back to top | Article view | sci.logic
csiph-web