Open AccessMathematicsComputer Science
DOI: 10.1134/s2070046611030034

tlooto Summary

This paper looks at how the notion of bijections can be used within the frame of Sergeyev's numeral system, and gives two definitions for counting the number of elements of a set.

Abstract

In this paper, we look at how the notion of bijections can be used within the frame of Sergeyev’s numeral system. We give two definitions for counting the number of elements of a set and we explore the connections between these two definitions. We also show the difference between this new numeral system and the results of the traditional naive set theory.

Citation format

MARGENSTERN, Maurice. Using grossone to count the number of elements of infinite sets and the connection with bijections [preprint]. arXiv, 2011. arXiv:1106.2290.