## Discrete Mathematics Using a ComputerThis volume offers a new, hands-on approach to teaching Discrete Mathematics. A simple functional language is used to allow students to experiment with mathematical notations which are traditionally difficult to pick up. This practical approach provides students with instant feedback and also allows lecturers to monitor progress easily. All the material needed to use the book will be available via ftp (the software is freely available and runs on Mac, PC and Unix platforms), including a special module which implements the concepts to be learned.No prior knowledge of Functional Programming is required: apart from List Comprehension (which is comprehensively covered in the text) everything the students need is either provided for them or can be picked up easily as they go along. An Instructors Guide will also be available on the WWW to help lecturers adapt existing courses. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Introduction to Haskell | 1 |

Propositional Logic | 35 |

Predicate Logic | 89 |

Set Theory | 112 |

Recursion | 129 |

Inductively Defined Sets | 147 |

Induction | 163 |

Relations | 185 |

Functions | 229 |

Discrete Mathematics in Circuit Design | 273 |

A Software Tools for Discrete Mathematics | 295 |

331 | |

### Other editions - View all

Discrete Mathematics Using a Computer John O'Donnell,Cordelia Hall,Rex Page Limited preview - 2007 |

### Common terms and phrases

adder algebra allows appear application arcs argument assume assumption base binary bits Bool Boolean calculate called carry Chapter circuit closure consider contains defined definition describe domain elements English equal equation error evaluate example Exercise expression False Figure finite foldr formal function give given graph hand Haskell implement implication important induction inference rules infinite input Integer language laws length logic mathematical means method natural numbers Node notation operator partial possible predicate problem produce proof properties proposition prove provides reasoning recursion reflexive relation represented result returns reverse says Show simple specify statement string structure Suppose symmetric takes theorem transitive tree True truth table universe variables write written Zero

### References to this book

Diskrete Mathematik: Basiswissen für Informatiker ; eine Mathematica ... Werner Nehrlich No preview available - 2003 |