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.
Logic is a foundational mathematical discipline for Computer Science. This unique compendium provides the main ideas and techniques originating from logic. It is divided into two volumes — propositional logic and predicate logic. The volume presents some of the most important concepts starting with a variety of logic formalisms — Hilbert/Frege systems, tableaux, sequents, and natural deduction in both propositional and first-order logic, as well as transformations between these formalisms. Topics like circuit design, resolution, cutting planes, Hintikka sets, paramodulation, and program verification, which do not appear frequently in logic books are discussed in detail.The useful reference text has close to 800 exercises and supplements to deepen understanding of the subject. It emphasizes proofs and overcomes technical difficulties by providing detailed arguments. Computer scientists and mathematicians will benefit from this volume.
Thank you for visiting our website. Would you like to provide feedback on how we could improve your experience?
This site does not use any third party cookies with one exception — it uses cookies from Google to deliver its services and to analyze traffic.Learn More.