Godel's incompleteness theorems

Publication Year:
2011
Usage 157
Downloads 101
Abstract Views 56
Repository URL:
http://dc.ewu.edu/theses/3
Author(s):
Dickson, Jessica
Tags:
Logic; Symbolic and mathematical; Gödel's theorem; Proof theory; Physical Sciences and Mathematics
thesis / dissertation description
"Incompleteness or inconsistency? Kurt Godel shocked the mathematical community in 1931 when he proved any effectively generated, sufficiently complex, and sound axiomatic system could not be both consistent and complete. This thesis will explore two formal languages of logic and their associated mechanically recursive proof methods with the goal of proving Godel's Incompleteness Theorems. This, in combination with an assignment of a natural number to every string of an axiomatic system, will be used to show a consistent system contains a true statement of the form "This sentence is unprovable," and a complete system contains a proof of its own consistency only if it is inconsistent"--Document.