Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | Proofs and Algorithms - An Introduction to Logic and Computability

Proofs and Algorithms

An Introduction to Logic and Computability

Dowek, Gilles

2011, VIII, 195p.

Available Formats:

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.


(net) price for USA

ISBN 978-0-85729-121-9

digitally watermarked, no DRM

Included Format: PDF and EPUB

download immediately after purchase

learn more about Springer eBooks

add to marked items


Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.


(net) price for USA

ISBN 978-0-85729-120-2

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days

add to marked items

  • Covers elementary topics such as proofs, models, recursive functions, and Church's theorem
  • Introduces more advanced topics, like rewriting, lambada-calculus, sequent calculus, and automated theorem proving
  • Written for students who have had no exposure to logic before

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.

Content Level » Graduate

Keywords » Algorithm - Algorithmic interpretation of proofs - Automated theorem proving - Computability - Constructivity - Cut elimination - Decidability - Lambda-calculus - Natural deduction - Proof - Rewriting - Sequent calculus - Turing Machines

Related subjects » Theoretical Computer Science

Table of contents / Preface / Sample pages 

Popular Content within this publication 



Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Theory of Computation.