|Abstract||One of the relations used with granularity is indistinguishability, where distinguishable entities in a finer-grained granule are indistinguishable in a coarser-grained granule. This relation is a subtype of equivalence relation, which is used in the other direction to create finer-grained granules. Together with the notion of similarity, we formally prove some intuitive properties of the indistinguishability relation for both qualitative and quantitative granularity, that with a given granulation there must be at least two granules (levels of granularity) for it to be granular, and derive a strict order between finer and coarser granules. Based on these results, granulation hierarchy is defined as extra assisting structure to augment implementations.|
|Keywords||No keywords specified (fix it)|
No categories specified
(categorize this paper)
|Through your library||Only published papers are available at libraries|
Similar books and articles
Vladimir Kanovei (1997). An Ulm-Type Classification Theorem for Equivalence Relations in Solovay Model. Journal of Symbolic Logic 62 (4):1333-1351.
Pilar Dellunde I. Clavé (2000). On Definability of the Equality in Classes of Algebras with an Equivalence Relation. Studia Logica 64 (3):345 - 353.
Pilar Dellunde I. Clavé (2000). On Definability of the Equality in Classes of Algebras with an Equivalence Relation. Studia Logica 64 (3):345-353.
Willem M. Muynck & Gidi P. Liempd (1986). On the Relation Between Indistinguishability of Identical Particles and (Anti)Symmetry of the Wave Function in Quantum Mechanics. Synthese 67 (3):477 - 496.
Stevan Harnad (2000). Minds, Machines and Turing: The Indistinguishability of Indistinguishables. Journal of Logic, Language and Information 9 (4):425-445.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads1 ( #291,771 of 722,868 )
Recent downloads (6 months)0
How can I increase my downloads?