You are here

A Principle of Countability

by Robert Kantrowitz (Hamilton College)

This article originally appeared in:
Mathematics Magazine
February, 2000

Subject classification(s): Logic and Foundations | Set Theory | Cardinality
Applicable Course(s): 4.11 Advanced Calc I, II, & Real Analysis

The set of finite words from a finite alphabet is countable; this principle is applied to show various sets are countable.

A pdf copy of the article can be viewed by clicking below. Since the copy is a faithful reproduction of the actual journal pages, the article may not begin at the top of the first page.

To open this file please click here.

These pdf files are furnished by JSTOR.

Classroom Capsules would not be possible without the contribution of JSTOR.

JSTOR provides online access to pdf copies of 512 journals, including all three print journals of the Mathematical Association of America: The American Mathematical Monthly, College Mathematics Journal, and Mathematics Magazine. We are grateful for JSTOR's cooperation in providing the pdf pages that we are using for Classroom Capsules.

Capsule Course Topic(s):
2.75
Average: 2.8 (59 votes)

Dummy View - NOT TO BE DELETED