Imagen de Amazon.com
Portada de Syndetics
Imagen de OpenLibrary
Computability and logic George S. Boolos, Richard C. Jeffrey.
Detalles de publicación: Cambridge New York Cambridge University Press 1989.Descripción: x, 304 p. illISBN:- 052138026X
- 0521389232 (pbk.)
- 511.3 20
- QA9.59 .B66 1989
| Imagen de cubierta | Tipo de ítem | Biblioteca actual | Biblioteca de origen | Colección | Ubicación en estantería | Signatura topográfica | Materiales especificados | Info Vol | URL | Copia número | Estado | Notas | Fecha de vencimiento | Código de barras | Reserva de ítems | Prioridad de la cola de reserva de ejemplar | Reservas para cursos | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Libro | Biblioteca Encarnación Valdés Colección General bev | 511.3 B724c (Navegar estantería(Abre debajo)) | Disponible | 80000001868200 |
Total de reservas: 0
Descripciones mejoradas de Syndetics:
A text for a second course in logic for graduate and advanced undergraduate students. This third edition has been corrected and contains thoroughly revised versions of the chapters on Ramsey and provability, with new exercises provided for three other chapters. There are also two new chapters dealing with undecidable sentences and on the non-existence of non-standard recursive models of Z.
Includes bibliographical references and index.
Tabla de contenidos provista por Syndetics
- Part I 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
- Part II Basic Metalogic
- 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
- Further topics
- 19 Normal forms
- 20 The Craig interpolation theorem
- 21 Monadic and dyadic logic
- 22 Second-order logic
- 23 Arithmetical definability
- 24 Decidability of arithmetic without multiplication
- 25 Non-standard models
- 26 Ramsey's theorem
- 27 Modal logic and provability