Recursion theory for metamathematics
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 metamathem...
Autor principal: | |
---|---|
Formato: | Libro electrónico |
Idioma: | Inglés |
Publicado: |
New York :
Oxford University Press
1993.
|
Colección: | EBSCO Academic eBook Collection Complete.
Oxford logic guides ; 22. |
Acceso en línea: | Conectar con la versión electrónica |
Ver en Universidad de Navarra: | https://innopac.unav.es/record=b31846543*spi |
Sumario: | 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.℗¡ |
---|---|
Descripción Física: | xiv, 163 p. |
Formato: | Forma de acceso: World Wide Web. |
Bibliografía: | Incluye referencias bibliográficas (p. 159-160) e índice. |
ISBN: | 9781423734543 9781602566224 |