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
39 weeks 4 hours ago
39 weeks 8 hours ago
39 weeks 8 hours ago
1 year 9 weeks ago
1 year 13 weeks ago
1 year 14 weeks ago
1 year 14 weeks ago
1 year 17 weeks ago
1 year 22 weeks ago
1 year 22 weeks ago