Proofs and Algorithms: An Introduction to Logic and Computability - Brossura

Dowek, Gilles

Brossura

ISBN 10: 0857291203 ISBN 13: 9780857291202

Casa editrice: Springer, 2011

Riassunto

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.

Su questo libro

Informazioni sull?autore

Gilles Dowek is a Professor at École Polytechnique. He is also a Researcher at the Laboratoire d'Informatique de l'École Polytechnique and the Institut National de Recherche en Informatique et en Automatique (INRIA). His research concerns the formalization of mathematics and the mechanization of reasoning. His main contribution is a reformulation of the axiomatic method which provides a central role to the notion of computation.

Dalla quarta di copertina

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.

Dettagli dell'edizione

• Editore: Springer
• Data di pubblicazione: 2011
• Lingua: Inglese
• ISBN 10: 0857291203
• ISBN 13: 9780857291202
• Rilegatura: Copertina flessibile
• Numero di pagine: 168
• Contatto del produttore: non disponibile
• Persona responsabile: ProductSafety@springernature.com; ProductSafety@springernature.com; ; Poststr. 9; Darmstadt; 64293; Germania