|
|
|
|
| LEADER |
03213nmm a2200289 u 4500 |
| 001 |
EB000619833 |
| 003 |
EBX01000000000000000472915 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9781461240525
|
| 100 |
1 |
|
|a Fenton, William E.
|
| 245 |
0 |
0 |
|a Introduction to Discrete Mathematics with ISETL
|h Elektronische Ressource
|c by William E. Fenton, Ed Dubinsky
|
| 250 |
|
|
|a 1st ed. 1996
|
| 260 |
|
|
|a New York, NY
|b Springer New York
|c 1996, 1996
|
| 300 |
|
|
|a XVI, 196 p
|b online resource
|
| 505 |
0 |
|
|a 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
|
| 653 |
|
|
|a Combinatorics
|
| 653 |
|
|
|a Programming Languages, Compilers, Interpreters
|
| 653 |
|
|
|a Programming languages (Electronic computers)
|
| 653 |
|
|
|a Combinatorics
|
| 700 |
1 |
|
|a Dubinsky, Ed
|e [author]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-1-4612-4052-5?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 511.6
|
| 520 |
|
|
|a 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 is close to that of standard mathematical language, the student constructs the concepts in her or his mind as a result of constructing them on the computer in the syntax of ISETL. This dramatically different approach allows students to attempt to discover concepts in a "Socratic" dialog with the computer. The discussion avoids the formal "definition-theorem" approach and promotes active involvement by the reader by its questioning style. An instructor using this text can expect a lively class whose students develop a deep conceptual understanding rather than simply manipulative skills. Topics covered in this book include: the propositional calculus, operations on sets, basic counting methods, predicate calculus, relations, graphs, functions, and mathematical induction
|