Isbn: 9780521701464 - Computability and Logic Fifth Edition (36 results)

paperback. Condition: Very Good. As pictured. Very light edge wear. No marks throughout. Carefully packed and promptly shipped.

Condition: very_good. Book is in very good condition and may include minimal underlining highlighting. The book can also include "From the library of" labels. May not contain miscellaneous items toys, dvds, etc. . We offer 100% money back guarantee and 24 7 customer service.

paperback. Condition: Good. The cover shows normal wear. Fast shipping and order satisfaction guaranteed. A portion of your purchase benefits Non-Profit Organizations, First Aid and Fire Stations.

Paperback. Condition: Good. 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.…

Paperback. Condition: 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.

Condition: Acceptable. Readable, but has significant damage / tears. Has a remainder mark. paperback Used - Acceptable 2007.

Paperback. Condition: Good. 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.…

Condition: Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Condition: Good. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

paperback. Condition: Very Good.

Condition: New.

Paperback. Condition: Very Good. 5. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.

Paperback. Condition: New. 5. The item is brand new, never used or read. It's in perfect condition and may include supplements and/or access codes or come shrink-wrapped.

Condition: As New. Unread book in perfect condition.

Paperback. Condition: Very Good. The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged.

Soft cover. Condition: New. 5th or later Edition. 350 pages. new.

Paperback or Softback. Condition: New. Computability and Logic. Book.

Condition: New.

Paperback. Condition: New. 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.…

Paperback. Condition: New. 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.…

Paperback. Condition: New.

Condition: New.

Condition: 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. . . . . . …

Condition: New. In English.

Condition: As New. Unread book in perfect condition.

Condition: 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. …

Condition: New. pp. 366 5th Edition.

Paperback. Condition: New. 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.…

Paperback. Condition: New. 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.…

Paperback. Condition: new. Paperback. 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. 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, but also a large number of optional topics, from Turing's theory of computability to Ramsey's theorem. This fifth edition was first published in 2007. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.…