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.

Recall that in Part 4: Creating a special number relationship that if we can say:

*‘ Sequence A is the proof of sentence B’*

then if NumberA is the matching Gödel number for sequence A, and NumberB is the matching Gödel number for sentence B, there’s a matching relationship which says:

*‘ NumberA is the G‑proof of NumberB’*

Now, the relationship G‑proof is a number relationship, so that the expression *‘ NumberA is the G‑proof of NumberB’* is also a number relationship, since it deals with nothing but numbers. If NumberB isn’t the Gödel number of any formal sentence, then obviously there can’t be a G‑proof of NumberB. But if it is the Gödel number of a formal sentence and it’s a valid formal sentence, then it’s possible that there could be a formal proof of that sentence, so it’s possible there could be a number that is the G‑proof of NumberB. That means that there can be a number relationship that says:

*‘There is a number that is the G‑proof of NumberB’*

Now, if NumberB is the Gödel number of a formal sentence B, either there is a proof of the formal sentence B or there isn’t. As long as we’ve defined it properly, then it’s obvious that the number relationship, *‘There is a number that is the G‑proof of NumberB’* has to be either true or false. If it’s false, then the converse is true, and the converse is

Recall that Part 5: Getting a number relationship to correspond to the concept of substitution was that a number relationship can be defined that precisely matches the concept of the substitution of a variable in a formal sentence by a particular number. We called it

**G‑Substitution ****(****Number1, Number2****)**

and which means the equivalent of substituting the free variable of a formal sentence by a number.

Gödel uses that concept of substitution. He takes a number relationship, and by a bit of clever manipulation which involves substituting the number relationship by its own matching Gödel number, he ends up with a new relationship which appears to refer to itself by its own Gödel number.

The first step in getting there is to define a relationship as:

*‘There is no G‑proof of*

This relationship isn’t a number relationship since it includes the Gödel numbering function ** GN(x)**. Because we want to end up with a number relationship that says essentially the same thing, we define another number relationship as:

*‘There is no G‑proof of*

Here we’ve used the Basic Numbering function BN instead of the Gödel numbering function GN. For short we call this relationship RS, so that ** RS(x)** means the same as

** RS(x)** is a number relationship, since it is defined only in terms of numbers and variables for numbers.

Now, since it’s a number relationship, there’ll be a corresponding formal sentence for this relationship. Since we called this relationship RS, I’m going to call this formal sentence FS. And for this formal sentence FS there’ll be a corresponding Gödel number, which I’m going to call GS.

At this point it can start to get confusing, so if you are at all unclear at this stage, you need to go back and read over it again. Remember that we have three matching items:

- the number relationship RS,
- the matching formal sentence FS,
- the matching Gödel number GS.

Each of these are all essentially referencing the same thing. You just have to remember that RS and FS both have a free variable, whereas GS, since it’s only a number, has no free variable.

Gödel’s trick at this stage is to substitute the free variable of the number relationship RS by the number GS. This is really the substitution of the free variable of the number relationship RS by its own matching Gödel number. That results in another number relationship, which is:

*‘There is no G‑proof of *

For short we can call this number relationship ** RS(GS)**, so

For this number relationship ** RS(GS)**, there is a corresponding formal language sentence, which we’ll call

We suppose for the moment that there a proof of ** FS(GS)** in the formal language. In that case, the corresponding number relationship, which is

*‘There is no G‑proof of *

Now if that really is true, then that means there can’t be any proof of the formal sentence where the free variable of the formal sentence FS is substituted by the number GS; that is the same as saying that there is no formal proof of ** FS(GS)**. But now we’ve got a contradiction. We started off supposing that there is a formal proof of

We arrived at a contradiction because we initially supposed that there is a formal proof of the formal sentence ** FS(GS)**, which is the sentence you get when you substitute the free variable of the sentence FS by the number GS. That means that supposition must be wrong. That means that there can’t be a formal proof of

Now, the number relationship that expresses the same concept as that formal sentence, the number relationship that is ** RS(GS)** actually states:

*‘There is no G‑proof of*

The only possible conclusion is that that number relationship is true (if the formal language system is consistent), but there cannot be any proof of that statement in the formal language.

And that completes our simplified version of Gödel’s proof of his incompleteness theorem.

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 …

There is now a new page Halbach and Zhang’s *Yablo without Gödel* which demonstrates the illogical assumptions used by Halbach and Zhang.

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.

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?

31 Mar 2015 Cranks and Crackpots

16th Mar 2015 Bishops Dancing with Pixies?

23rd Feb 2015 Artificial Intelligence

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