Compendium of discrete mathematics (Q2877480)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Compendium of discrete mathematics |
scientific article; zbMATH DE number 6333749
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Compendium of discrete mathematics |
scientific article; zbMATH DE number 6333749 |
Statements
22 August 2014
0 references
undergraduate textbook
0 references
discrete mathematics
0 references
computer science
0 references
graphs
0 references
linear algebra
0 references
propositional logic
0 references
logic in computer science
0 references
predicate logic
0 references
number systems
0 references
elementary number theory
0 references
elementary combinatorics
0 references
probability theory
0 references
Compendium of discrete mathematics (English)
0 references
This undergraduate textbook introduces the reader to the basic concepts of set theory, logic, the construction of number systems, combinatorics, elementary number theory, graph theory, (linear) algebra and probability theory. Considering the choice of material, motivating examples and style of presentation, it is most suitable for students of computer science (e.g. both the chapters on logic and graphs emphasize algorithmic aspects), but potentially also a useful source for beginner students of mathematics.NEWLINENEWLINE The book stands out through its remarkable combination of concise presentation and richness in content: It is, e.g., surprising to find treatments of axiomatic set theory with urelements, the axiom of choice, the existence of bases and the equality of their cardinality for general vector spaces in such a book, but the author manages to give both thorough foundations and extensive treatments of his various topics while keeping the presentation short. One might expect this to happen at the cost of intelligibility, but this is not the case: The presentation is adapted to inexperienced readers in an excellent way. Topics and notions are usually motivated both by well-chosen examples and remarks on their use in the coming development and practical applications. Formal definitions are preceeded by illustrative comments, remarks, examples and graphics. An additional valuable aid at understanding are numerous notes of caution concerning conflicts with the notation in other presentations or tempting misinterpretations of certain notions. With only a few exceptions (e.g. the proof of Zorn's Lemma from the axiom of choice), all claims are proved with adequate rigor, without losing intelligibility. Each chapter contains numerous exercises that are well in accord with the content of that chapter.NEWLINENEWLINETopics of a more theoretical flavour -- as, e.g. the treatment of transfinite cardinals or precise constructions of \(\mathbb{Z}\), \(\mathbb{Q}\) and \(\mathbb{R}\) -- are often followed by a remark emphasizing their theoretical relevance or their relation to practical considerations. Various historical remarks and footnotes provide an additional guide to a thorough understanding of the material.NEWLINENEWLINE Expect for the foundational chapters on sets and functions, the chapters are mostly independent from each other which makes the book suitable as a reference work. Advanced material is treated in separate sections indicated with an asterisk.NEWLINENEWLINEAll in all, this is a great textbook for beginner students in computer science and mathematics; teachers of the subjects treated therein may also profit from the well-thought presentation.
0 references
0.8271308541297913
0 references