Proofs and Algorithms [electronic resource] : An Introduction to Logic and Computability / by Gilles Dowek.
By: Dowek, Gilles [author.].
Contributor(s): SpringerLink (Online service).
Material type:
BookSeries: Undergraduate Topics in Computer Science: Publisher: London : Springer London, 2011Description: VIII, 195p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9780857291219.Subject(s): Computer science | Information theory | Computer Science | Theory of Computation | Mathematical Logic and Formal LanguagesDDC classification: 004.0151 Online resources: Click here to access online
In:
Springer eBooksSummary: 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.
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.
There are no comments for this item.