We study generalized multisets (multisets that allow possible negative multiplicities) both in the Zermelo-Fraenkel framework and in the finitely supported mathematics. We extend the notion of generalized multiset over a finite alphabet, and we replace it by the notion of algebraically finitely supported generalized multiset over a possibly infinite alphabet. We analyze the correspondence between some properties of generalized multisets obtained in finitely supported mathematics where only finitely supported objects are allowed, and those obtained in the classical Zermelo-Fraenkel framework.
Publié le : 2016-03-01
Classification:
Theoretical Foundations; other areas of Computing and Informatics,
Generalized multiset, invariant set, finitely supported mathematics, invariant group, infinite alphabet
@article{cai539,
author = {Andrei Alexandru; Institute of Computer Science, Romanian Academy, Iasi 700481 and Gabriel Ciobanu; Institute of Computer Science, Romanian Academy, Iasi 700481},
title = {Generalized Multisets: From ZF to FSM},
journal = {Computing and Informatics},
volume = {34},
number = {4},
year = {2016},
language = {en},
url = {http://dml.mathdoc.fr/item/cai539}
}
Andrei Alexandru; Institute of Computer Science, Romanian Academy, Iasi 700481; Gabriel Ciobanu; Institute of Computer Science, Romanian Academy, Iasi 700481. Generalized Multisets: From ZF to FSM. Computing and Informatics, Tome 34 (2016) no. 4, . http://gdmltest.u-ga.fr/item/cai539/