LEADER 03633oam  2200577I  450 
001 9910468010203321
005 20200520144314.0
010   $a0-429-14793-7
010   $a1-4200-9365-7
024 7 $a10.1201/b16005 
035   $a(CKB)4580000000000096
035   $a(MiAaPQ)EBC5379135
035   $a(Au-PeEL)EBL5379135
035   $a(CaPaEBR)ebr11554475
035   $a(OCoLC)1035519175
035   $a(OCoLC)1005684586
035   $a(EXLCZ)994580000000000096
100   $a20180706d2014      uy             0
101 0 $aeng
135   $aurcnu||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aHandbook of Mathematical Induction $eTheory and Applications
205   $aFirst edition.
210  1$aBoca Raton, FL :$cCRC Press,$d2014.
215   $a1 online resource (xxv, 893 pages) $cillustrations
225 1 $aDiscrete mathematics and its applications
311   $a1-138-19901-X 
311   $a1-4200-9364-9 
320   $aIncludes bibliographical references and indexes.
327   $aWhat is mathematical induction? -- Foundations -- Variants of finite mathematical induction -- Inductive techniques applied to the infinite -- Paradoxes and sophisms from induction -- Empirical induction -- How to prove by induction -- The written MI proof -- Identities -- Inequalities -- Number theory -- Sequences -- Sets -- Logic and language -- Graphs -- Recursion and algorithms -- Games and recreations -- Relations and functions -- Linear and abstract algebra -- Geometry -- Ramsey theory -- Probability and statistics.
330 2 $a"Handbook of Mathematical Induction: Theory and Applications shows how to find and write proofs via mathematical induction. This comprehensive book covers the theory, the structure of the written proof, all standard exercises, and hundreds of application examples from nearly every area of mathematics.In the first part of the book, the author discusses different inductive techniques, including well-ordered sets, basic mathematical induction, strong induction, double induction, infinite descent, downward induction, and several variants. He then introduces ordinals and cardinals, transfinite induction, the axiom of choice, Zorns lemma, empirical induction, and fallacies and induction. He also explains how to write inductive proofs.The next part contains more than 750 exercises that highlight the levels of difficulty of an inductive proof, the variety of inductive techniques available, and the scope of results provable by mathematical induction. Each self-contained chapter in this section includes the necessary definitions, theory, and notation and covers a range of theorems and problems, from fundamental to very specialized. The final part presents either solutions or hints to the exercises. Slightly longer than what is found in most texts, these solutions provide complete details for every step of the problem-solving process."--Provided by publisher.
410  0$aCRC Press series on discrete mathematics and its applications.
606   $aProof theory
606   $aInduction (Mathematics)
606   $aLogic, Symbolic and mathematical
606   $aProbabilities
608   $aElectronic books.
615  0$aProof theory.
615  0$aInduction (Mathematics)
615  0$aLogic, Symbolic and mathematical.
615  0$aProbabilities.
676   $a511.3/6
700   $aGunderson$b David S.$0863126
801  0$bFlBoTFG
801  1$bFlBoTFG
906   $aBOOK
912   $a9910468010203321
996   $aHandbook of Mathematical Induction$91926841
997   $aUNINA