Computability and logic.

Afficher d'autres versions (1)

Now in its fourth edition, this book has become a classic because it covers not simply the staple topics of intermediate logic courses but also a large number of other topics. John Burgess has enhanced the book by adding problems at the end of each chapter and by rewriting chapters.

Détails bibliographiques
Cote:Libro Electrónico
Auteur principal: Boolos, George
Autres auteurs: Burgess, John P., 1948-, Jeffrey, Richard C.
Format: Électronique eBook
Langue:Inglés
Publié: Cambridge ; New York : Cambridge University Press, 2002.
Édition:4th ed. /
Sujets:
Computable functions.
Recursive functions.
Logic, Symbolic and mathematical.
Fonctions calculables.
Fonctions récursives.
Logique symbolique et mathématique.
MATHEMATICS > Infinity.
MATHEMATICS > Logic.
Computable functions
Logic, Symbolic and mathematical
Recursive functions
Logik
Berechenbarkeit
Mathematische Logik
Logica.
Berekenbaarheid.
Accès en ligne:Texto completo
Table des matières:
  • Cover; Half-title; Title; Copyright; Dedication; Contents; Preface; Computability Theory; 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; Basic Metalogic; 9 A Précis of First-Order Logic: Syntax; 10 A Précis 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.

Documents similaires