Computability and Logic is a classic because of its accessibility to students without a mathematical background. This fifth edition was first published in 2007.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: Books From California, Simi Valley, CA, USA
paperback. Zustand: Good. Minor shelf wear/ creasing on cover. Artikel-Nr. mon0003870036
Anzahl: 2 verfügbar
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. In. Artikel-Nr. ria9780521701464_new
Anzahl: Mehr als 20 verfügbar
Anbieter: Kennys Bookstore, Olney, MD, USA
Zustand: New. 2007. 5th Edition. Paperback. Computability and Logic is a classic because of its accessibility to students without a mathematical background. This fifth edition was first published in 2007. Num Pages: 366 pages, black & white illustrations. BIC Classification: HPL; PBCD. Category: (P) Professional & Vocational. Dimension: 254 x 177 x 19. Weight in Grams: 690. 366 pages, illustrations. Computability and Logic is a classic because of its accessibility to students without a mathematical background. This fifth edition was first published in 2007. Cateogry: (P) Professional & Vocational. BIC Classification: HPL; PBCD. Dimension: 254 x 177 x 19. Weight: 638. . . . . . Books ship from the US and Ireland. Artikel-Nr. V9780521701464
Anzahl: Mehr als 20 verfügbar
Anbieter: Studibuch, Stuttgart, Deutschland
paperback. Zustand: Gut. 364 Seiten; 9780521701464.3 Gewicht in Gramm: 1. Artikel-Nr. 1093041
Anzahl: 1 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Computability and Logic 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. This 2007 fifth edition has been thoroughly revised by John Burgess. Including a selection of exercises, adjusted for this edition, at the end of each chapter, it offers a simpler treatment of the representability of recursive functions, a traditional stumbling block for students on the way to the Godel incompleteness theorems. This updated edition is also accompanied by a website as well as an instructor's manual. Artikel-Nr. 9780521701464
Anzahl: 1 verfügbar