Graduate studies at Western
|Abstract||Herein is presented a natural first-order arithmetic system which can prove its own consistency, both in the weaker Godelian sense using traditional Godel numbering and, more importantly, in a more robust and direct sense; yet it is strong enough to prove many arithmetic theorems, including the Euclidean Algorithm, Quadratic Reciprocity, and Bertrand’s Postulate.|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Only published papers are available at libraries|
Similar books and articles
H. Jerome Keisler (2006). Nonstandard Arithmetic and Reverse Mathematics. Bulletin of Symbolic Logic 12 (1):100-125.
Sergei Artëmov & Franco Montagna (1994). On First-Order Theories with Provability Operator. Journal of Symbolic Logic 59 (4):1139-1153.
Leszek Aleksander Kołodziejczyk (2006). On the Herbrand Notion of Consistency for Finitely Axiomatizable Fragments of Bounded Arithmetic Theories. Journal of Symbolic Logic 71 (2):624 - 638.
Dan E. Willard (2002). How to Extend the Semantic Tableaux and Cut-Free Versions of the Second Incompleteness Theorem Almost to Robinson's Arithmetic Q. Journal of Symbolic Logic 67 (1):465-496.
Added to index2011-11-12
Total downloads33 ( #42,031 of 739,360 )
Recent downloads (6 months)1 ( #61,680 of 739,360 )
How can I increase my downloads?