Correct: There is a logic which QM is a good model of, and for which a distributive property doesn’t hold.
This does not mean that QM is a counterexample to propositional logic. It just means you can model QM using logics other than propositional logic. (And you probably should for most important purposes in physics.)
I’ll explain what I mean when I say propositional logic is jury-rigged to have no (I guess I should add “consistent” here) counterexamples. It’s just this: Given what “and,” “or,” “not”, and “if-then”* mean in propositional logic, it is absolutely guaranteed that any tautologous statement you make in propositional logic will be true on any assignment of truth values to propositions. This isn’t a fact about the world, it’s simply a fact about how the language of propositional works. A tautology in propositional logic is always true by virtue of the definitions of the four logical connectives.
In other words, given what “v” means in propositional logic, the statement “A v -A” cannot be assigned any value (in propositional logic) other than “true.” If someone thinks they can find a counterexample–a case in the actual world where “A v -A” is false, (and they intend it to be interpreted as a statement of propositional logic,) they must invariably have either misunderstood what “A” means in the interpretation, misunderstood what “-” means in propositional logic, or misunderstood what “v” means in propositional logic. Because in propositional logic, A v -A is true by definition. Calling it “false” means you’ve either misunderstood or you’re not doing propositional logic. But in both of those cases, you’re not dealing with a counterexample to PL. Rather, you’re simply not doing PL.
It’s all a set-up. The definitions of the connectives force tautologies to be true. If you think you’ve found a false tautology, you have simply misunderstood the meaning of one or more connectives (or the meaning of one of the interpreted propositions).
Now, it turns out that propositional logic isn’t the most useful model to use for some purposes. For example, it’s not a useful model for dealing with arguments like “Socrates is a man and all men are mortal, so Socrates is mortal.” You need predicate logic for that. Predicate logic lets you do somethings that propositional logic doesn’t let you do. But, importantly, the Socrates argument I just gave doesn’t constitute a counterexample to propositional logic. It’s not a case, in other words, where the premises are true, the conclusion false, and the argument propositionally valid.
Distributivity still holds in predicate logic, but meanwhile, there’s this other kind of logic–“quantum logic”–in which distributivity doesn’t hold. And it turns out QL lets you do some things that PL doesn’t let you do, and it turns out these are useful things. But importantly, this isn’t because there are any counterexamples to PL to be found in quantum phenomena. Rather, it’s just that PL doesn’t have the necessary expressive power to handle some valid arguments that QL does have the expressive power for.
You’re not going to find an example of a quantum phenomenon where it really is true that P & (Q v R) and it really is false that (P & Q) v (P & R) (and where these two expressions are to be interpreted as statements of propositional logic.)
Putnam’s example doesn’t work–the argument that it works relies on a misunderstanding of the meaning of one of the interpreted propositions. And no other example will work either, because, as I said, PL is rigged. The meanings of the connectives force tautologous statements in PL to be true by definition.
Show me a P, Q and R that you think constitute a counterexample to distributivity, and I’ll show you how you’ve either equivocated on P Q or R, misunderstood one of them, or misunderstood one of the connectives involved.