Computability and logic
This fifth edition of 'Computability and Logic' covers not just the staple topics of an intermediate logic course such as Godel's incompleteness theorems, but also optional topics that include Turing's theory of computability and Ramsey's theorem
Main Author: | |
---|---|
Other Authors: | , |
Format: | Book |
Language: | English |
Published: |
Cambridge ; New York :
Cambridge University Press,
2007
|
Edition: | 5th ed. / |
Subjects: |
Internet
This item is not available through BorrowDirect. Please contact your institution’s interlibrary loan office for further assistance.Stanford University
Call Number: |
INTERNET RESOURCE |
---|