Computability and logic.
Saved in:
Author / Creator: | Boolos, George. |
---|---|
Edition: | 5th ed. / George S. Boolos, John P. Burgess, Richard C. Jeffrey. |
Imprint: | Cambridge ; New York : Cambridge University Press, 2007. |
Description: | xiii, 350 p. : ill. ; 26 cm. |
Language: | English |
Subject: | |
Format: | Print Book |
URL for this record: | http://pi.lib.uchicago.edu/1001/cat/bib/6616006 |
Summary: | 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. |
---|---|
Physical Description: | xiii, 350 p. : ill. ; 26 cm. |
Bibliography: | Includes bibliographical references (p. 341) and index. |
ISBN: | 9780521877527 0521877520 9780521701464 0521701465 |