Ship-Ship-Hooray! Free Shipping on $25+ Details >

Cover type: Hardback

Edition: 2ND 01

Copyright: 2001

Publisher: Addison-Wesley Longman, Inc.

Published: 2001

International: No

Edition: 2ND 01

Copyright: 2001

Publisher: Addison-Wesley Longman, Inc.

Published: 2001

International: No

List price: $118.00

Happy you, happy us. You get 24-hour turnaround. Free shipping on $25+, and dedicated customer service. Cue the smiley faces.

FREE Shipping on $25+

Order $25 or more and the shipping's on us. Marketplace items and other exclusions apply.

Ships Today!

Order by noon CST (Mon-Fri, excluding holidays). Some restrictions apply.

Easy 30-Day Returns

Not the right book for you? We accept returns within 30 days of purchase. Access codes are non-refundable once revealed or redeemed.

Ships directly from us

This title is currently not available in digital format.

Well, that's no good. Unfortunately, this edition is currently out of stock. Please check back soon.

Also available in the Marketplace starting at $100.03

Price | Condition | Seller | Comments |
---|

Chapter Zero is designed for the sophomore/junior level Introduction to Advanced Mathematics course. Written in a modified R.L. Moore fashion, it offers a unique approach in which students construct their own understandings. However, while students are called upon to write their own proofs, they are also encouraged to work in groups. There are few finished proofs contained in the text, but the author offers ''proof sketches'' and helpful technique tips to help students as they develop their proof writing skills. This book is most successful in a small, seminar style class.

**Schumacher, Carol : Kenyon College**

1. Introduction--an Essay

Mathematical Reasoning

Deciding What to Assume

What Is Needed to Do Mathematics?

Chapter Zero

2. Logic

Statements and Predicates

Mathematical Implication

Direct Proofs

Compound Statements and Truth Tables

Equivalence

Proof by Contrapositive

Negating Statements

Proof by Contradiction

Existence and Uniqueness

Proving Theorems: What Now?

3. Sets

Sets and Set Notation

Set Operations

Russell's Paradox

4. Relations and Ordering

Relations

Orderings

Equivalence Relations

5. Functions

Basic Ideas

Composition and Inverses

Order Isomorphisms

Sequences

Binary Operations

6. Induction

Inductive Reasoning and Mathematical Induction

Using Induction

Complete Induction

7. Elementary Number Theory

Natural Numbers and Integers

Divisibility in the Integers

The Euclidean Algorithm

Relatively Prime Integers

Prime Factorization

Congruence Modulo n

Divisibility Modulo n

8. Cardinality

Galileo's Paradox

Infinite Sets

Countable Sets

Beyond Countability

Comparing Cardinalities

The Continuum Hypothesis

Order Isomorphisms (Revisited)

9. The Real Numbers

Constructing the Axioms

Arithmetic

Order

The Least Upper Bound Axiom

Sequence Convergence in Real Numbers

A. Axiomatic Set Theory

Elementary Axioms

The Axiom of Infinity

Axioms of Choice and Substitution

B. Constructing R

From Natural Numbers to Integers

From Integers to Rational Numbers

From Rational Real Numbers to Real Numbers

Index

shop us with confidence

Summary

Chapter Zero is designed for the sophomore/junior level Introduction to Advanced Mathematics course. Written in a modified R.L. Moore fashion, it offers a unique approach in which students construct their own understandings. However, while students are called upon to write their own proofs, they are also encouraged to work in groups. There are few finished proofs contained in the text, but the author offers ''proof sketches'' and helpful technique tips to help students as they develop their proof writing skills. This book is most successful in a small, seminar style class.

Author Bio

**Schumacher, Carol : Kenyon College**

Table of Contents

1. Introduction--an Essay

Mathematical Reasoning

Deciding What to Assume

What Is Needed to Do Mathematics?

Chapter Zero

2. Logic

Statements and Predicates

Mathematical Implication

Direct Proofs

Compound Statements and Truth Tables

Equivalence

Proof by Contrapositive

Negating Statements

Proof by Contradiction

Existence and Uniqueness

Proving Theorems: What Now?

3. Sets

Sets and Set Notation

Set Operations

Russell's Paradox

4. Relations and Ordering

Relations

Orderings

Equivalence Relations

5. Functions

Basic Ideas

Composition and Inverses

Order Isomorphisms

Sequences

Binary Operations

6. Induction

Inductive Reasoning and Mathematical Induction

Using Induction

Complete Induction

7. Elementary Number Theory

Natural Numbers and Integers

Divisibility in the Integers

The Euclidean Algorithm

Relatively Prime Integers

Prime Factorization

Congruence Modulo n

Divisibility Modulo n

8. Cardinality

Galileo's Paradox

Infinite Sets

Countable Sets

Beyond Countability

Comparing Cardinalities

The Continuum Hypothesis

Order Isomorphisms (Revisited)

9. The Real Numbers

Constructing the Axioms

Arithmetic

Order

The Least Upper Bound Axiom

Sequence Convergence in Real Numbers

A. Axiomatic Set Theory

Elementary Axioms

The Axiom of Infinity

Axioms of Choice and Substitution

B. Constructing R

From Natural Numbers to Integers

From Integers to Rational Numbers

From Rational Real Numbers to Real Numbers

Index

Publisher Info

Publisher: Addison-Wesley Longman, Inc.

Published: 2001

International: No

Published: 2001

International: No

**Schumacher, Carol : Kenyon College**

1. Introduction--an Essay

Mathematical Reasoning

Deciding What to Assume

What Is Needed to Do Mathematics?

Chapter Zero

2. Logic

Statements and Predicates

Mathematical Implication

Direct Proofs

Compound Statements and Truth Tables

Equivalence

Proof by Contrapositive

Negating Statements

Proof by Contradiction

Existence and Uniqueness

Proving Theorems: What Now?

3. Sets

Sets and Set Notation

Set Operations

Russell's Paradox

4. Relations and Ordering

Relations

Orderings

Equivalence Relations

5. Functions

Basic Ideas

Composition and Inverses

Order Isomorphisms

Sequences

Binary Operations

6. Induction

Inductive Reasoning and Mathematical Induction

Using Induction

Complete Induction

7. Elementary Number Theory

Natural Numbers and Integers

Divisibility in the Integers

The Euclidean Algorithm

Relatively Prime Integers

Prime Factorization

Congruence Modulo n

Divisibility Modulo n

8. Cardinality

Galileo's Paradox

Infinite Sets

Countable Sets

Beyond Countability

Comparing Cardinalities

The Continuum Hypothesis

Order Isomorphisms (Revisited)

9. The Real Numbers

Constructing the Axioms

Arithmetic

Order

The Least Upper Bound Axiom

Sequence Convergence in Real Numbers

A. Axiomatic Set Theory

Elementary Axioms

The Axiom of Infinity

Axioms of Choice and Substitution

B. Constructing R

From Natural Numbers to Integers

From Integers to Rational Numbers

From Rational Real Numbers to Real Numbers

Index