Classical predictions for intertwined quantum observables are contingent and thus inconclusive

Classical evaluations of configurations of intertwined quantum contexts induce relations, such as true-implies-false, true-implies-true, but also nonseparability among the input and output terminals. When combined, these exploitable configurations (aka gadgets) deliver the strongest form of classical value indefiniteness. However, the choice of the respective configuration among all such collections, and thus the relation of its terminals, remains arbitrary and cannot be motivated by some superselection principle inherent to quantum or classical physics.

Quantum logic, as conceived by von Neumann [2,3] and Birkhoff [4], is about the formal/theoretical universe of potential empirical observable propositions, as well as the algebraic relations and operations among them. Every single one of these observables is considered operational "subject to the experimenter's grace" as its actual measurement reflects the experimenter's (subjective) choice to indeed measure one of these potential observables, versus its (often continuity of) complementary ones. (This choice is mostly supposed to be "ex machina"; that is, outside of the reach of quantum theory, and not subject to nesting [5][6][7].) Thereby, all the other, then counterfactual, observables remain in a "dormant/hypothetical" realm, an idealist [8,9] "limbo" of sorts.
Even explorations allowing logical operations exclusively among simultaneously commeasurable observables [10,11] and permitting partial value definiteness [12,13] (in the recursion-theoretic sense of Kleene [14]) rely upon, and are thus valid relative to, such collections of counterfactuals. Thereby the predictions/forecasts derived not for a single such collection of observables -here sometimes referred to as cloud or gadget -but for (finite) selections from the multitude of conceivable (finite) collections of observables may be inconsistent.
One way to conceptualize the (nonclassical) performance of quantized systems is in terms of (black) boxes with input and output terminals as interfaces [1]. Like zero-knowledge proofs [15] (a topic the late Specker became interested in) they are supposed to certify that they act "truly quantum mechanically" while at the same time not allowing any inspection (e.g., duplication or opening) other than their performance at the input-output terminals. Fulfillment/certification is usually obtained by the exhibition of certain features or signals usually not encountered by classical devices, among them complementarity and classical value indefiniteness (mostly pronounced as contextuality). For a great variety of such criteria see Table I, as well as the references cited therein, later.
However, the signals obtained from these boxes are far from plain. Indeed in what follows we shall argue that, depending on which hypothetical configurations of (necessarily complementary) "intrinsic" observables are considered, any individ-ual outcome can ad hoc be classically (re)interpreted as an indication of nonclassicality. Yet the same outcome could also be in full conformity with a classical interpretation. A combination of such classical models allows any statistical prediction at the terminals. Moreover, there does not seem to exist any convincing reason to choose one of such configurations over another, thus giving rise to either contradictory or arbitrary ad hoc signal analysis.
Already Specker [16] contemplated about generalized exotic behaviors even beyond quantum boxes, whereby his criteria for "weirdness" were inspired by scholastic counterfactuals (aka Infuturabilien). And the benign outcome of his fable was only made possible by the unmarried daughter's determined alas futile attempt to open the "wrong" -according to her father's strategy -box; at which point he gave in, and marriage ensued. Quantum boxes and as will be later argued quantum clouds are not dissimilar: because of complementarity and classical value indefiniteness (aka contextuality) complete knowledge of the situation is impossible by any known physical means. An immediate idealistic [8,9,17] objection to the use of counterfactuals could be that the presupposition of the sort of omni-realism required for a classical analysis of quantum boxes cannot be operational [18] and supported by quantum mechanics. Indeed, the partial algebra approach of Kochen and Specker [10,11,19] disallows operations among complementary observables whilst making heavy use of intertwined collections of complementary maximal operators (aka contexts).
However, even classical models based on set representable partition logics [20] such as Moore's initial state identification problem [21] and also Wright's generalized urn model [22,23] mimic quantum complementarity to a certain degree -indeed, formally up to quantum logics with separable sets of two-valued states [19,Theorem 0,p. 67]. Thereby nonseparability of quantum observables with respect to the set of two-valued states (interpretable as classical truth assignments) serves as a strict criterion for nonclassicality, and also as a criterion against realizations by set-theoretical representable partition logics, even if such two-valued states exist.
In what follows we shall further exploit counterfactual configurations of contexts which are intertwined (this terminology is borrowed from Gleason [24]) in one or more common observable(s). Such counterfactual configurations of contexts will be called clouds.
Graph theoretically [25,Appendix] a context can be associated with a complete graph (aka clique). Its vertices are identified with the elements of the context. Adjacency is characterized by comeasurable exclusivity. Clouds are represented by collections of complete graphs (aka clicks or contexts) intertwining at the respective vertices, thereby leaving the edges unchanged.
In quantum mechanics, contexts are identified with orthonormal bases, or equivalently with the maximal operators [26, § 84, Theorem 1, p. 171] which can be (nonuniquely) formed by nondegenerate sums containing all the onedimensional orthogonal projection operators associated with those respective bases. Elementary propositions are formalized by vectors of these bases of d-dimensional Hilbert space, or by the orthogonal projection operators associated with such vectors [4]. Graph theoretically the vertices are represented by the basis vectors, and adjacency stands for orthogonality of these vectors; that is, the edges represent the (pairwise) orthogonality relations between the vectors (vertices). (Each vertex must be connected to all the other d − 1 vertices in the respective context by an edge.) Thereby the graph representing a cloud has a faithful orthogonal representation [27,28] in terms of the elements of the bases representing the respective contexts. The inverse problem of finding some faithful orthogonal representation of a given graph is still open. A necessary condition for the existence of intertwines is that the dimensionality of the vector space is higher than two because in fewer dimensions than three contexts are either identical or disjoint.
Orthogonality hypergraphs [29] are compact representations of clouds which reveal their structural constituents by signifying contexts/cliques/bases: every complete graph K d is replaced by a single smooth curve (usually a straight line) containing distinguished points that represent the vertices. Thereby, the d(d − 1)/2 edges of any such complete graph K d are replaced with a single smooth curve. All the vertices "within" this smooth curve represent the mutually orthogonal vectors forming a d-dimensional basis.
Clouds may have various model realizations and representations: a particular cloud may have (i) a quantum mechanical realization in terms of intertwining orthonormal bases, as mentioned earlier; (ii) a pseudo-classical realization in terms of partition logic which in turn have automaton logic or generalized urn models; (iii) a classical realization if there is only a single context involved; (iv) none of the above (such as a tightly interlinked "triangle" configuration of three contexts with two vertices per context).
Suffice it to say that (i) does not imply (ii), and vice versa. Case (iii) can be interpreted as a subalgebra of all the other groups enumerated, as the cases (i) and (ii) are pastings of contexts or (Boolean) blocks [30].

ENFORCING CLASSICAL TWO-VALUED STATES
The commonly used method for exploring nonclassicality is to consider configurations of type (i) with a quantum realization, upon which a classical interpretation, if it exists, is "enforced" in terms of uniform classical truth and falsity allocations of the associated propositions. Such value assignments can be formalized by two-valued states s ∈ {0, 1} or (classical truth) value assignments which are additive and add up to one whenever the propositions are exclusive and within a single context.
The physical intuition behind this formalization is the observation that any d-dimensional context or maximal observable can be interpreted as an array of detectors after a d-port beam splitter [31]. In an ideal experiment, only one detector clicks (associated with the proposition that the system is in the respective state), whereas all the other d − 1 detectors remain silent.
Such uniform classical interpretations are supposed to be context-independent; that is, the value on intertwining observables which are common to two or more contexts is independent of the context. Besides context-independence of truth assignments at the intertwining observables various variants of such measures assume conditions of increasing strength: (I) The "measures" or value assignments employed in socalled "contextuality inequalities" merely assume that every proposition is either true or false, regardless of the other propositions in that context which are simultaneously measurable [32]. This allows all possible 2 d possibilities of value assignments in a d-dimensional context with d vertices, thereby vastly expanding the multitude of possible value assignments. With this expansion, all Kochen-Specker sets trivially allow value assignments.
(II) The prevalent assumption of two-valued states or value assignments, also used by Kochen and Specker [19] as well as Pitowsky [33], is that only a single one of the d vertices within a d-dimensional context is true, and all the others are false; therefore any isolated ddimensional context can have only d such standard twovalued value assignments.
(III) An even more restricted rule of value assignment abandons uniform definiteness and supposes [12,13,34] that, if all d − 1 but one vertex in a d dimensional context are false, the remaining one is true, and if one vertex within a d-dimensional context is true, all remaining d − 1 vertices are false. This latter value assignments allow for partial functions which can be undefined.
Type (III) implies type (II) which in turn implies type (I) value assignments.
A set S of two-valued states on a graph G is [35, 36]: (u) unital, if for every x ∈ G there is a two-valued state s ∈ S such that s(x) = 1; (s) separating, if for every distinct pair of vertices x, y ∈ G with x = y there is an s ∈ S such that s(x) = s(y); (f) full, if for every nonadjacent pair of vertices x, y ∈ G there is an s ∈ S such that s(x) = s(y) = 1.
A full set of two-valued states is separating, and a separating set of two-valued states is unital. As will be detailed later TIFS/10-gadgets have a nonfull set so two-valued states in the sense of (f). Nonseparability in the sense of (s) indicates nonclassicality. And nonunitality in the sense of (u) discredits the classical predictions of quantum clouds even to a greater degree, probably only challenged by a complete absence of two-valued states.

CHROMATIC SEPARABILITY
As already discussed by Kochen and Specker [19, Theorem 0] nonseparability of (at least one) pair of nonadjacent vertices with respect to the set of two-valued states (interpretable as classical truth assignments) of a graph is arguably the most important signature of nonclassicality. It may be true even if there is an "abundance" of two-valued states. Nonseparability can also be expressed in terms of graph coloring.
A proper (vertex) coloring [25, Appendix] of a graph is a function c from the vertex set to a finite set of "colors" (the positive integers will do) such that, whenever x and y are adjacent vertices, c(x) = c(y). The chromatic number of a graph is the least positive integer t such that the graph has a coloring with t colors.
A two-valued state on a (hyper)graph composed/pasted from contexts/cliques, all having an identical number of vertices/clique numbers d can be obtained by "projecting/reducing" colors if the chromatic number of that graph equals d. In this case, in order to obtain a two-valued state, take any proper (vertex) coloring c with d colors and map d − 1 colors into (the "new color") 0 and one color into (the "new color") 1. Just as the graph coloring c itself such mappings need not to be unique.
Note that the chromatic number of a complete graph must be equal to the clique number because type (II) & (III) twovalued states require that every context/clique must have exactly one vertex with value assignment 1 (and 0 for all the other vertices). (One might conjecture that the set of twovalued states induces graph colorings, in much the same way as it induces a partition logic [20].) At the same time, the clique number renders a bound from below on the chromatic number. Thus if the chromatic number of a graph exceeds the clique number no such two-valued states exist -the "phenomenological consequence" is that, for at least one context/clique, the color projection/reduction is constant -namely 0 -on all vertices of that context/clique.
A coloring is chromatically separating two nonadjacent distinct vertices x and y in the vertex set of a graph if there exists a proper vertex coloring such that c(x) = c(y). A set of colorings of a particular graph is said to be separating if, for any pair of distinct vertices it contains at least one coloring which separates those vertices. The separable chromatic number of a graph is the least positive integer t such that the graph has a separating set of colorings with at most t colors.
If the separable chromatic number is higher than the chromatic number of a given graph, then there exist nonadjacent vertices which cannot be "resolved" by any proper graph coloring, or, for that matter, by any derived projected/reduced two-valued state. As a consequence, the graph has no settheoretic realization as a partition logic, although its chromatic number is the clique number, and there still may exist an abundance of proper colorings and two-valued states [19, It would be interesting to translate (non)unitality and (non)fullness into (sets of) graph coloring. For reasons of brevity, we shall not discuss this here.

FORMATION OF GADGETS AS USEFUL SUBGRAPHS FOR THE CONSTRUCTION OF CLOUDS
The commonly used method seeks cloud configurations with "exotic" classical interpretations. Again, exoticism may express itself in various forms or types. One way is in terms of violations on bounds on classical conditions of possible experience [37, p. 229], such as Bell-type inequalities derivable from taking all [type (II), and type (I) for inequalities using only the assumption of noncontextuality [32]] value assignments, forming a correlation polytope by encoding those states into vertices, and solving the hull problem thereof [38][39][40][41][42][43][44][45]. Another, stronger [46] form of nonclassicality is the nonexistence of any such classical interpretation in terms of a type (II) valued assignments [16,19,24,33,47]; or at least their nonseparability [19, Theorem 0, p. 67].
The explicit construction of such exotic classical interpretations often proceeds by the (successive) application of exploitable subconfigurations of contexts -in graph theoretical terms gadgets [48-50] defined as "useful subgraphs". Thereby, gadgets are formed from constituent lower order gadgets of ever-increasing size and functional performance (see also [51,Chapter 12]): 1. 0th order gadget: a single context (aka clique/block/Boolean (sub)algebra/maximal observable/orthonormal basis). This can be perceived as the most elementary form of a true-implies-false (TIFS/10) [1]/01-(maybe better 10)-gadget [50,52] configuration, because a truth/ value 1 assignment of one of the vertices implies falsity/ value 0 assignments of all the others; 2. 1st order "firefly" gadget: two contexts connected in a single intertwining vertex; 3. 2nd order gadget: two 1st order firefly gadgets connected in a single intertwining vertex;   [19], consisting of one 10-gadget and one firefly gadget, connected at the respective terminal points (cf. Fig. 6); That is, gadgets are subconfigurations of clouds. And clouds can be interpreted as gadgets for the composition of bigger clouds.
For the sake of arguing for an idealistic [8,9,17] and against a realistic usage of quantum clouds, configurations of intertwined contexts with two fixed propositions as "start" and "end" points a and b will be studied; as well as methods for constructing such configurations with particular relational properties. Whenever there is no preferred, less so unique, path connecting a and b, all such connections should be treated on an equal basis. We shall call any such collection of counterfactual connections "clouds connecting a and b", denoted by C(a, b), and depict it with a cloud shape symbol, as drawn in Figure 1. (This can in principle be generalized to more than two terminal points.) Thereby, as the endpoints a and b remain fixed, one can ask what kind of (classical) relational information can be inferred from such two-point quantum clouds. As it turns out, for fixed a and b quantum clouds can be found which realize a wide variety of conceivable relational properties between a and b.  and E b = |b b|, respectively. For the sake of demonstration we shall study configurations in which |a = 1, 0, 0 and |b = 1 √ 2 , 1 2 , 1 2 , that is, the quantum prediction yields a probability | b|a | 2 = 1 2 to find the quantum in a state |b if it has been prepared in a state |a . This configuration can be extended to endpoints with (noncollinear and nonorthogonal) arbitrary relative location by the techniques introduced in Refs. [13,50].  Fig. 1, p. 182] is a quantum cloud configuration which classically enforces a trueimplies-b false: if a quantum system is prepared in such a way that a is true -that is, if it is in the state E a -and measured along E b , and |a and |b are not orthogonal or collinear, then any observation of b given a amounts to a probabilistic proof of nonclassicality: because although quantum probabilities do not vanish, classical value assignments predict that b never occurs. Minimal quantum cloud configurations for classical a trueimplies-b false, as well as a true-implies-b true value assignments [of type (II)] can be found in [1].
As Cabello has pointed out [69,70], the original Specker bug configuration cannot go beyond the quantum prediction probability threshold | b|a | 2 = 3 −2 because the angle between a and b cannot be smaller than arccos 1 Fig. 5(a)] allowing type (III) TIFS truth assignments with "maximally unbiased" quantum prediction probability | b|a | 2 = 1 2 is a sublogic of a quantum logic whose realization is enumerated in Ref. [13, Table. 1, p. 102201-7]. It is depicted in Fig. 3. A proof of Theorem 2 in Ref. [50] contains an explicit parametrization of a single TIFS/10 cloud allowing the full range of angles 0 < ∠a, b < π.  Fig. 2]. Hardy [59][60][61] as well as Cabello, among others [50, 63-67, 69, 70] utilized similar scenarios for the demonstration of nonclassicality [74,Chapter 14]. Fig. 4 depicts a 11gadget [71, Fig. 5(b)] with identical endpoints as the 10-gadget discussed earlier and depicted in Fig. 3. (d) Various parallel and serial compositions of 10-and 11gadgets serve as a "gadget toolbox" to obtain clouds which, if they are interpreted classically, exhibit other interesting relational properties. For instance, the parallel composition (pasting) of two quantum clouds of the 10-gadget type: one 10-gadget classically demanding a true-implies-b false and the other 10-gadget classically demanding b true-implies-a false, results in a quantum cloud which has two observables a and b which are classically always "opposite": if one is true, the other one is false, and vice versa.
(e) The parallel composition (pasting) of two quantum clouds of the TITS type, with one TITS, classically demanding a true-implies-b true and the other TITS classically demanding b true-implies-a true, results in a quantum cloud which has two observables a and b which are classically nonseparable, which is a sufficient criterion for nonclassicality [19, Theorem 0, p. 67]. As pointed out by Portillo [75] this is equivalent to a is true if and only if b is true (TIFFTS). Fig. 5 depicts a historic example of such a construction. The serial composition of suitable TITS of the form a 1 true-impliesa 2 · · · a i−1 true-implies-a i true eventually yields two or more vectors a 1 and a i which are mutually orthogonal; a technique employed by Kochen and Specker for the construction of a quantum cloud admitting no type (II) truth assignment [19, Γ 2 , p. 69].
(f) The parallel composition (pasting) of the two quantum clouds which respectively represent a 10-gadget and an 11-gadget and identical endpoints a and b yields a a true-implies-b value indefinite cloud discussed in Ref. [13].

SOME TECHNICAL ISSUES OF GADGET CONSTRUCTION
The concatenation of intertwining gadgets needs to allow a proper faithful orthogonal representation of the resulting compound (hyper)graph while at the same time preserving the structure of these gadgets. Thereby the faithful orthogonal representations of the constituent gadgets cannot always be transferred easily to a faithful orthogonal representation of the resulting compound (hyper)graph.
Suppose, for the sake of a counterexample involving duplicity of vertices after concatenations of gadgets, one would attempt to construct a G 1, 0, 0 , 0, 1, 1 11 cloud (which would constitute a Kochen-Specker proof as the respective terminal points are orthogonal) by concatenating two 11-gadgets G 1, 0, 0 , 1 √ 2 , 1 2 , 1 2 and G 1 √ 2 , 1 2 , 1 2 , 0, 1, 1 of the type depicted in Fig. 4 by simply rotating all coordinates of the first gadget π 4 radians (45 • ) about the axis formed by b − a. Unfortunately, a straightforward calculation shows that these two 11-gadgets, with the faithful orthogonal realization taken from [13, Fig. 6] for dimensions greater than 2. In three dimensions, (i) the three orthogonal "middle" vertices intertwining four contexts vanish, (ii) the two vertices |c and |c ′ coincide, and (iii) the two edges connecting |c with |a and |c ′ with |b vanish, rendering the original Specker bug combo introduced by Kochen and Specker [19, Γ 3 , p. 70]. Unlike the earlier configurations, this cloud does not allow 50:50 quantum probabilities. Because of nonseparability of its set of two-valued states and its separable chromatic number higher than the clique number it does not allow a set representation by partition logics. vertex 1 √ 2 , 1 2 , 1 2 in common as per construction, but also the three additional vertices 0, 1 √ 2 , ± 1 √ 2 and 1, 0, 0 . Also, gadgets may not be able to perform as desired. For instance, a standard construction in three dimensions, already used by Kochen and Specker [19, Lemma 1, Γ 1 , p. 68] for their construction of a 11-gadget Γ 1 from a Specker bug-type 10-gadget introduced earlier [10, Fig. 1, p. 182], is to take the terminal points a and b of some TIFS/10 cloud and form the normal vector c = a × b. In a second step, the vector orthogonal to both b and c is formed. If a is true/1 then b (because of the 01-gadget) as well as c (because of orthogonality with a) must be false/0. Therefore d must be true, since it completes the context {b, c, d}. The situation is depicted in Fig. 6. If all goes well the new cloud C(a, d) is of the TITS/11 type. This is not the case if one uses the TIFS/10gadget depicted in Fig. 3, as the vector c = 0, − 1 zero) the 10-gadget introduced in the proof of Theorem 3 in Ref. [50] and depicted in Fig. 7 cannot be extended to an 11 cloud whose end terminals are the "maximal" angle

DISCUSSION
It is important to notice that, for fixed terminal vertices, depending on the cloud chosen, very different classical predictions follow. Indeed, once the terminal vertices are fixed, it is not too difficult to enumerate a quantum cloud which, interpreted classically, predicts and demands any kind of inputoutput behavior. This renders an element of arbitrariness in the interpretation of quantum clouds.
The relevance of this observation lies in the conceivable in- Ref. [50]. The advantage of this nonfull/TIFS/10-gadget is a straightforward parametric faithful orthogonal representation allowing angles 0 < ∠u 1 , u 22 ≤ π 4 radians (45 • ) of, say, the terminal points u 1 and u 22 . The corresponding logic including the completed set of 34 vertices in 21 blocks is set representable by partition logics because the supported 89 two-valued states are (color) separable. It is not too difficult to prove (by contradiction) that, say, if both u 1 as well as u 22 are assumed to be 1, then u 2 , u 3 , u 4 , as well as u 19 , u 20 and u 21 should be 0. Therefore, u 5 and u 18 would need to be true. As a result, u 6 and u 17 would need to be false. Hence, u 7 as well as u 16 would be 1, rendering u 8 and u 15 to be 0. This would imply u 9 as well as u 14 to be 1, which in turn would demand u 10 and u 13 to be false. Therefore, u 11 and u 12 would have to be 1, which yields a complete contradiction even for type-III value assignments. It is also a TITS/11-gadget for the terminal points u 1 − u 20 , constructed by the standard construction depicted in Fig. 6. terpretation of elementary empirical observations, such as a single particular click in a detector. Suppose a quantum is prepared in a pure state "along" a unit vector a and, when measured "along" E b = b † b, "happens to activate a detector" corresponding to that state b; that is, a detector associated with this latter property clicks. Depending on the quantum cloud considered, the following contradictory claims are justified: 1. if the quantum cloud allows both values then the claim is that there is no determination of the outcome; the event "popped up" from nowhere, ex nihilo, or, theologically speaking, has come about by creatio continua (cf. Kelly James Clark's God-as-Curler metaphor [76]); 2. in the case of a 10-gadget the system is truly quantum and cannot be classical; 3. in the case of an 11-gadget the system could be classical; 4. in case of a cloud inducing value indefiniteness the claim can be justified that the system cannot be classical, as no such event (not even its absence) should be recorded. Indeed, relative to the assumptions made, the (non)occurrence of any event at all is in contradiction to the classical predictions.
Conversely, if the experimenter observes no click in a detector associated with the state b, then, depending on the quantum cloud considered, the following contradictory claims are justified: 1. as mentioned earlier, if the quantum cloud allows both values then there exists creatio continua (currently, this appears to be the orthodox majority position); 2. in the case of a 10-gadget the system could be classical; 3. in case of an 11-gadget the system is truly quantum and cannot be classical; 4. just as mentioned earlier, in case of a cloud inducing value indefiniteness the claim can be justified that the system cannot be classical, as no such event (not even its absence) should be recorded.
As a result, depending on the quantum cloud considered, any (non)occurrence of some single outcome can be published (or rather marketed in venerable scientific journals) as a crucial experiment indicating that the associated system cannot be classical. Likewise, by taking other quantum clouds, any such outcome may be considered to be consistent with classicality: (non)classicality turns out to be means relative with respect to the quantum clouds considered. As quantum clouds are configurable for any input-output port setup this is true for any measurement outcome.
At the same time the vector 0, 1, 0 is forced to be 1. Since without loss of generality, an orthogonal transformation can transform all of these vectors into arbitrary other directions (while maintaining angles between vectors and, in particular, orthogonality) the assumption of such unital configurations and their classical interpretation immediately yields any desired contradiction with any individual measurement outcome.
This arbitrariness could be overcome by some sort of "superselection rule" prioritizing or selecting particular quantum clouds over other ones. However, in the absence of such superselection rules a generalized Jayne's principle, or rather Laplace's principle of indifference, implies that any choice of a particular quantum cloud over other ones amounts to an "epistemic massaging" of empirical data, and their nonoperational, misleading overinterpretation in terms of a speculative ontology [8,9,17]; or, to quote Peres [78], unperformed experiments have no results". In contradistinction, it may not be too speculative to hold it for granted that the only operationally justified ontology is the assumption of a single one context or its associated maximal observable.
The author acknowledges the support by the Austrian Science Fund (FWF): project I 4579-N and the Czech Science Foundation (GAČR): project 20-09869L.
The author declares no conflict of interest. I kindly acknowledge enlightening discussions with Adan Cabello, José R. Portillo, and Mohammad Hadi Shekarriz. I am grateful to Josef Tkadlec for providing a Pascal program which computes and analyses the set of two-valued states of collections of contexts. All misconceptions and errors are mine.