Return to search

Remarks on formalized arithmetic and subsystems thereof

In a famous paper of 1931, Gödel proved that any formalization of elementary Arithmetic is incomplete, in the sense that it contains statements which are neither provable nor disprovable. Some two years before this, Presburger proved that a mutilated system of Arithmetic, employing only addition but not multiplication, is complete. This essay is partly an exposition of a system such as Presburger's, and partly an attempt to gain insight into the source of the incompleteness of Arithmetic, by linking Presburger's result with Gödel's.

Identiferoai:union.ndltd.org:netd.ac.za/oai:union.ndltd.org:rhodes/vital:5424
Date January 1975
CreatorsBrink, C
PublisherRhodes University, Faculty of Science, Mathematics
Source SetsSouth African National ETD Portal
LanguageEnglish
Detected LanguageEnglish
TypeThesis, Masters, MSc
Format119 pages, pdf
RightsBrink, C

Page generated in 0.0018 seconds