Computability and logic
This fourth edition of one of the classic logic textbooks has been thoroughly revised by John Burgess. The aim is to increase the pedagogical value of the book for the core market of students of philosophy and for students of mathematics and computer science as well. This book has become a classic b...
| Otros Autores: | , , |
|---|---|
| Formato: | Libro electrónico |
| Idioma: | Inglés |
| Publicado: |
Cambridge :
Cambridge University Press
2002.
|
| Edición: | 4th ed |
| Colección: | CUP ebooks.
|
| Acceso en línea: | Conectar con la versión electrónica |
| Ver en Universidad de Navarra: | https://innopac.unav.es/record=b42023348*spi |
Tabla de Contenidos:
- 1. Enumerability
- 2. Diagonalization
- 3. Turing Computability
- 4. Uncomputability
- 5. Abacus Computability
- 6. Recursive Functions
- 7. Recursive Sets and Relations
- 8. Equivalent Definitions of Computability
- 9. A Precis of First-Order Logic: Syntax
- 10. A Precis of First-Order Logic: Semantics
- 11. The Undecidability of First-Order Logic
- 12. Models
- 13. The Existence of Models
- 14. Proofs and Completeness
- 15. Arithmetization
- 16. Representability of Recursive Functions
- 17. Indefinability, Undecidability, Incompleteness
- 18. The Unprovability of Consistency
- 19. Normal Forms
- 20. The Craig Interpolation Theorem
- 21. Monadic and Dyadic Logic
- 22. Second-Order Logic.
