Sprache: Englisch
Verlag: Cambridge University Press, 2007
ISBN 10: 0521701465 ISBN 13: 9780521701464
Anbieter: Better World Books, Mishawaka, IN, USA
Zustand: Very Good. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.
Sprache: Englisch
Verlag: Cambridge University Press, 2007
ISBN 10: 0521701465 ISBN 13: 9780521701464
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 44,65
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Sprache: Englisch
Verlag: Cambridge University Press, 2007
ISBN 10: 0521701465 ISBN 13: 9780521701464
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.
Sprache: Englisch
Verlag: Cambridge University Press, 2007
ISBN 10: 0521701465 ISBN 13: 9780521701464
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.