User loginNavigation |
Goedel's Theorem and Theories of Arithmetic
Logic is the cornerstone of computer science in general and much of programming language theory in particular. Goedel's results are fundamental for any real understanding of modern logic.
This book by Peter Smith might serve as an introduction to Goedel's incompleteness results. Twelve chapters are online, and seem quite readable. |
Browse archives
Active forum topics |
Recent comments
24 weeks 5 days ago
24 weeks 5 days ago
24 weeks 5 days ago
46 weeks 6 days ago
51 weeks 1 day ago
1 year 4 days ago
1 year 4 days ago
1 year 3 weeks ago
1 year 8 weeks ago
1 year 8 weeks ago