<p>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 syn
Learning Discrete Mathematics with ISETL
β Scribed by Nancy Baxter, Ed Dubinsky, Gary Levin (auth.)
- Publisher
- Springer-Verlag New York
- Year
- 1989
- Tongue
- English
- Leaves
- 426
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Synopsis
The title of this book, Learning Discrete Mathematics with ISETL raises two issues. We have chosen the word "Learning" rather than "Teaching" because we think that what the student does in order to learn is much more important than what the professor does in order to teach. Academia is filled with outstanding mathematics teachers: excellent expositors, good organizers, hard workers, men and women who have a deep understanding of Mathematics and its applications. Yet, when it comes to ideas in MatheΒ matics, our students do not seem to be learning. It may be that something more is needed and we have tried to construct a book that might provide a different kind of help to the student in acquiring some of the fundamental concepts of Mathematics. In a number of ways we have made choices that seem to us to be the best for learning, even if they don't always completely agree with standard teaching practice. A second issue concerns students' writing programs. ISETL is a proΒ gramming language and by the phrase "with ISETL" in the title, we mean that our intention is for students to write code, think about what they have written, predict its results, and run their programs to check their predicΒ tions. There is a trade-off here. On the one hand, it can be argued that students' active involvement with constructing Mathematics for themselves and solving problems is essential to understanding concepts.
β¦ Table of Contents
Front Matter....Pages i-xvii
Numbers, Programs, and ISETL....Pages 1-61
Propositional Calculus....Pages 63-97
Sets and Tuples....Pages 99-161
Functions....Pages 163-223
Predicate Calculus....Pages 225-263
Combinatorics, Matrices, Determinants....Pages 265-317
Mathematical Induction....Pages 319-362
Relations and Graphs....Pages 363-404
Back Matter....Pages 405-417
β¦ Subjects
Combinatorics
π SIMILAR VOLUMES
<p>Most students in abstract algebra classes have great difficulty making sense of what the instructor is saying. Moreover, this seems to remain true almost independently of the quality of the lecture. This book is based on the constructivist belief that, before students can make sense of any presen
This first-year course in discrete mathematics requires no calculus or computer programming experience. The approach stresses finding efficient algorithms, rather than existential results. Provides an introduction to constructing proofs (especially by induction), and an introduction to algorithmic p
Susanna Epp's DISCRETE MATHEMATICS, THIRD EDITION provides a clear introduction to discrete mathematics. Renowned for her lucid, accessible prose, Epp explains complex, abstract concepts with clarity and precision. This book presents not only the major themes of discrete mathematics, but also the re