Logic is a branch of philosophy, mathematics and computer science. It studiesthe 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. Covers elementary topics - proofs, models, recursive functions, Church's theorem . Contains an introduction to more advanced topics - rewriting, lambada-calculus, sequent calculus, automated theorem proving . This book is written for students who have had no exposure to logic before. INDICE: Proofs.-Predictive Logic.-Models.-Algorithms.-Computable Functions.-Computation as a Sequence of Small Steps.-Proofs and Algorithms.-Church's Theorem.-Automated Theorem Proving.-Decidable Theories.-Constructivity.-Epilogie.-Index.-Bibliography
- ISBN: 978-0-85729-120-2
- Editorial: Springer London
- Encuadernacion: Rústica
- Páginas: 195
- Fecha Publicación: 14/01/2011
- Nº Volúmenes: 1
- Idioma: Inglés