Computability and Logic
Cambridge University Press / 2007-09-17出版
简介

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.

喜欢这本书的人也喜欢 打开App查看更多
  • Godel's Incompleteness Theorems
  • Elements of Set Theory
  • A Mathematical Introduction to Logic
  • Set Theory