Discover / Book
Computability and logic
George Boolos, Richard C. Jeffrey, John P. Burgess · 1974 · 304 pages
Computable functionsLogic, Symbolic and mathematicalRecursive functionsSymbolic and mathematical LogicMathematical foundationsPhilosophy
As an Amazon Associate we earn from qualifying purchases. Some book links are affiliate links; you pay the same price and we may earn a small commission.
About this book
A text for a second course in logic for graduate and advanced undergraduate students. This third edition has been corrected and contains thoroughly revised versions of the chapters on Ramsey and provability, with new exercises provided for three other chapters. There are also two new chapters dealing with undecidable sentences and on the non-existence of non-standard recursive models of Z.
Appears in these reading paths
The Best Books to Learn Mathematical Logic, In Order
Beginner8books61 hrs5 stages
Best Books on Godel's Incompleteness Theorems, in Order
Beginner14books106 hrs5 stages
Related reading guides
Reader reviews
Ratings and notes from readers — tagged with how deep into the subject they were.
Loading reviews…