Computability and Logic

Nonfiction, Religion & Spirituality, Philosophy, Logic, Computers, General Computing
Cover of the book Computability and Logic by George S. Boolos, John P. Burgess, Richard C. Jeffrey, Cambridge University Press
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: George S. Boolos, John P. Burgess, Richard C. Jeffrey ISBN: 9781107086500
Publisher: Cambridge University Press Publication: September 17, 2007
Imprint: Cambridge University Press Language: English
Author: George S. Boolos, John P. Burgess, Richard C. Jeffrey
ISBN: 9781107086500
Publisher: Cambridge University Press
Publication: September 17, 2007
Imprint: Cambridge University Press
Language: English

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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

More books from Cambridge University Press

Cover of the book European Union Law for International Business by George S. Boolos, John P. Burgess, Richard C. Jeffrey
Cover of the book Fred Sanger - Double Nobel Laureate by George S. Boolos, John P. Burgess, Richard C. Jeffrey
Cover of the book Fundamentals of Translation by George S. Boolos, John P. Burgess, Richard C. Jeffrey
Cover of the book After Lacan by George S. Boolos, John P. Burgess, Richard C. Jeffrey
Cover of the book The Cambridge Companion to Vygotsky by George S. Boolos, John P. Burgess, Richard C. Jeffrey
Cover of the book Justices and Journalists by George S. Boolos, John P. Burgess, Richard C. Jeffrey
Cover of the book Whale-watching by George S. Boolos, John P. Burgess, Richard C. Jeffrey
Cover of the book Electrical Neuroimaging by George S. Boolos, John P. Burgess, Richard C. Jeffrey
Cover of the book Better Mental Health Care by George S. Boolos, John P. Burgess, Richard C. Jeffrey
Cover of the book Religious Leaders and Conflict Transformation by George S. Boolos, John P. Burgess, Richard C. Jeffrey
Cover of the book Judging Social Rights by George S. Boolos, John P. Burgess, Richard C. Jeffrey
Cover of the book Uncommon Causes of Stroke by George S. Boolos, John P. Burgess, Richard C. Jeffrey
Cover of the book Empire and Power in the Reign of Süleyman by George S. Boolos, John P. Burgess, Richard C. Jeffrey
Cover of the book Multivariable Analysis by George S. Boolos, John P. Burgess, Richard C. Jeffrey
Cover of the book The Linguistic Past in Twelfth-Century Britain by George S. Boolos, John P. Burgess, Richard C. Jeffrey
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy