| 000 -LEADER |
|---|
| fixed length control field |
a |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
250227b xxu||||| |||| 00| 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9783031304873 |
| Terms of availability |
(hbk) |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
511.1 |
| Item number |
TOU |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Tourlakis, George |
| 245 ## - TITLE STATEMENT |
|---|
| Title |
Discrete mathematics : a concise introduction |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
|---|
| Name of publisher, distributor, etc |
Springer, |
| Date of publication, distribution, etc |
2024 |
| Place of publication, distribution, etc |
Cham : |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xviii, 253 p. ; |
| Other physical details |
ill., |
| Dimensions |
25 cm |
| 365 ## - TRADE PRICE |
|---|
| Price amount |
39.99 |
| Price type code |
€ |
| Unit of pricing |
93.20 |
| 490 ## - SERIES STATEMENT |
|---|
| Series statement |
Synthesis Lectures on Mathematics & Statistics |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc |
Includes bibliographical references and index. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
This book is ideal for a first or second year discrete mathematics course for mathematics, engineering, and computer science majors. The author has extensively class-tested early conceptions of the book over the years and supplements mathematical arguments with informal discussions to aid readers in understanding the presented topics. “Safe” – that is, paradox-free – informal set theory is introduced following on the heels of Russell’s Paradox as well as the topics of finite, countable, and uncountable sets with an exposition and use of Cantor’s diagonalisation technique. Predicate logic “for the user” is introduced along with axioms and rules and extensive examples. Partial orders and the minimal condition are studied in detail with the latter shown to be equivalent to the induction principle. Mathematical induction is illustrated with several examples and is followed by a thorough exposition of inductive definitions of functions and sets. Techniques for solving recurrence relations including generating functions, the O- and o-notations, and trees are provided. Over 200 end of chapter exercises are included to further aid in the understanding and applications of discrete mathematics. In addition, this book: Provides a concise but mathematically rigorous and correct approach with examples and exercises to help readers understand key definitions and theorems; Features careful attention to current mathematical terminology, mathematical techniques, and results; Presents coverage of equivalence and order relations, minimal condition, and inductive definitions of functions and sets. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Discrete mathematics |
|
|---|
| Topical term or geographic name as entry element |
Transitive closure |
|
|---|
| Topical term or geographic name as entry element |
Axiomatic set theory |
|
|---|
| Topical term or geographic name as entry element |
Deduction theorem |
|
|---|
| Topical term or geographic name as entry element |
Equivalence relation |
|
|---|
| Topical term or geographic name as entry element |
Russell's paradox |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
|
| Item type |
Books |