05826cam a2200565Mu 45000010014000000030008000140050017000220060019000390070015000580080041000730400026001140200018001400200015001580200032001730200015002050200038002200200015002580200027002730200015003000200025003150240031003400350022003710350024003930500011004170720025004280720025004530720025004780720015005030820012005181000023005302450067005532600036006203000032006563360021006883360028007093370023007373380032007604900034007925000052008265052498008785201508033765880047048846500018049316500049049496500033049986500038050318560072050698560102051419990017052439780429322587FlBoTFG20260210180849.0m        d        cr cnu---unuuu191123s2019    xx      o     000 0 eng d  aOCoLC-PbengcOCoLC-P  a9781000709629  a1000709620  a9781000709803q(ePub ebook)  a1000709809  a9781000709711q(Mobipocket ebook)  a100070971X  a9780429322587q(ebook)  a0429322585  z9780367338237 (hbk.)7 a10.1201/97804293225872doi  a(OCoLC)1128466687  a(OCoLC-P)1128466687 4aQA39.2 7aMATx0340002bisacsh 7aMATx0180002bisacsh 7aMATx0280002bisacsh 7aPB2bicssc04a5102231 aLoehr, Nicholas A.13aAn Introduction to Mathematical Proofsh[electronic resource].  aMilton :bCRC Press LLC,c2019.  a1 online resource (413 p.).  atext2rdacontent  astill image2rdacontent  acomputer2rdamedia  aonline resource2rdacarrier1 aTextbooks in Mathematics Ser.  aDescription based upon print version of record.0 a<P>Logic</P><P>Propositions; Logical Connectives; Truth Tables</P><P>Logical Equivalence; IF-Statements</P><P>IF, IFF, Tautologies, and Contradictions</P><P>Tautologies; Quantifiers; Universes</P><P>Properties of Quantifiers: Useful Denials</P><P>Denial Practice; Uniqueness</P><P></P><B><P>Proofs</P></B><P>Definitions, Axioms, Theorems, and Proofs</P><P>Proving Existence Statements and IF Statements</P><P>Contrapositive Proofs; IFF Proofs</P><P>Proofs by Contradiction; OR Proofs</P><P>Proof by Cases; Disproofs</P><P>Proving Universal Statements; Multiple Quantifiers</P><P>More Quantifier Properties and Proofs (Optional)</P><P></P><B><P>Sets</P></B><P>Set Operations; Subset Proofs</P><P>More Subset Proofs; Set Equality Proofs</P><P>More Set Quality Proofs; Circle Proofs; Chain Proofs</P><P>Small Sets; Power Sets; Contrasting ? and ⁶</P><P>Ordered Pairs; Product Sets</P><P>General Unions and Intersections</P><P>Axiomatic Set Theory (Optional)</P><P></P><B><P>Integers</P></B><P>Recursive Definitions; Proofs by Induction</P><P>Induction Starting Anywhere: Backwards Induction</P><P>Strong Induction</P><P>Prime Numbers; Division with Remainder</P><P>Greatest Common Divisors; Euclid's GCD Algorithm</P><P>More on GCDs; Uniqueness of Prime Factorizations</P><P>Consequences of Prime Factorization (Optional)</P><P></P><B><P>Relations and Functions</P></B><P>Relations; Images of Sets under Relations</P><P>Inverses, Identity, and Composition of Relations</P><P>Properties of Relations</P><P>Definition of Functions</P><P>Examples of Functions; Proving Equality of Functions</P><P>Composition, Restriction, and Gluing</P><P>Direct Images and Preimages</P><P>Injective, Surjective, and Bijective Functions</P><P>Inverse Functions</P><P></P><B><P>Equivalence Relations and Partial Orders</P></B><P>Reflexive, Symmetric, and Transitive Relations</P><P>Equivalence Relations</P><P>Equivalence Classes</P><P>Set Partitions</P><P>Partially Ordered Sets</P><P>Equivalence Relations and Algebraic Structures (Optional)</P><P></P><B><P>Cardinality</P></B><P>Finite Sets</P><P>Countably Infinite Sets</P><P>Countable Sets</P><P>Uncountable Sets</P><P></P><B><P>Real Numbers (Optional)</P></B><P>Axioms for R; Properties of Addition</P><P>Algebraic Properties of Real Numbers</P><P>Natural Numbers, Integers, and Rational Numbers</P><P>Ordering, Absolute Value, and Distance</P><P>Greatest Elements, Least Upper Bounds, and Completeness</P><P></P><B><P>Suggestions for Further Reading</P></B>  aAn Introduction to Mathematical Proofs presents fundamental material on logic, proof methods, set theory, number theory, relations, functions, cardinality, and the real number system. The text uses a methodical, detailed, and highly structured approach to proof techniques and related topics. No prerequisites are needed beyond high-school algebra. New material is presented in small chunks that are easy for beginners to digest. The author offers a friendly style without sacrificing mathematical rigor. Ideas are developed through motivating examples, precise definitions, carefully stated theorems, clear proofs, and a continual review of preceding topics. Features Study aids including section summaries and over 1100 exercises Careful coverage of individual proof-writing skills Proof annotations and structural outlines clarify tricky steps in proofs Thorough treatment of multiple quantifiers and their role in proofs Unified explanation of recursive definitions and induction proofs, with applications to greatest common divisors and prime factorizations About the Author: Nicholas A. Loehr is an associate professor of mathematics at Virginia Technical University. He has taught at College of William and Mary, United States Naval Academy, and University of Pennsylvania. He has won many teaching awards at three different schools. He has published over 50 journal articles. He also authored three other books for CRC Press, including Combinatorics, Second Edition, and Advanced Linear Algebra.  aOCLC-licensed vendor bibliographic record. 0aProof theory. 7aMATHEMATICS / Mathematical Analysis2bisacsh 7aMATHEMATICS / Logic2bisacsh 7aMATHEMATICS / Set Theory2bisacsh403Taylor & Francisuhttps://www.taylorfrancis.com/books/9780429322587423OCLC metadata license agreementuhttp://www.oclc.org/content/dam/oclc/forms/terms/vbrl-201703.pdf  c92973d92972