Computability and Logic - Rilegato

Boolos, George S.; Burgess, John P.; Jeffrey, Richard C.

Rilegato

ISBN 10: 0521877520 ISBN 13: 9780521877527

Casa editrice: Cambridge University Press, 2007

Riassunto

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.

Su questo libro

Recensione

'... 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

Descrizione del libro

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.

Dettagli dell?edizione

• Editore: Cambridge University Press
• Data di pubblicazione: 2007
• ISBN 10: 0521877520
• ISBN 13: 9780521877527
• Rilegatura: Copertina rigida
• Lingua: Inglese
• Numero edizione: 5
• Numero di pagine: 366