Proofs and Algorithms
An Introduction to Logic and Computability
Published on 14. January 2011
Book
Paperback/Softback
XII, 156 pages
978-0-85729-120-2 (ISBN)
Description
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.
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.
Reviews / Votes
From the reviews:"This work examines when the application of an algorithm can replace the construction of a proof. ... focuses on establishing that provability is undecidable in predicate logic (Church's theorem). The text generally consists of propositions followed by proofs, with commentary, examples, and exercises interspersed. ... The book would be of interest to those with adequate background. Summing Up: Recommended. Graduate students and above." (J. R. Burke, Choice, Vol. 49 (1), September, 2011)
"Mathematical logic is a challenging subject for many students. ... this book, with its focus on the nature of proofs and algorithms and their relationship, appears to be targeted precisely for such an audience and should appeal to computer scientists and philosophers ... . this book remains an introductory book on mathematical logic suited for a beginning graduate course in logic. ... Its conciseness makes it well suited for a one-semester graduate course." (Burkhard Englert, ACM Computing Reviews, February, 2012)
More details
Product info
Book
Series
Edition
2011
Language
English
Place of publication
London
United Kingdom
Target group
Professional and scholarly
Graduate
Illustrations
XII, 156 p.
Dimensions
Height: 238 mm
Width: 156 mm
Thickness: 17 mm
Weight
252 gr
ISBN-13
978-0-85729-120-2 (9780857291202)
DOI
10.1007/978-0-85729-121-9
Schweitzer Classification
Other editions
Additional editions
E-Book
01/2011
1st Edition
Springer
€36.99
Available for download
Person
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.
Content
Proofs.-Predictive Logic.-Inductive Definitions.-Languages.-The Languages of Predicate Logic.-Proofs.-Examples of Theories.-Variations on the Principle of the Excluded Middle.-Models.-The Notion of a Model.-The Soundness Theorem.-The Completeness Theorem.-Other Applications of the Notion of Model.-Algorithms.-Computable Functions.-Computable Functions.-Computability over Lists and Trees.-Eliminating Recursion.-Programs.-Computation as a Sequence of Small Steps.-Proofs and Algorithms.-Church's Theorem.-Automated Theorem Proving.-Sequent Calculus.-Proof Search in the Sequent Calculus Without Cuts.-Decidable theories.-Constructivity.-Epilogue.-Index.-Bibliography