More From This User
Just - Discovering Modern Set Theory I - The Basics (1996, 226pp) A...
Nice introduction to the world of infinite.
G¨odel’s Theoremsand Theories of Arithmetic
Peter Smith
Faculty of PhilosophyUniversity of Cambridge
Version date: July 31, 2004Copyright:c
2004 Peter SmithNot to be cited or quoted without permissionThe book’s website is at
www.godelbook.net
Contents
Preface iii
Part I Introducing Incompleteness 1
1 What G¨odel’s First Theorem Says 31.1 Incompleteness and basic arithmetic 31.2 Why it matters 51.3 What’s next? 72 The Idea of an Axiomatized Formal Theory 82.1 Formalization as an ideal 82.2 Formal axiomatized theories 102.3 Decidability 122.4 Enumerable sets 152.5 More definitions 172.6 Three simple results 182.7 Negation complete theories are decidable 203 Capturing Numerical Properties 223.1 Remarks on notation 223.2 Standard arithmetical languages 233.3 Expressing numerical properties and relations 253.4 Case-by-case capturing 263.5 A note on our jargon 284 Sufficiently Strong Arithmetics 294.1 The idea of a ‘sufficiently strong’ theory 294.2 An undecidability theorem 304.3 An incompleteness theorem 314.4 But what have we really shown? 33
Part II Arithmetics and Primitive Recursion 35
5 Four Formalized Arithmetics 375.1
BA
– Baby Arithmetic 375.2
Q
– Robinson Arithmetic 40
i
of 00
2.6 Three simple results for Kurt Gödel's Theorems And Theories Of Arithmetic (2004)
2,171 Reads
Info and Rating
| Category: | |
| Rating: | |
| Upload Date: | 10/17/2009 |
| Copyright: | Attribution Non-commercial |
| Tags: |
Leave a Comment
George S. Boolos, John P. Burgess, Richard C. Jeffrey - Computability and logic in http://avaxhome.ws/ebooks/science_boo... just because sometimes scribd doesn't allow sharing.