In this work I will examine and compare different proofs of the Cantor-Bernstein theorem.
Additionally, I will give a new and somewhat different proof. The Cantor-Bernstein Theorem
states that if there is an injective function, f, from a set A to a set B, and an injective function,
g, from the set B to the set A, then there exists a bijection, h, between A and B. This means
that the two sets have the same cardinality, that is, they have the same size.
The file is restricted for YU community access only.