| 000 | 03869nam a22005535i 4500 | ||
|---|---|---|---|
| 001 | 978-3-031-30488-0 | ||
| 003 | DE-He213 | ||
| 005 | 20251030110909.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 240103s2024 sz | s |||| 0|eng d | ||
| 020 |
_a9783031304880 _9978-3-031-30488-0 |
||
| 024 | 7 |
_a10.1007/978-3-031-30488-0 _2doi |
|
| 050 | 4 | _aQA297.4 | |
| 072 | 7 |
_aPBD _2bicssc |
|
| 072 | 7 |
_aMAT008000 _2bisacsh |
|
| 072 | 7 |
_aPBD _2thema |
|
| 100 | 1 |
_aTourlakis, George. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut _968948 |
|
| 245 | 1 | 0 |
_aDiscrete Mathematics _h[electronic resource] : _bA Concise Introduction / _cby George Tourlakis. |
| 250 | _a1st ed. 2024. | ||
| 264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2024. |
|
| 300 |
_aXVIII, 253 p. 24 illus., 2 illus. in color. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aSynthesis Lectures on Mathematics & Statistics, _x1938-1751 |
|
| 505 | 0 | _aElementary Informal Set Theory -- Safe Set Theory -- Relations and Functions -- A Tiny Bit of Informal Logic -- Inductively Defined Sets and Structural Induction -- Recurrence Equations -- Trees and Graphs. | |
| 520 | _aThis 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 | 0 | _aDiscrete mathematics. | |
| 650 | 0 |
_aComputer science _xMathematics. _964041 |
|
| 650 | 0 |
_aSet theory. _968949 |
|
| 650 | 0 |
_aMathematical logic. _966195 |
|
| 650 | 1 | 4 | _aDiscrete Mathematics. |
| 650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
| 650 | 2 | 4 |
_aApplications of Discrete Mathematics. _967427 |
| 650 | 2 | 4 |
_aSet Theory. _968950 |
| 650 | 2 | 4 |
_aGeneral Logic. _968951 |
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783031304873 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783031304897 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783031304903 |
| 830 | 0 |
_aSynthesis Lectures on Mathematics & Statistics, _x1938-1751 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-031-30488-0 |
| 912 | _aZDB-2-SXSC | ||
| 999 |
_c57016 _d57016 |
||