Logic and Language

Logic and Language

Copyright © James R Meyer 2012 - 2017 www.jamesrmeyer.com

This page is keyboard accessible:

• Use**Tab**, **Shift + Tab **keys to traverse the main menu. To enter a sub-menu use the **Right Arrow** key. To leave a sub-menu use the **Left Arrow** or the **Escape** key.

• The**Enter** or the **Space** key opens the active menu item.

• To skip the menu and move to the main content, press**Tab** after the page loads to reveal a skip button.

• To get back to the top of the page anytime, press the**Home** key.

• For more information, click here: Accessibility Close this tip.

• Use

• The

• To skip the menu and move to the main content, press

• To get back to the top of the page anytime, press the

• For more information, click here: Accessibility Close this tip.

Note: Full functionality of this web page requires JavaScript to be enabled in your browser.

This page was written to show how easy it can be to show an error in a claim that Gödel’s incompleteness proof is flawed - that is, of course, if the claim is wrong. So on this page we look at a paper that claims that Gödel’s proof is flawed, and it is explained why the paper is erroneous.

That paper has been provided by a certain Colin Dean, and can be viewed online Gödel’s incompleteness theorem ends in absurdity or meaninglessness - Dean: here PDF.

It has to be said that Dean’s presentation does not help his case, being amateurish in layout, with his comments, arguments, conclusions and references all thrown together in a haphazard fashion, with numerous repetitions.

But here we are interested not in the presentation, but in the argument within it. When we get to page 36 we discover that Dean thinks Gödel’s proof is wrong for six reasons that he gives as:

- Gödel uses the axiom of reducibility
- Gödel uses the axiom of choice
- Gödel constructs impredicative statements
- Gödel miss uses (sic) the theory of types
- Gödel cannot tell us what makes mathematical statements true
- Gödel falls into 3 paradoxes

These are easily shown to be wrong, as follows:

Dean’s principal argument is based on the fact that Gödel’s proof is a proof regarding the particular formal system P that Gödel devised, essentially using the axioms of Peano arithmetic and the concepts behind Bertrand Russell’s Principia Mathematica. (Footnote: Russell, Bertrand, and Alfred North Whitehead, “*Principia Mathematica*”; 3 Volumes, 1910, 1912, and 1913, Cambridge University Press.)

As Dean points out, that formal system involves certain axioms; the one that concerns him here is the axiom of reducibility. Dean then argues that since one could give reasons why one should not necessarily accept that axiom, then one should not accept Gödel’s proof.

The problem with that argument is that Gödel simply devised that formal system P in order to demonstrate the essence of his argument. There is no reason in principle why Gödel’s argument could not be applied to other formal systems, which need not have that axiom.

The important point to observe is that the core of Gödel’s argument is based on the formal system being able to express straightforward relationships between numbers; those relationships do not require the axiom of reducibility that Dean refers to. Hence there is no reason to accept Dean’s argument that the axiom invalidates Gödel’s proof.

Dean refers to Gödel ‘using’ the axiom of choice, and quotes Gödel as saying:

*This allows one, for example, to conclude that even with the help of the axiom of choice (for all types), or the generalized continuum hypothesis, not all propositions are decidable…*

Dean is way off the track here. What Gödel said does not mean that Gödel has used the axiom of choice to obtain his result. What Gödel meant was that his proof of incompleteness could be generalised to apply to every formal system which includes a certain amount of arithmetic, even if one was allowed to use the axiom of choice in that formal system.

Dean’s argument here appears to be saying that since Gödel used the axiom of induction in his formal system, and that the axiom of induction is unacceptable, therefore we should reject Gödel’s argument. The problem with that assertion is that if you reject the idea of the axiom of induction in some shape or form you have to reject a huge chunk of mathematics. For example, Euclid’s proof that the number of prime numbers is infinite used the axiom of induction.

On that account Dean’s argument here simply cannot be taken seriously

This is basically the same as Reason 1, except that Dean’s complaint is that Gödel uses Russell’s theory of types in his formal system P. The reason why this cannot be considered to invalidate Gödel’s proof is the same – there is no reason in principle why Gödel’s argument could not be applied to other formal systems which do not use Russell’s theory of types.

Dean claims that Gödel’s proof does not tell us, in Dean’s words, “what makes a statement true”. But that is completely irrelevant, since Dean does not even start to suggest how Gödel’s failure to tell us “what makes a statement true” demonstrates any error in Gödel’s argument.

Dean states as his sixth reason that Gödel’s proof ‘falls into’ 3 paradoxes:

They are, according to Dean:

- The first paradox, according to Dean, is that:
*‘[Gödel] says every formal system which satisfies assumption 1 and 2 ie based upon axioms - but [Gödel] said undecidablity (sic) is independent of axioms’*Here Gödel simply means that, regardless of what specific axioms the formal system uses, if those axioms are recursively definable (along with some other conditions) then there will be undecidable statements in that system. There isn’t any contradiction there.

- The second paradox, according to Dean, is that:
*Undecidability is independent on nature of [Gödel’s formal system], yet is dependent on the nature of [Gödel’s formal system].’*This is essentially stating the same as the above and the rejoinder is the same.

- The third paradox, according to Dean, is that:
*[Gödel’s formal system] is used to prove that a system has statements which cannot be proven true or false, but**[Gödel’s formal system] can only prove this if all its statement (sic) can be proven to be true, but**[Gödel’s formal system] has statements which cannot be proven true or false**thus it cant (sic) prove anything but it is used to prove if systems are undecidadble (sic) thus a paradox*Here Dean is simply wrong. Even assuming that he actually meant that Gödel’s formal system must be able to prove all its statements either true or false, there is no requirement in Gödel’s proof that that should be the case.

As well as the errors already noted, Dean makes several other errors, for example:

He claims that Gödel specifies that he uses the Zermelo axioms. In point of fact, Gödel does not claim to use the Zermelo axioms in generating his result of an ‘unprovable’ statement for the formal system P referred to in the proof.

What Gödel actually claims is that the result of the proof can be extended to include all formal systems that satisfy certain conditions – which he says, includes the Zermelo-Frankl axioms. And that simply means that Gödel is claiming that formal systems that are based on the Zermelo-Frankl axioms satisfy the conditions that Gödel stated; it does not mean that Gödel used those axioms to produce his result – he didn’t.

In the above it becomes apparent that Dean does not appreciate the difference between finding a fundamental flaw in a proof and quibbling over parts of a proof that can easily be sidestepped by a simple rewriting of the proof. No-one is going to accept such quibbles as a genuine flaw in a proof. To demonstrate an error in a proof, you must show that there is an error that is fundamentally inherent to the argument of the proof, so that there is no way of simply rewriting the proof to avoid the problem.

Finally, it was not at all difficult to demonstrate the errors in Dean’s claim that he has found errors in Gödel’s proof. So why should it be so difficult for any competent mathematician to do the same for the paper on the flaw in Gödel’s proof (PDF) - which has a similar word count?

Footnotes:

Diverse opinions and criticisms are welcome, but messages that are frivolous, irrelevant or devoid of logical basis will be blocked (comments will be checked before appearing on this site). Difficulties in understanding the site content are usually best addressed by contacting me by e-mail. Note: you will be asked to provide an e-mail address - this will only be used to notify you of replies to your comments - it will never be used for any other purpose, will never be displayed and does not require verification. Comments are common to the entire website, so please indicate what section of the site you are commenting on.

If you cannot see any comments below, it may be that a plug-in on your browser is blocking Disqus comments from loading. Avast anti-virus in particular is known to do this, especially with Internet Explorer and Safari. See Disqus Browser plug-in/extension conflicts or Why isn’t the comment box loading?.

Please wait for comments to load …

It has come to my notice that, when asked about the demonstration of the flaw in his proof (see A Fundamental Flaw in an Incompleteness Proof by Peter Smith PDF), Smith refuses to engage in any logical discussion, and instead attempts to deflect attention away from any such discussion. If any other reader has tried to engage with Smith regarding my demonstration of the flaw, I would be interested to know what the outcome was.

There is a new addition to the page Yet another flawed incompleteness proof, where Berto’s proof of incompleteness in his book *There’s something about Gödel* comes under scrutiny.

I found that making, adding or deleting footnotes in the traditional manner proved to be a major pain. So I developed a different system for footnotes which makes inserting or changing footnotes a doddle. You can check it out at Easy Footnotes for Web Pages (Accessibility friendly).

I have now added a new section to my paper on Russell O’Connor’s claim of a computer verified incompleteness proof. This shows that the flaw in the proof arises from a reliance on definitions that include unacceptable assumptions - assumptions that are not actually checked by the computer code. See also the new page Representability.

There is now a new page on Chaitin’s Constant (Chaitin’s Omega), which demonstrates that Chaitin has failed to prove that it is actually algorithmically irreducible.

13 May 2015 Good Math, Bad Math?

16th Mar 2015 Bishops Dancing with Pixies?

23rd Feb 2015 Artificial Intelligence

31 Mar 2015 Cranks and Crackpots

For convenience, there are now two pages on this site with links to various material relating to Gödel and the Incompleteness Theorem

– a page with general links:

– and a page relating specifically to the Gödel mind-machine debate:

All pages on this website are printer friendly, and will print the main content in a convenient format. Note that the margins are set by your browser print settings.

Note: for some browsers JavaScript must be enabled for this to operate correctly.

Comments on this site are welcome, please see the comment section.

Please note that this web site, like any other is a collection of various statements. Not all of this web site is intended to be factual. Some of it is personal opinion or interpretation.

If you prefer to ask me directly about the material on this site, please send me an e-mail with your query, and I will attempt to reply promptly.

Feedback about site design would also be appreciated so that I can improve the site.

Copyright © James R Meyer 2012 - 2017

www.jamesrmeyer.com