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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
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.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : Books From California, Simi Valley, CA, Etats-Unis
hardcover. Etat : Very Good. N° de réf. du vendeur mon0003615278
Quantité disponible : 1 disponible(s)
Vendeur : Brook Bookstore On Demand, Napoli, NA, Italie
Etat : new. Questo è un articolo print on demand. N° de réf. du vendeur QJPAM9XPH3
Quantité disponible : Plus de 20 disponibles
Vendeur : Basi6 International, Irving, TX, Etats-Unis
Etat : Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. N° de réf. du vendeur ABEOCT25-235335
Quantité disponible : 3 disponible(s)
Vendeur : Books Puddle, Woodside, NY, Etats-Unis
Etat : New. 1st ed. 2024 edition NO-PA16APR2015-KAP. N° de réf. du vendeur 26396297927
Quantité disponible : 4 disponible(s)
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. N° de réf. du vendeur 401127704
Quantité disponible : 4 disponible(s)
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Etat : New. N° de réf. du vendeur 18396297933
Quantité disponible : 4 disponible(s)
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Buch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book is ideal for afirst or second year discrete mathematics course formathematics, 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 theminimal conditionare studied in detail with the latter shown to be equivalent to theinduction principle. Mathematical induction is illustrated with several examples and is followed by a thorough exposition of inductive definitions offunctionsandsets. 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. 272 pp. Englisch. N° de réf. du vendeur 9783031304873
Quantité disponible : 2 disponible(s)
Vendeur : moluna, Greven, Allemagne
Gebunden. Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Provides a concise approach with examples and exercises to help readers understand key definitions and theoremsFeatures careful attention to current and updated terminology, mathematical techniques, and resultsPresents coverage of equivalen. N° de réf. du vendeur 834045530
Quantité disponible : Plus de 20 disponibles
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Buch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This book is ideal for afirst or second year discrete mathematics course formathematics, 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 theminimal conditionare studied in detail with the latter shown to be equivalent to theinduction principle. Mathematical induction is illustrated with several examples and is followed by a thorough exposition of inductive definitions offunctionsandsets. 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. N° de réf. du vendeur 9783031304873
Quantité disponible : 1 disponible(s)
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Buch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 272 pp. Englisch. N° de réf. du vendeur 9783031304873
Quantité disponible : 1 disponible(s)