Computability and Logic
3rd Edition
Published on 29. September 1989
Book
Hardback
314 pages
978-0-521-38026-3 (ISBN)
Description
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.
Reviews / Votes
'Intended for a second course in logic it gives excellent coverage of the fundamental theoretical results about logic involving computability, undecidability, axiomatization, definability, incompleteness, etc.' American Math Monthly '... particularly appropriate for graduate and advanced undergraduate students in philosophy ... The book is written in a clear and pleasing style and avoids pedantry ... It should be an excellent text for its intended audience.' Mathematical ReviewsMore details
Edition
3rd Revised edition
Language
English
Place of publication
Cambridge
United Kingdom
Target group
Professional and scholarly
Edition type
Revised edition
Illustrations
40 line figures 100 tables
Dimensions
Height: 228 mm
Width: 152 mm
Thickness: 23 mm
Weight
600 gr
ISBN-13
978-0-521-38026-3 (9780521380263)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
New editions
George S. Boolos | John P. Burgess | Richard C. Jeffrey
Computability and Logic
Book
09/2007
5th Edition
Cambridge University Press
€134.50
Shipment within 15-20 days
George S. Boolos | John P. Burgess | Richard C. Jeffrey
Computability and Logic
Book
03/2002
4th Edition
Cambridge University Press
€68.09
Article exhausted; check for reprint
Persons
Content
Preface; Preface to the third edition; 1. Enumerability; 2. Diagonalization; 3. Turing machines; 4. Uncomputability via the busy beaver problem; 5. Uncomputability via diagonalization; 6. Abacus computable functions are Turing computable; 7. Recursive functions are abacus computable; 8. Turing computable functions are recursive; 9. First-order logic revisited; 10. First-order logic is undecidable; 11. First-order logic formalized: derivations and soundness; 12. Completeness of the formalization: compactness; 13. The Skolem-Loewenheim theorem; 14. Representability in Q; 15. Undecidability, indefinability and incompleteness; 16. Provability predicates and the unprovability of consistency; 17. Non-standard models of arithmetic; 18. Second-order logic; 19. On defining arithmetical truth; 20. Definability arithmetic and forcing; 21. The decidability of arithmetic with addition, but not multiplication; 22. Dynadic logic is undecidable: 'eliminating' names and function symbols; 23. The Craig interpolation lemma; 24. Two applications of Craig's lemma; 25. Monadic versus dyadic logic; 26. Ramsey's theorem; 27. Provability considered modal-logically; 28. Undecidable sentences; 29. Non-standard models of Z are not recursive; Index.