Introduction to Mathematical Proofs

Regular price €117.99
Quantity:
In stock with our UK publisher. 14-28 days
Delivery/Collection within 10-20 working days
14 days return policy Shipping & Delivery
A01=Nicholas A. Loehr
advanced proof strategies for beginners
Arrow Diagram
Author_Nicholas A. Loehr
Cantor's Theorem
Cantor’s Theorem
cardinality concepts
Category=PBC
Countable Sets
Curly Braces
Denial Rules
Distinct Equivalence Classes
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
equivalence classes
Equivalence Relation
formal logic techniques
GCD
IFF
induction proofs
Injective Function
linear algebra
logic
Logically Equivalent
mathematical proof methods
mathematical reasoning
moore method
Nonempty Index Sets
Number Systems
number theory
Pairwise Disjoint
Pairwise Disjoint Sets
prime factorizations
proofs
recursive definitions
Round Parentheses
Set Membership Relation
Set Partition
set theory
sets
Single Valuedness Condition
Sum Rule
transition
Truth Tables
Uncountable Sets
Unique Prime Factorization
Unquantified Variables
Unrestricted Quantifiers

Product details

  • ISBN 9780367338237
  • Weight: 950g
  • Dimensions: 178 x 254mm
  • Publication Date: 11 Oct 2019
  • Publisher: Taylor & Francis Ltd
  • Publication City/Country: GB
  • Product Form: Hardback
Secure checkout Fast Shipping Easy returns

An 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.

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.

More from this author