logo
Product categories

EbookNice.com

Most ebook files are in PDF format, so you can easily read them using various software such as Foxit Reader or directly on the Google Chrome browser.
Some ebook files are released by publishers in other formats such as .awz, .mobi, .epub, .fb2, etc. You may need to install specific software to read these formats on mobile/PC, such as Calibre.

Please read the tutorial at this link.  https://ebooknice.com/page/post?id=faq


We offer FREE conversion to the popular formats you request; however, this may take some time. Therefore, right after payment, please email us, and we will try to provide the service as quickly as possible.


For some exceptional file formats or broken links (if any), please refrain from opening any disputes. Instead, email us first, and we will try to assist within a maximum of 6 hours.

EbookNice Team

(Ebook) Computability and Logic by George S. Boolos, John P. Burgess, Richard C. Jeffrey ISBN 9780521701464, 9780521877527, 0521701465, 0521877520

  • SKU: EBN-1007176
Zoomable Image
$ 32 $ 40 (-20%)

Status:

Available

4.4

11 reviews
Instant download (eBook) Computability and Logic after payment.
Authors:George S. Boolos, John P. Burgess, Richard C. Jeffrey
Pages:366 pages.
Year:2007
Editon:5th ed
Publisher:Cambridge University Press
Language:english
File Size:2.23 MB
Format:pdf
ISBNS:9780521701464, 9780521877527, 0521701465, 0521877520
Categories: Ebooks

Product desciption

(Ebook) Computability and Logic by George S. Boolos, John P. Burgess, Richard C. Jeffrey ISBN 9780521701464, 9780521877527, 0521701465, 0521877520

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. Including a selection of exercises, adjusted for this edition, at the end of each chapter, it offers a new and simpler treatment of the representability of recursive functions, a traditional stumbling block for students on the way to the Godel incompleteness theorems.
*Free conversion of into popular formats such as PDF, DOCX, DOC, AZW, EPUB, and MOBI after payment.

Related Products