ENGLISH

Proofs and Algorithms: An Introduction to Logic and Computability

By Gilles Dowek (auth.)

Book information

Publisher
Springer-Verlag London
Year
2011
ISBN
0857291203, 9780857291202, 9780857291219
DOI
10.1007/978-0-85729-121-9
Language
english
Format
PDF
Filesize
954 kB (977141 bytes)
Series
Undergraduate Topics in Computer Science
Edition
1
Pages
156\168
Time added
2011-06-04 13:46:07
Theory of Computation; Mathematical Logic and Form

Description

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.

Similar books