Skip to main content

Module Reading List

Proof and Computation, 2021/22, Semester 2
Prof. Michael Rathjen
Tutor information is taken from the Module Catalogue

Cooper, S. Barry. Computability theory. Chapman & Hall/CRC, Boca Raton, FL, 2004. x+409 pp. ISBN: 1-58488-237-9

Cutland, Nigel. Computability. An introduction to recursive function theory. Cambridge University Press, Cambridge-New York, 1980. x+251 pp. ISBN: 0-521-22384-9; 0-521-29465-7  

Enderton, Herbert B. A mathematical introduction to logic. Second edition. Harcourt/Academic Press, Burlington, MA, 2001. xii+317 pp. ISBN: 0-12-238452-0

Franzén, Torkel. Gödel's theorem. An incomplete guide to its use and abuse. A K Peters, Ltd., Wellesley, MA, 2005. x+172 pp. ISBN: 1-56881-238-8; 978-1-5688-1238-0

Franzén, Torkel. Inexhaustibility. A non-exhaustive treatment. Lecture Notes in Logic, 16. Association for Symbolic Logic, Urbana, IL; A K Peters, Ltd., Wellesley, MA, 2004. xii+251 pp. ISBN: 1-56881-175-6

Hofstadter, Douglas R. Gödel, Escher, Bach: an eternal golden braid. Basic Books, Inc., Publishers, New York, 1979. xxi+777 pp. ISBN: 0-465-02685-0  

Penrose, Roger. The emperor's new mind. Concerning computers, minds, and the laws of physics. With a foreword by Martin Gardner. The Clarendon Press, Oxford University Press, New York, 1989. xiv+466 pp. ISBN: 0-19-851973-7

Penrose, Roger. Shadows of the mind. A search for the missing science of consciousness. Oxford University Press, Oxford, 1994. xvi+457 pp. ISBN: 0-19-853978-9  

Weber, Rebecca. Computability theory. Student Mathematical Library, 62. American Mathematical Society, Providence, RI, 2012. viii+203 pp. ISBN: 978-0-8218-7392-2

This list was last updated on 06/01/2022