Proofs and Algorithms (häftad)
Häftad (Paperback / softback)
Antal sidor
2011 ed.
Springer London Ltd
XII, 156 p.
234 x 156 x 9 mm
245 g
Antal komponenter
1 Paperback / softback
Proofs and Algorithms (häftad)

Proofs and Algorithms

An Introduction to Logic and Computability

Häftad Engelska, 2011-01-14
  • Skickas inom 7-10 vardagar.
  • Gratis frakt inom Sverige över 199 kr för privatpersoner.
Finns även som
Visa alla 1 format & utgåvor
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, Goedel'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.
Visa hela texten

Passar bra ihop

  1. Proofs and Algorithms
  2. +
  3. Braiding Sweetgrass

De som köpt den här boken har ofta också köpt Braiding Sweetgrass av Robin Wall Kimmerer (häftad).

Köp båda 2 för 546 kr


Har du läst boken? Sätt ditt betyg »

Fler böcker av Gilles Dowek

Recensioner i media

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)

Övrig information

Gilles Dowek is a Professor at Ecole Polytechnique. He is also a Researcher at the Laboratoire d'Informatique de l'Ecole 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.


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