Introduction to Discrete Mathematics with ISETL
Intended for first- or second-year undergraduates, this introduction to discrete mathematics covers the usual topics of such a course, but applies constructivist principles that promote - indeed, require - active participation by the student. Working with the programming language ISETL, whose syntax...
| Main Authors: | , |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
New York, NY
Springer New York
1996, 1996
|
| Edition: | 1st ed. 1996 |
| Subjects: | |
| Online Access: | |
| Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of Contents:
- 1 Numbers and Programs
- 1.1 The Basics of ISETL
- 1.2 Divisibility
- Overview of Chapter 1
- 2 Propositional Calculus
- 2.1 Boolean Expressions
- 2.2 Implication and Proof
- Overview of Chapter 2
- 3 Sets and Tuples
- 3.1 Defining Sets and Tuples
- 3.2 Operations on Sets
- 3.3 Counting Methods
- Overview of Chapter 3
- 4 Predicate Calculus
- 4.1 Quantified Expressions
- 4.2 Multi-Level Quantification
- Overview of Chapter 4
- 5 Relations and Graphs
- 5.1 Relations and their Graphs
- 5.2 Equivalence Relations and Graph Theory
- Overview of Chapter 5
- 6 Functions
- 6.1 Representing Functions
- 6.2 Properties of Functions
- Overview of Chapter 6
- 7 Mathematical Induction
- 7.1 Understanding the Method
- 7.2 Using Mathematical Induction
- Overview of Chapter 7
- 8 Partial Orders
- Activities
- Discussion
- Exercises
- Overview of Chapter 8
- 9 Infinite Sets
- Discussion
- Exercises
- Appendix 1: Getting Started With Isetl
- A. Working in the Execution Window
- B. Working with Files
- C. Using Directives
- D. Graphing in ISETL
- Appendix 2: Some Special Code
- Index of Frequently Used Sets and Functions