HackerPapers

arXiv:1512.03667math.LO

An Intuitively Complete Analysis of Godel's Incompleteness

Jason W. Steinmetz

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

Abstract

A detailed and rigorous analysis of Gödel's proof of his first incompleteness theorem is presented. The purpose of this analysis is two-fold. The first is to reveal what Gödel actually proved to provide a clear and solid foundation upon which to base future research. The second is to construct a coherent explication of Gödel's proof that is not only approachable by the non-specialist, but also brings to light the core principles underlying Gödel's proof.

arXiv comments
31 pages plus 2 appendices. In v2 multiple minor clarifications were made, two errors were fixed, and PDF bookmarks were added
Journal reference
DOI
Subjects
math.LOLogic cs.LOLogic in Computer Science

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from Dec 2018 to Dec 2018. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.