| 書目名稱 | Proofs and Algorithms | | 副標(biāo)題 | An Introduction to L | | 編輯 | Gilles Dowek | | 視頻video | http://file.papertrans.cn/762/761266/761266.mp4 | | 概述 | Covers elementary topics - proofs, models, recursive functions, Church‘s theorem.Contains an introduction to more advanced topics - rewriting, lambada-calculus, sequent calculus, automated theorem pro | | 叢書名稱 | Undergraduate Topics in Computer Science | | 圖書封面 |  | | 描述 | 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. | | 出版日期 | Textbook 2011 | | 關(guān)鍵詞 | Algorithm; Algorithmic interpretation of proofs; Automated theorem proving; Computability; Constructivit | | 版次 | 1 | | doi | https://doi.org/10.1007/978-0-85729-121-9 | | isbn_softcover | 978-0-85729-120-2 | | isbn_ebook | 978-0-85729-121-9Series ISSN 1863-7310 Series E-ISSN 2197-1781 | | issn_series | 1863-7310 | | copyright | Springer-Verlag London Limited 2011 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-13 12:48
發(fā)表于 2025-3-21 16:49:41
