• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Proofs and Algorithms: An Introduction to Logic and Computability

Proofs and Algorithms: An Introduction to Logic and Computability

Paperback

Series: Undergraduate Topics in Computer Science

FictionGeneral ComputersProgramming

ISBN10: 0857291203
ISBN13: 9780857291202
Publisher: Springer Nature
Published: Jan 14 2011
Pages: 156
Weight: 0.54
Height: 0.36 Width: 6.14 Depth: 9.21
Language: English
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.

Also in

General Computers