CS336f1013

# CS336f1013 - 10/17/10 Lecture 13 CS336 Definition The sets...

This preview shows pages 1–3. Sign up to view the full content.

10/17/10 1 Lecture 13 CS336 Cardinality Definition • The sets A and B have the same cardinality if and only if there is a one-to-one correspondence between A and B. Definition • The initial definition of finiteness says a set is finite if we can “count” its elements. Counting means establishing a one-to-one correspondence with a set of consecutive integers beginning with 1 up to an integer n. The fact that is one-to-one and onto ensures that each element of A is counted (onto-ness) and that no element is counted more than once (one-to-one-ness). Example: What is the cardinality of {0,1}? Definition A set is infinite if it is not finite. Definition A set that is either finite or has the same cardinality as the set of positive integers is called countable. A set that is not countable is called uncountable. Example 1: Show that the set of even positive integers is countable. Example 1 Show that the set of even positive integers is countable.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
10/17/10 2 Example 1 Show that the set of even positive integers is
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 11/30/2010 for the course CS 336 taught by Professor Myers during the Fall '08 term at University of Texas.

### Page1 / 3

CS336f1013 - 10/17/10 Lecture 13 CS336 Definition The sets...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online