Home / Help

Author Hall, Cordelia. author Discrete Mathematics Using a Computer [electronic resource] / by Cordelia Hall, John O'Donnell London : Springer London : Imprint: Springer, 2000 http://dx.doi.org/10.1007/978-1-4471-3657-6 XVIII, 339 p. online resource

SUMMARY

Several areas of mathematics find application throughout computer science, and all students of computer science need a practical working understanding of them. These core subjects are centred on logic, sets, recursion, induction, relations and functions. The material is often called discrete mathematics, to distinguish it from the traditional topics of continuous mathematics such as integration and differential equations. The central theme of this book is the connection between computing and discrete mathematics. This connection is useful in both directions: โ{128}ข Mathematics is used in many branches of computer science, in applicaยญ tions including program specification, datastructures,design and analysis of algorithms, database systems, hardware design, reasoning about the correctness of implementations, and much more; โ{128}ข Computers can help to make the mathematics easier to learn and use, by making mathematical terms executable, making abstract concepts more concrete, and through the use of software tools such as proof checkers. These connections are emphasised throughout the book. Software tools (see Appendix A) enable the computer to serve as a calculator, but instead of just doing arithmetic and trigonometric functions, it will be used to calculate with sets, relations, functions, predicates and inferences. There are also special software tools, for example a proof checker for logical proofs using natural deduction

CONTENT

1 Introduction to Haskell -- 2 Propositional Logic -- 3 Predicate Logic -- 4 Set Theory -- 5 Recursion -- 6 Inductively Defined Sets -- 7 Induction -- 8 Relations -- 9 Functions -- 10 Discrete Mathematics in Circuit Design -- A Software Tools for Discrete Mathematics -- B Resources on the Web -- C Solutions to Selected Exercises -- C.1 Introduction to Haskell -- C.2 Propositional Logic -- C.3 Predicate Logic -- C.4 Set Theory -- C.5 Recursion -- C.6 Inductively Defined Sets -- C.7 Induction -- C.8 Relations -- C.9 Functions -- C.1O Discrete Mathematics in Circuit Design

Mathematics Algorithms Mathematical logic Mathematics Mathematics general Mathematical Logic and Formal Languages Algorithm Analysis and Problem Complexity

Location Office of Academic Resources, Chulalongkorn University, Phayathai Rd. Pathumwan Bangkok 10330 Thailand

Contact Us

Tel. 0-2218-2929,
0-2218-2927 (Library Service)
0-2218-2903 (Administrative Division)
Fax. 0-2215-3617, 0-2218-2907 