Buch, Englisch, 156 Seiten, Format (B × H): 156 mm x 238 mm, Gewicht: 252 g
An Introduction to Logic and Computability
Buch, Englisch, 156 Seiten, Format (B × H): 156 mm x 238 mm, Gewicht: 252 g
Reihe: Undergraduate Topics in Computer Science
ISBN: 978-0-85729-120-2
Verlag: Springer
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.
Zielgruppe
Graduate
Autoren/Hrsg.
Fachgebiete
Weitere Infos & Material
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