| Description |
1 online resource (xiv, 163 pages). |
| Physical Medium |
polychrome |
| Description |
text file |
| Series |
Oxford logic guides ; 22
|
|
Oxford logic guides ; 22.
|
| Bibliography |
Includes bibliographical references (pages 159-160) and index. |
| Contents |
0 Prerequisites; I: Recursive Enumerability and Recursivity; II: Undecidability and Recursive Inseparability; III: Indexing; IV: Generative Sets and Creative Systems; V: Double Generativity and Complete Effective Inseparability; VI: Universal and Doubly Universal Systems; VII: Shepherdson Revisited; VIII: Recursion Theorems; IX: Symmetric and Double Recursion Theorems; X: Productivity and Double Productivity; XI: Three Special Topics; XII: Uniform Gödelization; References; Index. |
| Summary |
This work is a sequel to the author's Godel's Incompleteness Theorems, though it can be read independently by anyone familiar with Godel's incompleteness theorem for Peano arithmetic. The book deals mainly with those aspects of recursion theory that have applications to the metamathematics of incompleteness, undecidability, and related topics. It is both an introduction to the theory and a presentation of new results in the field.℗¡ |
| Local Note |
eBooks on EBSCOhost EBSCO eBook Subscription Academic Collection - North America |
| Subject |
Recursion theory.
|
|
Recursion theory. |
|
Logic, Symbolic and mathematical.
|
|
Logic, Symbolic and mathematical. |
| Indexed Term |
Mathematical logic |
| Genre/Form |
Electronic books.
|
| Other Form: |
Print version: Smullyan, Raymond M. Recursion theory for metamathematics. New York : Oxford University Press, 1993 (DLC) 92040495 |
| ISBN |
1423734548 (electronic book) |
|
9781423734543 (electronic book) |
|
1602566224 |
|
9781602566224 |
|
019508232X (acid-free) |
|
