Computability and Logic is a classic because of its accessibility to students without a mathematical background. This fifth edition was first published in 2007.
"synopsis" may belong to another edition of this title.
Hard to find
'... 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
"About this title" may belong to another edition of this title.
Seller: HPB-Red, Dallas, TX, U.S.A.
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! Seller Inventory # S_458470150
Seller: Marlton Books, Bridgeton, NJ, U.S.A.
Condition: Acceptable. Readable, but has significant damage / tears. Has a remainder mark. paperback Used - Acceptable 2007. Seller Inventory # M-20007214
Seller: Books From California, Simi Valley, CA, U.S.A.
paperback. Condition: Good. Minor shelf wear/ creasing on cover. Seller Inventory # mon0003870036
Seller: 4everBAM, Parker, CO, U.S.A.
paperback. Condition: Very Good. Seller Inventory # VB3120313542
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition. Seller Inventory # 5272869
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 5272869-n
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
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. Seller Inventory # 9780521701464
Seller: BargainBookStores, Grand Rapids, MI, U.S.A.
Paperback or Softback. Condition: New. Computability and Logic. Book. Seller Inventory # BBS-9780521701464
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
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. Seller Inventory # LU-9780521701464
Quantity: Over 20 available
Seller: Rarewaves USA, OSWEGO, IL, U.S.A.
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. Seller Inventory # LU-9780521701464