رسته‌ها
Computability and Logic
امتیاز دهید
5 / 4
با 9 رای
امتیاز دهید
5 / 4
با 9 رای
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 G¨odel’s incompleteness theorems, but also a large number
of optional topics, from Turing’s theory of computability to Ramsey’s theorem. This fifth
edition has been thoroughly revised by John P. Burgess. 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 G¨odel incompleteness theorems. This new edition is also accompanied by a
Web site as well as an instructor’s manual.
Lorem ipsum dolor sit amet, consectetur adipiscing elit.
a_h_allame
آپلود شده توسط: a_h_allame
۱۳۹۴/۰۱/۲۳
اطلاعات نسخه الکترونیکی
تعداد صفحات:
366
فرمت:
PDF

کتاب‌های مرتبط

درج دیدگاه مختص اعضا است! برای ورود به حساب خود اینجا و برای عضویت اینجا کلیک کنید.

دیدگاه‌های کتاب الکترونیکی Computability and Logic

تعداد دیدگاه‌ها:
0
دیدگاهی درج نشده؛ شما نخستین نگارنده باشید.
افزودن نسخه جدید
انتخاب فایل
comment_comments_for_the_file