## Learning discrete mathematics with ISETL |

### What people are saying - Write a review

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

### Contents

Numbers Programs and ISETL | 1 |

Propositional Calculus | 63 |

Sets and Tuples | 99 |

Copyright | |

7 other sections not shown

### Other editions - View all

Learning Discrete Mathematics with ISETL Nancy Baxter,Edward Dubinsky,Gary Levin Limited preview - 2012 |

Learning Discrete Mathematics with ISETL Nancy Baxter,Edward Dubinsky,Gary Levin No preview available - 2011 |

### Common terms and phrases

assigned base binary operation Boolean expression Boolean values Cartesian product Chapter common divisor consider construct corresponding counting the number denote determine digraph discussed domain and range element entries equal equation equivalence relation evaluate example Exercise F F F f unc false finite set floating-point numbers forall func called func that accepts func(x function whose domain graph greatest common divisor Hasse diagram impl induction input inverse ISETL code ISETL func ISETL program ISETL syntax iterate loop loop invariant mathematical induction mathematical notation multiplication n-tuple negation newat objects output pairs permutation permutation matrix positive integers possible prime problem proof proposition valued function quantification real numbers relation representation represents a function scalar sequence set expression set former smap statement string student subset Summary of Section Suppose truth table tuple value true variables vertex vertices Write an ISETL