This fourth edition of one of the classic logic textbooks has been thoroughly revised by John Burgess. The aim is to increase the pedagogical value of the book for the core market of students of philosophy and for students of mathematics and computer science as well. This book has become a classic because of its accessibility to students without a mathematical background, and because it covers not simply the staple topics of an intermediate logic course such as Godel's Incompleteness Theorems, but also a large number of optional topics from Turing's theory of computability to Ramsey's theorem. John Burgess has now enhanced the book by adding a selection of problems at the end of each chapter, and by reorganising and rewriting chapters to make them more independent of each other and thus to increase the range of options available to instructors as to what to cover and what to defer.
'... gives an excellent coverage of the fundamental theoretical results about logic involving computability, undecidability, axiomatization, definability, incompleteness, etc.' American Math Monthly
'The writing style is excellent: although many explanations are formal, they are perfectly clear. Modern, elegant proofs help the reader understand the classic theorems and keep the book to a reasonable length.' Computing Reviews
'... a valuable asset to those who want to enhance their knowledge and strengthen their ideas in the areas of artificial intelligence, philosophy, theory of computing, discrete structures, mathematical logic. It is also useful to teachers for improving their teaching style in these subjects.' Computer Engineering
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
EUR 6,71 expédition depuis Etats-Unis vers France
Destinations, frais et délaisVendeur : ThriftBooks-Dallas, Dallas, TX, Etats-Unis
Paperback. Etat : Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less 1. N° de réf. du vendeur G0521299675I3N00
Quantité disponible : 1 disponible(s)
Vendeur : ThriftBooks-Atlanta, AUSTELL, GA, Etats-Unis
Paperback. Etat : Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less 1. N° de réf. du vendeur G0521299675I3N00
Quantité disponible : 1 disponible(s)
Vendeur : Better World Books, Mishawaka, IN, Etats-Unis
Etat : Good. 1st Edition. Used book that is in clean, average condition without any missing pages. N° de réf. du vendeur 616426-6
Quantité disponible : 1 disponible(s)
Vendeur : Reuseabook, Gloucester, GLOS, Royaume-Uni
Paperback. Etat : Used; Very Good. Dispatched, from the UK, within 48 hours of ordering. Though second-hand, the book is still in very good shape. Minimal signs of usage may include very minor creasing on the cover or on the spine. N° de réf. du vendeur CHL10206560
Quantité disponible : 1 disponible(s)
Vendeur : Literary Cat Books, Machynlleth, Powys, WALES, Royaume-Uni
Softcover. Etat : Very Good+. Etat de la jaquette : No Dust Jacket. 2nd; First Impression. Slight shelf wear. ; Slight shelf wear. 2D black and white illsurations. This book provides a comprehensive introduction to the fundamental concepts of mathematical logic and computability theory. The book covers topics such as computability, undecidability, axiomatization, definability, and Gödel's incompleteness theorems. It is praised for its clarity and modern, elegant proofs, making complex topics accessible to students and valuable for those interested in artificial intelligence, philosophy, and theoretical computing. ; 15.1 x 22.3 x 1.7 cm; x, 285 pages. N° de réf. du vendeur LCB61887
Quantité disponible : 1 disponible(s)
Vendeur : HPB-Red, Dallas, TX, Etats-Unis
paperback. Etat : Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! N° de réf. du vendeur S_349861335
Quantité disponible : 1 disponible(s)