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 The Relational Lens by George S. Boolos, John P. Burgess, Richard C. Jeffrey
Cover of the book Faith in Moderation by George S. Boolos, John P. Burgess, Richard C. Jeffrey
Cover of the book The Sexual World of the Arabian Nights by George S. Boolos, John P. Burgess, Richard C. Jeffrey
Cover of the book Language and Television Series by George S. Boolos, John P. Burgess, Richard C. Jeffrey
Cover of the book Health in Humanitarian Emergencies by George S. Boolos, John P. Burgess, Richard C. Jeffrey
Cover of the book Logical Modalities from Aristotle to Carnap by George S. Boolos, John P. Burgess, Richard C. Jeffrey
Cover of the book Mobility Data by George S. Boolos, John P. Burgess, Richard C. Jeffrey
Cover of the book Capital Budgeting by George S. Boolos, John P. Burgess, Richard C. Jeffrey
Cover of the book The Net and the Nation State by George S. Boolos, John P. Burgess, Richard C. Jeffrey
Cover of the book A First Course in Differential Geometry by George S. Boolos, John P. Burgess, Richard C. Jeffrey
Cover of the book After Defeat by George S. Boolos, John P. Burgess, Richard C. Jeffrey
Cover of the book Schoenberg's Atonal Music by George S. Boolos, John P. Burgess, Richard C. Jeffrey
Cover of the book Finite Ordered Sets by George S. Boolos, John P. Burgess, Richard C. Jeffrey
Cover of the book Labor Divided in the Postwar European Welfare State by George S. Boolos, John P. Burgess, Richard C. Jeffrey
Cover of the book Criminological Approaches to International Criminal Law 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