Computability and logic
George S. Boolos, John P. Burgess, Richard C. Jeffrey
Résumé
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 because of its accessibility to students without a mathematical background, and because it covers not simply the staple topics of an intermediate logic course such as Gödel's Incompleteness Theorems, but also a large number of optional topics from Turing's theory of computability to Ramsey's theorem. John Burgess has now enhanced the book by adding a selection of problems at the end of each chapter, and by reorganising and rewriting chapters to make them more independent of each other and thus to increase the range of options available to instructors as to what to cover and what to defer.
Contents
Part I. Computability Theory
- Enumerability
- Diagonalization
- Turing computability
- Uncomputability
- Abacus computability
- Recursive functions
- Recursive sets and relations
- Equivalent definitions of computability
Part II. Basic Metalogic
- A precis of first-order logic: syntax
- A precis of first-order logic: semantics
- The undecidability of first-order logic
- Models
- The existence of models
- Proofs and completeness
- Arithmetization
- Representability of recursive functions
- Indefinability, undecidability, incompleteness
- The unprovability of consistency
Part III. Further topics
- Normal forms
- The Craig interpolation theorem
- Monadic and dyadic logic
- Second-order logic
- Arithmetical definability
- Decidability of arithmetic without multiplication
- Nonstandard models
- Ramsey's theorem
- Modal logic and provability.
L'auteur - John P. Burgess
Autres livres de John P. Burgess
Caractéristiques techniques
PAPIER | |
Éditeur(s) | Cambridge University Press |
Auteur(s) | George S. Boolos, John P. Burgess, Richard C. Jeffrey |
Parution | 30/10/2002 |
Édition | 4eme édition |
Nb. de pages | 368 |
Format | 18 x 25,2 |
Couverture | Broché |
Poids | 663g |
Intérieur | Noir et Blanc |
EAN13 | 9780521007580 |
ISBN13 | 978-0-521-00758-0 |
Avantages Eyrolles.com
Nos clients ont également acheté
Consultez aussi
- Les meilleures ventes en Graphisme & Photo
- Les meilleures ventes en Informatique
- Les meilleures ventes en Construction
- Les meilleures ventes en Entreprise & Droit
- Les meilleures ventes en Sciences
- Les meilleures ventes en Littérature
- Les meilleures ventes en Arts & Loisirs
- Les meilleures ventes en Vie pratique
- Les meilleures ventes en Voyage et Tourisme
- Les meilleures ventes en BD et Jeunesse
- Informatique Développement d'applications Techniques de programmation Logique
- Sciences Mathématiques Mathématiques par matières Algèbre Cours
- Sciences Mathématiques Mathématiques par matières Algèbre Exercices
- Sciences Mathématiques Mathématiques par matières Logique
- Sciences Mathématiques Mathématiques par matières Logique Logique floue
- Sciences Mathématiques Mathématiques par matières Logique Algèbre de Boole
- Sciences Mathématiques Mathématiques par matières Théorie des ensembles
- Sciences Etudes et concours Classes préparatoires et grandes écoles - Livres classes prépas scientifiques Mathématiques