書目名稱 | Foundations of Logic and Mathematics | 副標(biāo)題 | Applications to Comp | 編輯 | Yves Nievergelt | 視頻video | http://file.papertrans.cn/348/347049/347049.mp4 | 圖書封面 |  | 描述 | This modem introduction to the foundations of logic, mathematics, and computer science answers frequent questions that mysteriously remain mostly unanswered in other texts: ? Why is the truth table for the logical implication so unintuitive? ? Why are there no recipes to design proofs? ? Where do these numerous mathematical rules come from? ? What are the applications of formal logic and abstract mathematics? ? What issues in logic, mathematics, and computer science still remain unresolved? Answers to such questions must necessarily present both theory and significant applica- tions, which explains the length of the book. The text first shows how real life provides some guidance for the selection of axioms for the basis of a logical system, for instance, Boolean, classical, intuitionistic, or minimalistic logic. From such axioms, the text then derives de- tailed explanations of the elements of modem logic and mathematics: set theory, arithmetic, number theory, combinatorics, probability, and graph theory, with applications to computer science. The motivation for such detail, and for the organization of the material, lies in a continuous thread from logic and mathematics to their us | 出版日期 | Textbook 20021st edition | 關(guān)鍵詞 | Arithmetic; Boolean algebra; Computer Science; DES; Logic; Number Theory; cardinality; cryptography; ksa; pro | 版次 | 1 | doi | https://doi.org/10.1007/978-1-4612-0125-0 | isbn_softcover | 978-1-4612-6623-5 | isbn_ebook | 978-1-4612-0125-0 | copyright | Springer Science+Business Media New York 2002 |
The information of publication is updating
|
|