Qualitative representations of mereological structures in Artificial Intelligence are generally based on a set of mutually exclusive and collectively exhaustive crisp (RCC5) relations. The amount of information carried by each element in this set of (crisp) relations is determined by the number of bits (N) required to distinguish all members of the set. This paper posits that mereological vagueness can arise if mereological relations are limited in the amount of information they can carry. Consequently, a comprehensive set of vague mereological relations is introduced, where each relation in this set can only carry 0 < n < N bits of information. In this framework, mereological information is treated as quantum information, with quantum bits (qubits) distinguishing relations subject to ontic vagueness. The main contribution is the thorough examination of mereological relations within a 3 qubit quantum system. Quantum bits are not represented as vectors in a Hilbert space but as cells in (granular) partitions. This paper is the companion to the author's quantized-mereology framework and develops its entangled-state layer: the combination of three simultaneous elementary questions, the families of entangled information states, the probability distribution for possible observations and the dynamics induced by sequences of non-simultaneous questions.
Qualitative representations of mereological structures in Artificial Intelligence are generally based on a set of mutually exclusive and collectively exhaustive crisp (RCC5) relations. The amount of information carried by each element in this set of (crisp) relations is determined by the number of bits (N) required to distinguish all members of the set. This paper posits that mereological vagueness can arise if mereological relations are limited in the amount of information they can carry. Consequently, a comprehensive set of vague mereological relations is introduced, where each relation in this set can only carry 0 < n < N bits of information. In this framework, mereological information is treated as quantum information, with quantum bits (qubits) distinguishing relations subject to ontic vagueness. The main contribution is the thorough examination of mereological relations within a 3 qubit quantum system. Quantum bits are not represented as vectors in a Hilbert space but as cells in (granular) partitions. This paper is the companion to the author's quantized-mereology framework and develops its entangled-state layer: the combination of three simultaneous elementary questions, the families of entangled information states, the probability distribution for possible observations and the dynamics induced by sequences of non-simultaneous questions.
This paper investigates quantized mereology, which merges quantum information theory with classical mereology, the formal analysis of the part-whole relationship. It emphasizes that information about crisp mereological relations is captured by classical bits, whereas mereological vagueness involves the use of quantum bits, or qubits, to capture mereological information. Transitioning from classical bits to qubits offers a new understanding of part-whole relations among entities that are subject to mereological vagueness. This paper methodically studies the quantized mereology that arises from the classical RCC5 formalism, one of the most widely studied formalisms in Qualitative Reasoning (QR), a subfield of Artificial Intelligence. The argument is made that this method can be extended to quantize more sophisticated QR formalisms, mirroring how strategies are used in physics to transition from classical to quantum systems. The study explores: (i) the conversion of bits to qubits while understanding that these (qu)bits convey mereological information; (ii) the representation of qubit states via set partitions, acknowledging that set theory aligns more closely with classical logic than with the complex vector spaces employed in quantum physics; (iii) demonstrating that classical QR formalisms can be seen as special cases within quantized formalisms; and (iv) showing that qubits more effectively encapsulate information about vague phenomena.
The successful application of quantum probability in cognitive science has been persistently challenged by the foundational 'why quantum?' question. In this paper, a novel answer is proposed through the development of an ontological grounding for the quantum-like structures observed in human judgment. It is argued that these cognitive structures may be a direct reflection of an objective, information-theoretic vagueness inherent in the macroscopic world. To formalize this, 'Quantized Mereology' is developed - a framework inspired by Rovelli's Relational Quantum Mechanics (RQM), where determinate mereological facts about vague entities like forests and clouds are established relationally through an act of judgment. The framework uses a real-valued Hilbert space as a precise object language, which is given meaning by a partition-theoretic meta-language. A key contribution is a defense of the real-valued structure, in which it is argued that the physical constraints necessitating complex numbers in microphysics constitute a category error when applied to the conceptual systems modeled herein. The result is a generative model for objective vagueness that provides a candidate ontological foundation for quantum cognition.
Abstract The emerging field of quantum mereology considers part-whole relations in quantum systems. Entangled quantum systems pose a peculiar problem in the field, since their total states are not reducible to that of their parts. While there exist several established proposals for modelling entangled systems, like monistic holism or relational holism, there is considerable unclarity, which further positions are available. Using the lambda operator and plural logic as formal tools, we review and develop conceivable models and evaluate their consistency and distinctness. The main result is an exhaustive taxonomy of six distinct and precise models that both provide information about the mereological features as well as about the entangled property. The taxonomy is well-suited to serve as the basis for future systematic investigations.
Quantum information is defined by applying the concepts of ordinary (Shannon) information theory to a quantum sample space consisting of a single framework or consistent family. A classical analogy for a spin-half particle and other arguments show that the infinite amount of information needed to specify a precise vector in its Hilbert space is not a measure of the information carried by a quantum entity with a d-dimensional Hilbert space; the latter is, instead, bounded by log2d bits (one bit per qubit). The two bits of information transmitted in dense coding are located not in one but in the correlation between two qubits, consistent with this bound. A quantum channel can be thought of as a structure or collection of frameworks, and the physical location of the information in the individual frameworks can be used to identify the location of the channel. Analysis of a quantum circuit used as a model of teleportation shows that the location of the channel depends upon which structure is employed; for ordinary teleportation it is not (contrary to Deutsch and Hayden) present in the two bits resulting from the Bell-basis measurement, but in correlations of these with a distant qubit. In neither teleportation nor dense coding does information travel backwards in time, nor is it transmitted by nonlocal (superluminal) influences. It is (tentatively) proposed that all aspects of quantum information can in principle be understood in terms of the (basically classical) behavior of information in a particular framework, along with the framework dependence of this information.
The concept of quantum information is introduced as both normed superposition of two orthogonal subspaces of the separable complex Hilbert space and invariance of Hamilton and Lagrange representation of any mechanical system. The base is the isomorphism of the standard introduction and the representation of a qubit to a 3D unit ball, in which two points are chosen.The separable complex Hilbert space is considered as the free variable of quantum information and any point in it (a wave function describing a state of a quantum system) as its value as the bound variable.A qubit is equivalent to the generalization of ‘bit’ from the set of two equally probable alternatives to an infinite set of alternatives. Then, that Hilbert space is considered as a generalization of Peano arithmetic where any unit is substituted by a qubit and thus the set of natural number is mappable within any qubit as the complex internal structure of the unit or a different state of it. Thus, any mathematical structure being reducible to set theory is representable as a set of wave functions and a subspace of the separable complex Hilbert space, and it can be identified as the category of all categories for any functor represents an operator transforming a set (or subspace) of the separable complex Hilbert space into another. Thus, category theory is isomorphic to the Hilbert-space representation of set theory & Peano arithmetic as above.Given any value of quantum information, i.e. a point in the separable complex Hilbert space, it always admits two equally acceptable interpretations: the one is physical, the other is mathematical. The former is a wave function as the exhausted description of a certain state of a certain quantum system. The latter chooses a certain mathematical structure among a certain category. Thus there is no way to be distinguished a mathematical structure from a physical state for both are described exhaustedly as a value of quantum information. This statement in turn can be utilized to be defined quantum information by the identity of any mathematical structure to a physical state, and also vice versa. Further, that definition is equivalent to both standard definition as the normed superposition and invariance of Hamilton and Lagrange interpretation of mechanical motion introduced in the beginning of the paper.Then, the concept of information symmetry can be involved as the symmetry between three elements or two pairs of elements: Lagrange representation and each counterpart of the pair of Hamilton representation. The sense and meaning of information symmetry may be visualized by a single (quantum) bit and its interpretation as both (privileged) reference frame and the symmetries 𝑈𝑈(1), 𝑆𝑆𝑆 (2), and 𝑆𝑆𝑆 (3) of the Standard model.
Knowledge representation standardly assumes bivalence: every entity determinately satisfies a predicate or determinately does not. Many domains (vague geographic regions, borderline biological taxa, mereologically indeterminate wholes) resist this assumption. The stabilizer formalism of quantum error correction is presented as a vector-based ontology language for classifying and reasoning about indeterminate predicates, with a dispositional dynamics: systems are represented by state vectors, predicates by Pauli operators, indeterminacy as an object-level property, not a meta-level family of precisifications. It complements, rather than replaces, the model-theoretic representation of classical first-order logic. The real (rebit) fragment is efficiently classically simulable (Gottesman-Knill), so no quantum hardware is required. Three determinacy modes (determinacy (D), gappy indeterminacy (G) and correlated indeterminacy (C)) generate, for three predicates, a complete classification hierarchy, its counts established previously, here derived as orbits of nested symmetry-group actions: 120 information kinds, grouped into 49 semantic kinds, 15 determinacy patterns, 7 information forms and 3 correlation classes. Applied to three mereological predicates, a representative subset of kinds is read explicitly, including correlated-indeterminacy patterns beyond bivalent satisfaction. Two results follow. The first is a violation-cost landscape, induced by a chosen dispositional specification, in which the ideal configuration is itself vague; its same-kind transformations are the normalizer of the unsigned landscape group in the group of local Clifford operations and predicate permutations. The second is a centralizer partition of the interaction space, deciding for each query whether it is revelatory or disturbing. The representability boundary lies between the semantic-kind and information-kind levels.