登入
選單
返回
Google圖書搜尋
Mathematical Foundations of Computer Science
Peter A. Fejer
Dan Simovici
其他書名
Sets, Relations, and Induction
出版
Springer New York
, 1991
主題
Computers / Computer Science
Computers / Logic Design
Computers / Machine Theory
Computers / Programming / General
Mathematics / General
Mathematics / Discrete Mathematics
Mathematics / History & Philosophy
Mathematics / Logic
Mathematics / Number Systems
Mathematics / Combinatorics
Mathematics / Numerical Analysis
ISBN
0387974504
9780387974507
URL
http://books.google.com.hk/books?id=ROJQAAAAMAAJ&hl=&source=gbs_api
註釋
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 reading material in computer science courses, particularly those courses which involve the semantics of programming languages, formal languages and automata, and logic programming.
