Recursion theory for metamathematics
Our rough guess is there are 40,750 words in this book.
At a pace averaging 250 words per minute, this book will take 2 hours and 43 minutes to read. With a half hour per day, this will take 6 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
We earn a commission on purchases
Author
Publication
1993 - Oxford University Press, New York, New York (State)
Language
English
Word Count
40,750 words, Guess
Page Count
163 pages
Identifiers
- Open LibraryOL1735523M
- ISBN-10019508232X
- OCLC Control Number26974961
- OCLC Control Numberrecursiontheoryf00smul_982
- Library of Congress Control Number92040495
and 2 more
- Goodreads1881966
- LibraryThing360422
Classifications
- DDC511.3/5
- LCCQA9.6 .S68 1993
Description
"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"--Publisher's description.
Subjects
Topics
Series Statement
- Oxford logic guides ;
Other Editions
- Recursion theory for metamathematics
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!