Computability and logic.
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.
Основен автор: | Boolos, George. |
---|---|
Други автори: | Burgess, John P., 1948-, Jeffrey, Richard C. |
Формат: | Електронна книга |
Език: | English |
Публикувано: |
Cambridge ; New York :
Cambridge University Press,
2002.
|
Издание: | 4th ed. / |
Предмети: | |
Онлайн достъп: |
http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=125077 |
Подобни документи: |
Print version::
Computability and logic. |
Съдържание:
- 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 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.