Search

Shopping cart

Saved articles

You have not yet added any article to your bookmarks!

Browse articles
Newsletter image

Subscribe to the Newsletter

Join 10k+ people to get notified about new posts, news and tips.

Do not worry we don't spam!

GDPR Compliance

We use cookies to ensure you get the best experience on our website. By continuing to use our site, you accept our use of cookies, Privacy Policy, and Terms of Service.

Proofs and Algorithms

Proofs and Algorithms

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.

Comments