Using Grossone to count the number of elements of infinite sets and the connection with bijections
classification
💻 cs.DM
keywords
elementsnumberconnectioncountlooknumeralsystembijection
read the original abstract
In this paper, we look at how to count the number of elements of a set within the frame of Sergeyev's numeral system. We also look at the connection between the number of elements of a set and the notion of bijection in this new setting. We also show the difference between this new numeral system and the results of the traditional naive set theory.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.