Recursion Theory for Metamathematics

Oxford, England: Oxford University Press (1993)
  Copy   BIBTEX

Abstract

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 74,247

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
49 (#236,849)

6 months
1 (#415,205)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

References found in this work

No references found.

Add more references