Discrete Mathematics: Synthesis Lectures on Mathematics & Statistics
Autor George Tourlakisen Limba Engleză Paperback – 5 ian 2025
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (1) | 316.13 lei 38-44 zile | |
| Springer International Publishing – 5 ian 2025 | 316.13 lei 38-44 zile | |
| Hardback (1) | 319.42 lei 3-5 săpt. | |
| Springer International Publishing – 4 ian 2024 | 319.42 lei 3-5 săpt. |
Din seria Synthesis Lectures on Mathematics & Statistics
-
Preț: 254.42 lei -
Preț: 402.16 lei -
Preț: 334.96 lei - 15%
Preț: 529.05 lei -
Preț: 311.27 lei -
Preț: 310.18 lei -
Preț: 407.71 lei -
Preț: 343.91 lei -
Preț: 307.39 lei -
Preț: 314.77 lei -
Preț: 319.42 lei - 15%
Preț: 389.12 lei -
Preț: 293.73 lei -
Preț: 312.94 lei -
Preț: 403.10 lei -
Preț: 210.07 lei -
Preț: 294.52 lei - 15%
Preț: 388.37 lei -
Preț: 310.18 lei -
Preț: 347.61 lei -
Preț: 403.10 lei - 15%
Preț: 476.65 lei -
Preț: 257.35 lei -
Preț: 398.30 lei -
Preț: 436.47 lei -
Preț: 401.07 lei -
Preț: 278.97 lei -
Preț: 256.02 lei -
Preț: 259.40 lei -
Preț: 470.04 lei -
Preț: 232.31 lei -
Preț: 359.62 lei -
Preț: 376.36 lei -
Preț: 196.38 lei -
Preț: 434.80 lei -
Preț: 368.43 lei -
Preț: 152.59 lei -
Preț: 438.14 lei -
Preț: 368.59 lei -
Preț: 342.26 lei -
Preț: 230.58 lei -
Preț: 469.11 lei -
Preț: 374.92 lei -
Preț: 322.97 lei -
Preț: 315.46 lei -
Preț: 249.97 lei -
Preț: 270.75 lei -
Preț: 197.09 lei -
Preț: 319.22 lei
Preț: 316.13 lei
Puncte Express: 474
Preț estimativ în valută:
55.93€ • 65.02$ • 48.48£
55.93€ • 65.02$ • 48.48£
Carte tipărită la comandă
Livrare economică 28 februarie-06 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783031304903
ISBN-10: 303130490X
Pagini: 272
Dimensiuni: 168 x 240 x 15 mm
Greutate: 0.46 kg
Editura: Springer International Publishing
Seria Synthesis Lectures on Mathematics & Statistics
ISBN-10: 303130490X
Pagini: 272
Dimensiuni: 168 x 240 x 15 mm
Greutate: 0.46 kg
Editura: Springer International Publishing
Seria Synthesis Lectures on Mathematics & Statistics
Cuprins
Elementary 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.
Notă biografică
George Tourlakis, Ph.D., is a Professor in the Department of Electrical Engineering and Computer Science at York University, Toronto, Canada. He obtained his B.Sc. in mechanical and electrical engineering from the National Technical University of Athens and his M.Sc. and Ph.D. in computer science from the University of Toronto. Dr. Tourlakis has authored eight books in computability, logic, and axiomatic set theory and has also authored several journal articles in computability and modal logic. His research interests include calculational logic, modal logic, proof theory, computability with partial oracles, and complexity theory.
Textul de pe ultima copertă
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:
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.
Caracteristici
Provides a concise approach with examples and exercises to help readers understand key definitions and theorems Features careful attention to current and updated terminology, mathematical techniques, and results Presents coverage of equivalence, order relations, minimal condition, and inductive definitions of functions