Elements of Advanced Mathematics, Third Edition / Edition 3

Hardcover (Print)
Used and New from Other Sellers
Used and New from Other Sellers
from $19.93
Usually ships in 1-2 business days
(Save 78%)
Other sellers (Hardcover)
  • All (9) from $19.93   
  • New (6) from $67.92   
  • Used (3) from $19.93   

Overview

For many years, this classroom-tested, best-selling text has guided mathematics students to more advanced studies in topology, abstract algebra, and real analysis. Elements of Advanced Mathematics, Third Edition retains the content and character of previous editions while making the material more up-to-date and significant.

This third edition adds four new chapters on point-set topology, theoretical computer science, the P/NP problem, and zero-knowledge proofs and RSA encryption. The topology chapter builds on the existing real analysis material. The computer science chapters connect basic set theory and logic with current hot topics in the technology sector. Presenting ideas at the cutting edge of modern cryptography and security analysis, the cryptography chapter shows students how mathematics is used in the real world and gives them the impetus for further exploration. This edition also includes more exercises sets in each chapter, expanded treatment of proofs, and new proof techniques.

Continuing to bridge computationally oriented mathematics with more theoretically based mathematics, this text provides a path for students to understand the rigor, axiomatics, set theory, and proofs of mathematics. It gives them the background, tools, and skills needed in more advanced courses.

Read More Show Less

Editorial Reviews

From the Publisher
… one of the difficulties that students have with university mathematics is being able to relate it to what they’ve done at school. In this respect, the work on logic, sets, proof, relations and functions plays an essential bridging role. But another problem to be addressed is to re-present mathematics as a way of knowing—rather than a static body of formalised knowledge. In this book, Steven Krantz tackles this anomaly by including many open-ended problems in the rich collections of exercises. … The new chapters on theoretical computer science are concisely lucid, and I learned much by reading them. … this book engages the reader in really meaningful aspects of mathematics: it is well organized and is written with accuracy. … it is recommended as a possible course text for those who are planning to teach a foundation course.
—P.N. Ruane, MAA Reviews, July 2012

Retains the content and character of previous editions while making the material more up-to-date and significant. … gives readers the background, tools, and skills necessary in more advanced mathematical work.
L'Enseignement Mathematique, 2012

Read More Show Less

Product Details

  • ISBN-13: 9781439898345
  • Publisher: Taylor & Francis
  • Publication date: 4/2/2012
  • Edition description: New Edition
  • Edition number: 3
  • Pages: 367
  • Product dimensions: 6.30 (w) x 9.30 (h) x 0.90 (d)

Meet the Author

Steven G. Krantz is a professor of mathematics at Washington University in St. Louis, Missouri. He has published over 150 papers and nearly 70 books and has been an editor of several journals. He earned a Ph.D. in mathematics from Princeton University. His research interests include complex variables, harmonic analysis, partial differential equations, geometry, interpolation of operators, and real analysis.

Read More Show Less

Table of Contents

Basic Logic
Principles of Logic
Truth
"And" and "Or"
"Not"
"If-Then"
Contrapositive, Converse, and "Iff"
Quantifiers
Truth and Provability

Methods of Proof
What Is a Proof?
Direct Proof
Proof by Contradiction
Proof by Induction
Other Methods of Proof

Set Theory
Undefinable Terms
Elements of Set Theory
Venn Diagrams
Further Ideas in Elementary Set Theory
Indexing and Extended Set Operations

Relations and Functions
Relations
Order Relations
Functions
Combining Functions
Cantor’s Notion of Cardinality

Axioms of Set Theory, Paradoxes, and Rigor
Axioms of Set Theory
The Axiom of Choice
Independence and Consistency
Set Theory and Arithmetic

Number Systems
The Natural Number System
The Integers
The Rational Numbers
The Real Number System
The Nonstandard Real Number System
The Complex Numbers
The Quaternions, the Cayley Numbers, and Beyond

More on the Real Number System
Introductory Remark
Sequences
Open Sets and Closed Sets
Compact Sets
The Cantor Set

A Glimpse of Topology
What Is Topology?
First Definitions
Mappings
The Separation Axioms
Compactness

Theoretical Computer Science
Introductory Remarks
Primitive Recursive Functions
General Recursive Functions
Description of Boolean Algebra
Axioms of Boolean Algebra
Theorems in Boolean Algebra
Illustration of the Use of Boolean Logic
The Robbins Conjecture

The P/NP Problem
Introduction
The Complexity of a Problem
Comparing Polynomial and Exponential Complexity
Polynomial Complexity
Assertions That Can Be Verified in Polynomial Time
Nondeterministic Turing Machines
Foundations of NP-Completeness
Polynomial Equivalence
Definition of NP-Completeness

Examples of Axiomatic Theories
Group Theory
Euclidean and Non-Euclidean Geometry

Zero-Knowledge Proofs
Basics and Background
Preparation for RSA
The RSA System Enunciated
The RSA Encryption System Explicated
Zero-Knowledge Proofs

Solutions to Selected Exercises

Bibliography

Index

Exercises appear at the end of each chapter.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)