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 archivesActive forum topicsNew forum topics
|
Recent comments
1 day 6 hours ago
1 day 7 hours ago
1 day 19 hours ago
1 day 19 hours ago
2 days 7 hours ago
2 days 21 hours ago
2 weeks 5 days ago
2 weeks 5 days ago
3 weeks 5 days ago
3 weeks 6 days ago