Suppose we had a multiset of truth-values [T, T], and that was it. Letting those be indexed as T1 and T2, suppose a twofold fragmenting of a related set of propositions (maybe not a set of all-propositions-whatsoever) and say that propositions from fragment A are true only when they map to T1 and B's elements go with T2. Then, however, sometimes elements of B map to T1, say: and that is how falsity arises, here (mismatches of T-maps).
Is that enough to have a theory of falsehood in a truth-value multiset, or would attempts to translate/encode [T, T] as {T, F} not work out like that at all?
Precedent:
Čulina[21] includes the following:
I don't know how well the following can be applied, here, or to the request for an example of how to separate propositions into two sets for the purposes of attempting the rest of the idea, but:
This occurs in a discussion of a one-dimensional example of an n-dimensional type of "oppositional geometries." In writings about such graph-like things that I am previously familiar with, the main author (Alessio Moretti) focuses on a need to use bi-simplexes to "geometrically complete" the graphs (I think he says that he doesn't want the geometries to be taken for just graphs with logical flavoring, so maybe we should take them as generalized over a variable graph-theoretic type that ranges over the conceptual differences between graphs, multigraphs, and hypergraphs; but otherwise I'm not sure why the geometries are sufficiently distinct from samples of those structures). I think some of the simplexes that Moretti uses are at a flipped angle compared to the ones they're paired with in whole bi-simplexes, but otherwise, having them side-by-side might be like having [A, A].