Proofs and Algorithms: An Introduction to Logic and Computability (Undergraduate Topics in Computer Science)

by Gilles Dowek

0 ratings • 0 reviews • 0 shelved
Book cover for Proofs and Algorithms

Bookhype may earn a small commission from qualifying purchases. Full disclosure.

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: 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.
  • ISBN13 9780857291202
  • Publish Date 14 January 2011
  • Publish Status Active
  • Publish Country GB
  • Imprint Springer London Ltd
  • Edition 2011 ed.
  • Format Paperback
  • Pages 156
  • Language English