Nicholas A. Loehr
An Introduction to Mathematical Proofs (eBook, ePUB)
45,95 €
45,95 €
inkl. MwSt.
Sofort per Download lieferbar
23 °P sammeln
45,95 €
Als Download kaufen
45,95 €
inkl. MwSt.
Sofort per Download lieferbar
23 °P sammeln
Jetzt verschenken
Alle Infos zum eBook verschenken
45,95 €
inkl. MwSt.
Sofort per Download lieferbar
Alle Infos zum eBook verschenken
23 °P sammeln
Nicholas A. Loehr
An Introduction to Mathematical Proofs (eBook, ePUB)
- Format: ePub
- Merkliste
- Auf die Merkliste
- Bewerten Bewerten
- Teilen
- Produkt teilen
- Produkterinnerung
- Produkterinnerung
Bitte loggen Sie sich zunächst in Ihr Kundenkonto ein oder registrieren Sie sich bei
bücher.de, um das eBook-Abo tolino select nutzen zu können.
Hier können Sie sich einloggen
Hier können Sie sich einloggen
Sie sind bereits eingeloggt. Klicken Sie auf 2. tolino select Abo, um fortzufahren.
Bitte loggen Sie sich zunächst in Ihr Kundenkonto ein oder registrieren Sie sich bei bücher.de, um das eBook-Abo tolino select nutzen zu können.
This book contains an introduction to mathematical proofs, including fundamental material on logic, proof methods, set theory, number theory, relations, functions, cardinality, and the real number system. The book is divided into approximately fifty brief lectures. Each lecture corresponds rather closely to a single class meeting.
- Geräte: eReader
- ohne Kopierschutz
- eBook Hilfe
- Größe: 3.26MB
Andere Kunden interessierten sich auch für
- Hongwei ChenClassical Analysis (eBook, ePUB)81,95 €
- Peter WinklerMathematical Puzzles (eBook, ePUB)27,95 €
- Peter WinklerMathematical Puzzles (eBook, ePUB)27,95 €
- Joseph KirtlandProofs 101 (eBook, ePUB)52,95 €
- Boris PritskerExpanding Mathematical Toolbox: Interweaving Topics, Problems, and Solutions (eBook, ePUB)48,95 €
- Sylvie BoldoComputer Arithmetic and Formal Proofs (eBook, ePUB)79,95 €
- Robert M. YoungAn Introduction to Non-Harmonic Fourier Series, Revised Edition, 93 (eBook, ePUB)60,95 €
-
-
-
This book contains an introduction to mathematical proofs, including fundamental material on logic, proof methods, set theory, number theory, relations, functions, cardinality, and the real number system. The book is divided into approximately fifty brief lectures. Each lecture corresponds rather closely to a single class meeting.
Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.
Produktdetails
- Produktdetails
- Verlag: Taylor & Francis
- Seitenzahl: 412
- Erscheinungstermin: 20. November 2019
- Englisch
- ISBN-13: 9781000709803
- Artikelnr.: 58279021
- Verlag: Taylor & Francis
- Seitenzahl: 412
- Erscheinungstermin: 20. November 2019
- Englisch
- ISBN-13: 9781000709803
- Artikelnr.: 58279021
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.
Logic
Propositions; Logical Connectives; Truth Tables
Logical Equivalence; IF-Statements
IF, IFF, Tautologies, and Contradictions
Tautologies; Quantifiers; Universes
Properties of Quantifiers: Useful Denials
Denial Practice; Uniqueness
Proofs
Definitions, Axioms, Theorems, and Proofs
Proving Existence Statements and IF Statements
Contrapositive Proofs; IFF Proofs
Proofs by Contradiction; OR Proofs
Proof by Cases; Disproofs
Proving Universal Statements; Multiple Quantifiers
More Quantifier Properties and Proofs (Optional)
Sets
Set Operations; Subset Proofs
More Subset Proofs; Set Equality Proofs
More Set Quality Proofs; Circle Proofs; Chain Proofs
Small Sets; Power Sets; Contrasting and
Ordered Pairs; Product Sets
General Unions and Intersections
Axiomatic Set Theory (Optional)
Integers
Recursive Definitions; Proofs by Induction
Induction Starting Anywhere: Backwards Induction
Strong Induction
Prime Numbers; Division with Remainder
Greatest Common Divisors; Euclid's GCD Algorithm
More on GCDs; Uniqueness of Prime Factorizations
Consequences of Prime Factorization (Optional)
Relations and Functions
Relations; Images of Sets under Relations
Inverses, Identity, and Composition of Relations
Properties of Relations
Definition of Functions
Examples of Functions; Proving Equality of Functions
Composition, Restriction, and Gluing
Direct Images and Preimages
Injective, Surjective, and Bijective Functions
Inverse Functions
Equivalence Relations and Partial Orders
Reflexive, Symmetric, and Transitive Relations
Equivalence Relations
Equivalence Classes
Set Partitions
Partially Ordered Sets
Equivalence Relations and Algebraic Structures (Optional)
Cardinality
Finite Sets
Countably Infinite Sets
Countable Sets
Uncountable Sets
Real Numbers (Optional)
Axioms for R; Properties of Addition
Algebraic Properties of Real Numbers
Natural Numbers, Integers, and Rational Numbers
Ordering, Absolute Value, and Distance
Greatest Elements, Least Upper Bounds, and Completeness
Suggestions for Further Reading
Propositions; Logical Connectives; Truth Tables
Logical Equivalence; IF-Statements
IF, IFF, Tautologies, and Contradictions
Tautologies; Quantifiers; Universes
Properties of Quantifiers: Useful Denials
Denial Practice; Uniqueness
Proofs
Definitions, Axioms, Theorems, and Proofs
Proving Existence Statements and IF Statements
Contrapositive Proofs; IFF Proofs
Proofs by Contradiction; OR Proofs
Proof by Cases; Disproofs
Proving Universal Statements; Multiple Quantifiers
More Quantifier Properties and Proofs (Optional)
Sets
Set Operations; Subset Proofs
More Subset Proofs; Set Equality Proofs
More Set Quality Proofs; Circle Proofs; Chain Proofs
Small Sets; Power Sets; Contrasting and
Ordered Pairs; Product Sets
General Unions and Intersections
Axiomatic Set Theory (Optional)
Integers
Recursive Definitions; Proofs by Induction
Induction Starting Anywhere: Backwards Induction
Strong Induction
Prime Numbers; Division with Remainder
Greatest Common Divisors; Euclid's GCD Algorithm
More on GCDs; Uniqueness of Prime Factorizations
Consequences of Prime Factorization (Optional)
Relations and Functions
Relations; Images of Sets under Relations
Inverses, Identity, and Composition of Relations
Properties of Relations
Definition of Functions
Examples of Functions; Proving Equality of Functions
Composition, Restriction, and Gluing
Direct Images and Preimages
Injective, Surjective, and Bijective Functions
Inverse Functions
Equivalence Relations and Partial Orders
Reflexive, Symmetric, and Transitive Relations
Equivalence Relations
Equivalence Classes
Set Partitions
Partially Ordered Sets
Equivalence Relations and Algebraic Structures (Optional)
Cardinality
Finite Sets
Countably Infinite Sets
Countable Sets
Uncountable Sets
Real Numbers (Optional)
Axioms for R; Properties of Addition
Algebraic Properties of Real Numbers
Natural Numbers, Integers, and Rational Numbers
Ordering, Absolute Value, and Distance
Greatest Elements, Least Upper Bounds, and Completeness
Suggestions for Further Reading
Logic
Propositions; Logical Connectives; Truth Tables
Logical Equivalence; IF-Statements
IF, IFF, Tautologies, and Contradictions
Tautologies; Quantifiers; Universes
Properties of Quantifiers: Useful Denials
Denial Practice; Uniqueness
Proofs
Definitions, Axioms, Theorems, and Proofs
Proving Existence Statements and IF Statements
Contrapositive Proofs; IFF Proofs
Proofs by Contradiction; OR Proofs
Proof by Cases; Disproofs
Proving Universal Statements; Multiple Quantifiers
More Quantifier Properties and Proofs (Optional)
Sets
Set Operations; Subset Proofs
More Subset Proofs; Set Equality Proofs
More Set Quality Proofs; Circle Proofs; Chain Proofs
Small Sets; Power Sets; Contrasting and
Ordered Pairs; Product Sets
General Unions and Intersections
Axiomatic Set Theory (Optional)
Integers
Recursive Definitions; Proofs by Induction
Induction Starting Anywhere: Backwards Induction
Strong Induction
Prime Numbers; Division with Remainder
Greatest Common Divisors; Euclid's GCD Algorithm
More on GCDs; Uniqueness of Prime Factorizations
Consequences of Prime Factorization (Optional)
Relations and Functions
Relations; Images of Sets under Relations
Inverses, Identity, and Composition of Relations
Properties of Relations
Definition of Functions
Examples of Functions; Proving Equality of Functions
Composition, Restriction, and Gluing
Direct Images and Preimages
Injective, Surjective, and Bijective Functions
Inverse Functions
Equivalence Relations and Partial Orders
Reflexive, Symmetric, and Transitive Relations
Equivalence Relations
Equivalence Classes
Set Partitions
Partially Ordered Sets
Equivalence Relations and Algebraic Structures (Optional)
Cardinality
Finite Sets
Countably Infinite Sets
Countable Sets
Uncountable Sets
Real Numbers (Optional)
Axioms for R; Properties of Addition
Algebraic Properties of Real Numbers
Natural Numbers, Integers, and Rational Numbers
Ordering, Absolute Value, and Distance
Greatest Elements, Least Upper Bounds, and Completeness
Suggestions for Further Reading
Propositions; Logical Connectives; Truth Tables
Logical Equivalence; IF-Statements
IF, IFF, Tautologies, and Contradictions
Tautologies; Quantifiers; Universes
Properties of Quantifiers: Useful Denials
Denial Practice; Uniqueness
Proofs
Definitions, Axioms, Theorems, and Proofs
Proving Existence Statements and IF Statements
Contrapositive Proofs; IFF Proofs
Proofs by Contradiction; OR Proofs
Proof by Cases; Disproofs
Proving Universal Statements; Multiple Quantifiers
More Quantifier Properties and Proofs (Optional)
Sets
Set Operations; Subset Proofs
More Subset Proofs; Set Equality Proofs
More Set Quality Proofs; Circle Proofs; Chain Proofs
Small Sets; Power Sets; Contrasting and
Ordered Pairs; Product Sets
General Unions and Intersections
Axiomatic Set Theory (Optional)
Integers
Recursive Definitions; Proofs by Induction
Induction Starting Anywhere: Backwards Induction
Strong Induction
Prime Numbers; Division with Remainder
Greatest Common Divisors; Euclid's GCD Algorithm
More on GCDs; Uniqueness of Prime Factorizations
Consequences of Prime Factorization (Optional)
Relations and Functions
Relations; Images of Sets under Relations
Inverses, Identity, and Composition of Relations
Properties of Relations
Definition of Functions
Examples of Functions; Proving Equality of Functions
Composition, Restriction, and Gluing
Direct Images and Preimages
Injective, Surjective, and Bijective Functions
Inverse Functions
Equivalence Relations and Partial Orders
Reflexive, Symmetric, and Transitive Relations
Equivalence Relations
Equivalence Classes
Set Partitions
Partially Ordered Sets
Equivalence Relations and Algebraic Structures (Optional)
Cardinality
Finite Sets
Countably Infinite Sets
Countable Sets
Uncountable Sets
Real Numbers (Optional)
Axioms for R; Properties of Addition
Algebraic Properties of Real Numbers
Natural Numbers, Integers, and Rational Numbers
Ordering, Absolute Value, and Distance
Greatest Elements, Least Upper Bounds, and Completeness
Suggestions for Further Reading