Полное описание

Dowek, G. Proofs and Algorithms : an Introduction to Logic and Computability / by Gilles Dowek. - London : Springer, 2011. - on-line. - (Undergraduate Topics in Computer Science). - URL: http://dx.doi.org/10.1007/978-0-85729-121-9. - Загл. с экрана. - ISBN 978-0-85729-121-9. - Текст : электронный.

ГРНТИ	УДК
20	004.421
50.41

Рубрики:
computer science
computers
mathematical logic
computer Science
theory of Computation
mathematical Logic and Formal Languages

Аннотация: Proofs and Algorithms: An Introduction to Logic and Computability Logic is a branch of philosophy, mathematics and computer science. It studies the required methods to determine whether a statement is true, such as reasoning and computation. Proofs and Algorithms: An Introduction to Logic and Computability is an introduction to the fundamental concepts of contemporary logic - those of a proof, a computable function, a model and a set. It presents a series of results, both positive and negative, - Church's undecidability theorem, Gödel’s incompleteness theorem, the theorem asserting the semi-decidability of provability - that have profoundly changed our vision of reasoning, computation, and finally truth itself. Designed for undergraduate students, this book presents all that philosophers, mathematicians and computer scientists should know about logic.

http://dx.doi.org/10.1007/978-0-85729-121-9

Держатели документа:
Государственная публичная научно-техническая библиотека России : 123298, г. Москва, ул. 3-я Хорошевская, д. 17 (Шифр в БД-источнике (KATBW): -228555374)

Шифр в сводном ЭК: fdcd4185d826a48909ec6795675fe5a3

Просмотр издания