Recursion theory for metamathematics
More from Oxford logic guides ;
Minsik users reviews
0.0 (0)
Other platforms reviews
0.0 (0)
163 pages
~2h 43min to read
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.
Detailed Ratings
0.0Emotional Impact
No ratings yet
0.0Intellectual Depth
No ratings yet
0.0Writing Quality
No ratings yet
0.0Rereadability
No ratings yet
0.0Pacing
No ratings yet
0.0Readability
No ratings yet
0.0Plot Complexity
No ratings yet
0.0Humor
No ratings yet
