Tous nos rayons

Déjà client ? Identifiez-vous

Mot de passe oublié ?

Nouveau client ?

CRÉER VOTRE COMPTE
Computability and logic
Ajouter à une liste

Librairie Eyrolles - Paris 5e
Indisponible

Computability and logic

Computability and logic

George S. Boolos, John P. Burgess, Richard C. Jeffrey

368 pages, parution le 30/10/2002 (4eme édition)

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

Livraison à partir de 0,01 en France métropolitaine
Paiement en ligne SÉCURISÉ
Livraison dans le monde
Retour sous 15 jours
+ d'un million et demi de livres disponibles
satisfait ou remboursé
Satisfait ou remboursé
Paiement sécurisé
modes de paiement
Paiement à l'expédition
partout dans le monde
Livraison partout dans le monde
Service clients sav@commande.eyrolles.com
librairie française
Librairie française depuis 1925
Recevez nos newsletters
Vous serez régulièrement informé(e) de toutes nos actualités.
Inscription