| 书目名称 | Mathematical Foundations of Computer Science | | 副标题 | Sets, Relations, and | | 编辑 | Peter A. Fejer,Dan A. Simovici | | 视频video | | | 丛书名称 | Monographs in Computer Science | | 图书封面 |  | | 描述 | .Mathematical Foundations of Computer Science, Volume I. is the first of two volumes presenting topics from mathematics (mostly discrete mathematics) which have proven relevant and useful to computer science. This volume treats basic topics, mostly of a set-theoretical nature (sets, functions and relations, partially ordered sets, induction, enumerability, and diagonalization) and illustrates the usefulness of mathematical ideas by presenting applications to computer science. Readers will find useful applications in algorithms, databases, semantics of programming languages, formal languages, theory of computation, and program verification. The material is treated in a straightforward, systematic, and rigorous manner. The volume is organized by mathematical area, making the material easily accessible to the upper-undergraduate students in mathematics as well as in computer science and each chapter contains a large number of exercises. The volume can be used as a textbook, but it will also be useful to researchers and professionals who want a thorough presentation of the mathematical tools they need in a single source. In addition, the book can be used effectively as supplementary re | | 出版日期 | Textbook 1991 | | 关键词 | algorithms; automata; formal language; formal languages; logic; program verification; semantics; combinator | | 版次 | 1 | | doi | https://doi.org/10.1007/978-1-4612-3086-1 | | isbn_softcover | 978-1-4612-7792-7 | | isbn_ebook | 978-1-4612-3086-1Series ISSN 0172-603X Series E-ISSN 2512-5486 | | issn_series | 0172-603X | | copyright | Springer-Verlag New York, Inc. 1991 |
The information of publication is updating
|
|
发表于 2025-3-21 20:00:29
