We consider a notion of “numerosity” for sets of tuples of natural numbers, that satisfies the five common notions of Euclid’s Elements, so it can agree with cardinality only for finite sets. By suitably axiomatizing such a no- tion, we show that, contrasting to cardinal arithmetic, the natural “Cantorian” definitions of order relation and arithmetical operations provide a very good algebraic structure. In fact, numerosities can be taken as the non-negative part of a discretely ordered ring, namely the quotient of a formal power series ring modulo a suitable (“gauge”) ideal. In particular, special numerosities, called “natural”, can be identified with the semiring of hypernatural numbers of appropriate ultrapowers of N
Generalizations of numeration systems in which \(\N\) is recognizable by a finite automaton are obta...
In this paper we introduce the notion of elementary numerosity as a special function defined on all ...
AbstractGeneralizations of numeration systems in which N is recognizable by a finite automaton are o...
Abstract. The notions of “labelled set ” and “numerosity ” are introduced to generalize the counting...
We axiomatize a notion of size for collections (numerosity) that satisfies the five com-mon notions ...
The generalization of the concept of natural integers by means of sum, subtraction, product and quot...
We introduce a "Euclidean" notion of size (numerosity) for "Punktmengen", i.e. sets of points of Euc...
The natural numbers are presented first in the master's thesis. We introduced them through Pean axio...
This paper explains the Cardinality of the Power Set of Natural numbers. Set of Natural numbers is c...
In this article we consider the ordered algebraic structures of thesystems of natural numbers, integ...
The arithmetic of natural numbers has a natural and simple encoding within sets, and the simplest se...
The naıve idea of “size” for collections seems to obey both to Aristotle’s Principle: “the whole is ...
International audienceLet p/q be a rational number. Numeration in base p/q is defined by a function ...
independent of all of them, but only based upon logic. This conservative concept, however, needs to ...
Abstract: In this paper we introduce the notion of elementary numerosity as a special function defin...
Generalizations of numeration systems in which \(\N\) is recognizable by a finite automaton are obta...
In this paper we introduce the notion of elementary numerosity as a special function defined on all ...
AbstractGeneralizations of numeration systems in which N is recognizable by a finite automaton are o...
Abstract. The notions of “labelled set ” and “numerosity ” are introduced to generalize the counting...
We axiomatize a notion of size for collections (numerosity) that satisfies the five com-mon notions ...
The generalization of the concept of natural integers by means of sum, subtraction, product and quot...
We introduce a "Euclidean" notion of size (numerosity) for "Punktmengen", i.e. sets of points of Euc...
The natural numbers are presented first in the master's thesis. We introduced them through Pean axio...
This paper explains the Cardinality of the Power Set of Natural numbers. Set of Natural numbers is c...
In this article we consider the ordered algebraic structures of thesystems of natural numbers, integ...
The arithmetic of natural numbers has a natural and simple encoding within sets, and the simplest se...
The naıve idea of “size” for collections seems to obey both to Aristotle’s Principle: “the whole is ...
International audienceLet p/q be a rational number. Numeration in base p/q is defined by a function ...
independent of all of them, but only based upon logic. This conservative concept, however, needs to ...
Abstract: In this paper we introduce the notion of elementary numerosity as a special function defin...
Generalizations of numeration systems in which \(\N\) is recognizable by a finite automaton are obta...
In this paper we introduce the notion of elementary numerosity as a special function defined on all ...
AbstractGeneralizations of numeration systems in which N is recognizable by a finite automaton are o...