Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Bittner, Thomas; *
Affiliations: Philosophy Department, State University of New York at Buffalo, USA
Correspondence: [*] Corresponding author. E-mail: [email protected].
Note: [] Accepted by: Michael Gruninger
Abstract: Classical systems of mereology identify a maximuml set of jointly exhaustive and pairwise disjoint (RCC5) relations. The amount of information that is carried by each member of this set of (crisp) relations is determined by the number of bits of information that are required to distinguish all the members of the set. It is postulated in this paper, that vague mereological relations are limited in the amount of information they can carry. That is, if a crisp mereological relation can carry N bits of information, then a vague mereological relation can carry only 1⩽n<N bits. The aim of this paper is it to explore these ideas in the context of various systems of vague mereological relations. The resulting formalism is non-classical in the sense of quantum information theory.
Keywords: Mereology, RCC5 relations, vagueness, information, quantum information
DOI: 10.3233/AO-230277
Journal: Applied Ontology, vol. 18, no. 2, pp. 119-167, 2023
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]