Show simple item record

dc.contributor.authorShmalo, Yitzchak
dc.descriptionThe file is restricted for YU community access only.
dc.description.abstractIn 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.en_US
dc.description.sponsorshipJay and Jeanie Schottenstein Honors Programen_US
dc.publisherYeshiva Collegeen_US
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 United States*
dc.subjectSet theory.en_US
dc.subjectLogic, Symbolic and mathematical.en_US
dc.titleProofs of the Cantor-Bernstein Theoremen_US

Files in this item


This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 United States
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 United States