A Simple Character String Proof of the "True but Unprovable" Version of Gödel's First Incompleteness Theorem
A rather easy yet rigorous proof of a version of Gödel's first incompleteness theorem is presented. The version is ``each recursively enumerable theory of natural numbers with 0, 1, +, *, =, logical and, logical not, and the universal quantifier either proves a false sentence or fails to prove...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2014-05-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1402.7253v2 |