
A Friendly Introduction to Analysis
by Kosmala, Witold A.J.-
Free Shipping On Orders Over $35
Your order must be $35 or more to qualify for free economy shipping. Marketplace items, eBooks and apparel do not qualify towards the $35 purchase minimum.
Buy New
Buy Used
Rent Textbook
eTextbook
We're Sorry
Not Available
How Marketplace Works:
- This item is offered by an independent seller and not shipped from our warehouse
- Item details like edition and cover design may differ from our description; see seller's comments before ordering.
- Sellers much confirm and ship within two business days; otherwise, the order will be cancelled and refunded.
- Marketplace purchases cannot be returned to eCampus.com. Contact the seller directly for inquiries; if no response within two days, contact customer service.
- Additional shipping costs apply to Marketplace purchases. Review shipping costs at checkout.
Summary
Table of Contents
Fundamentals | |
Sets and Subsets | |
Operations on Sets | |
Sequences | |
Properties of Integers | |
Matrices | |
Mathematical Structures | |
Logic | |
Propositions and Logical Operations | |
Conditional Statements | |
Methods of Proof | |
Mathematical Induction | |
Counting | |
Permutations | |
Combinations | |
Pigeonhole Principle | |
Elements of Probability | |
Recurrence Relations | |
Relations and Digraphs | |
Product Sets and Partitions | |
Relations and Digraphs | |
Paths in Relations and Digraphs | |
Properties of Relations | |
Equivalence Relations | |
Computer Representation of Relations and Digraphs | |
Operations on Relations | |
Transitive Closure and Warshall's Algorithm | |
Functions | |
Functions | |
Functions for Computer Science | |
Growth of Functions | |
Permutation Functions | |
Order Relations and Structures | |
Partially Ordered Sets | |
Extremal Elements of Partially Ordered Sets | |
Lattices | |
Finite Boolean Algebras | |
Functions on Boolean Algebras | |
Circuit Design | |
Trees | |
Trees | |
Labeled Trees | |
Tree Searching | |
Undirected Trees | |
Minimal Spanning Trees | |
Topics in Graph Theory | |
Graphs | |
Euler Paths and Circuits | |
Hamiltonian Paths and Circuits | |
Transport Networks | |
Matching Problems | |
Coloring Graphs | |
Semigroups and Groups | |
Binary Operations, Revisited | |
Semigroups | |
Products and Quotients of Semigroups | |
Groups | |
Products and Quotients of Groups | |
Languages and Finite-State Machines | |
Languages | |
Representations of Special Grammars and Languages | |
Finite-State Machines | |
Semigroups, Machines, and Languages | |
Machines and Regular Languages | |
Simplification of Machines | |
Groups and Coding | |
Coding of Binary Information and Error Detection | |
Decoding and Error Correction | |
Public Key Cryptology | |
Algorithms and Pseudocode | |
Additional Experiments in Discrete Mathematics | |
Answers to Odd-Numbered Exercises | |
Answers to Chapter Tests | |
Index | |
Table of Contents provided by Publisher. All Rights Reserved. |
An electronic version of this book is available through VitalSource.
This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.
By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.
Digital License
You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.
More details can be found here.
A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.
Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.
Please view the compatibility matrix prior to purchase.