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.

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

SITEMAP

LL: Logic & Language Home Page

 

Incompleteness

LL: Gödel’s Incompleteness Theorem

 

LL: English Translation of Gödel’s Incompleteness Proof (html)

LL: English Translation of Gödel’s Incompleteness Proof (PDF)

 

 

 

 

LL: Errors in Incompleteness Proofs

LL: Analysis of Incompleteness Proofs

 

Paper: The Impossibility of Representation of a Gödel Numbering Function by a Formula of the Formal System (PDF)

Paper: A Fundamental Flaw in an Incompleteness Proof by Peter Smith (PDF)

Paper: previous v1: A Fundamental Flaw in an Incompleteness Proof by Peter Smith (PDF)

Paper: A Fundamental Flaw in Incompleteness Proofs by S. C. Kleene (PDF)

Paper: A Fundamental Flaw in Incompleteness Proofs by Gregory Chaitin (PDF)

Paper: A Fundamental Flaw in an Incompleteness Proof by George Boolos (PDF)

Paper: A Fundamental Flaw in an Incompleteness Proof by Stanisław Świerczkowski (PDF)

Paper, previous v1: A Fundamental Flaw in an Incompleteness Proof by Stanisław Świerczkowski (PDF)

Paper: An Error in a Computer Verified Proof of Incompleteness by John Harrison (PDF)

Paper: An Error in a Computer Verified Proof of Incompleteness by Russell O’Connor (PDF)

Paper previous v1: An Error in a Computer Verified Proof of Incompleteness by Russell O’Connor (PDF)

Paper: An Error in a Computer Verified Proof of Incompleteness by Natarajan Shankar (PDF)

 

LL: Responses to the demonstration of the flaw in Gödel’s proof

 

LL: Nagel & Newman

LL: Gödel, Escher, Bach

 

LL: The Diagonal Lemma

LL: Gödel’s Substitution Function

LL: Representability

LL: The Halting Problem and Incompleteness Proofs

LL: Church’s “An Unsolvable Problem”

LL: Yet Another Flawed Incompleteness Proof

 

LL: Intuitionism

LL: True but unprovable

 

LL: Gödel, Minds, and Machines

LL: Gödel links

 

LL: World’s shortest explanation of Gödel’s Proof?

LL: Review by Russell O’Connor of the paper demonstrating the flaw in Gödel’s proof

LL: How to show how a disproof of Gödel’s proof is wrong - if it really is

LL: On web forums and Gödel’s proof

 

The Infinite

 

Paradoxes

 

Other Topics

 

Books

 

Miscellaneous

 

Blog Archive

 

Other Stuff

 

NEWS

Lebesgue Measure

There is now a new page on Lebesgue measure theory and how it is contradictory.

 

 

Illogical Assumptions

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

 

 

Peter Smith’s ‘Proof’

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.

 

 

Easy Footnotes

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).

 

 

O’Connor’s “computer checked” proof

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.

 

 

New page on Chaitin’s Constant

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.

 

Previous Blog Posts  

 

13 May 2015 Good Math, Bad Math?

 

30 Apr 2015 The Chinese Room

 

31 Mar 2015 Cranks and Crackpots

 

16th Mar 2015 Bishops Dancing with Pixies?

 

23rd Feb 2015 Artificial Intelligence

 

Links  

 

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:

Gödel Links

 

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

Gödel, Minds, and Machines

 

Printer Friendly

 

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

 

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