In this paper we consider the relative expressive power of two very common operators applicable to sets and multisets: the with and the union operators. For such operators we prove that they are not mutually expressible by means of existentially quantied formulae. In order to prove our results, canonical forms for set-theoretic and multisettheoretic formulae are established and a particularly natural axiomatization of multisets is given and studied.
CITATION STYLE
Dovier, A., Piazza, C., & Policriti, A. (2000). Comparing expressiveness of set constructor symbols. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1794, pp. 275–289). Springer Verlag. https://doi.org/10.1007/10720084_18
Mendeley helps you to discover research relevant for your work.