Order effects in dynamic semantics

In their target article, \citet{WangBusemeyer13} [A quantum question order model supported by empirical tests of an a priori and precise prediction. \emph{Topics in Cognitive Science}] discuss question order effects in terms of incompatible projectors on a Hilbert space. In a similar vein, Blutner recently presented an orthoalgebraic query language essentially relying on dynamic update semantics. Here, I shall comment on some interesting analogies between the different variants of dynamic semantics and generalized quantum theory to illustrate other kinds of order effects in human cognition, such as belief revision, the resolution of anaphors, and default reasoning that result from the crucial non-commutativity of mental operations upon the belief state of a cognitive agent.

💡 Research Summary

The paper builds on Wang and Busemeyer’s (2013) quantum model of question order effects and on Blutner’s ortho‑algebraic query language, which is grounded in dynamic update semantics. It first outlines generalized (or “weak”) quantum theory, where a set X of epistemic states is acted upon by morphisms A ∈ Mor(X). These morphisms are called observables; their composition AB is associative but generally non‑commutative, and projectors (A² = A) produce eigenstates that remain unchanged under further application. By interpreting observables as epistemic operators, the author maps this quantum framework onto dynamic semantics.

In classical dynamic semantics, operators are required to be commutative and idempotent, so logical conjunction can be identified with operator composition (A∧B = AB = BA). Acceptance of a proposition A in a state x means A(x) = x, i.e., x is an eigenstate of A. Bayesian update is then expressed as conditionalization ρ_A(B) = ρ(B∧A)/ρ(A). This setting captures monotonic belief updating but fails to model phenomena where order matters.

The paper then examines three non‑classical cases that require non‑commutative operations.

1. Belief Revision – Following Gärdenfors (1988), a revision operator A* maps a proposition A to a non‑projective observable. Applying A* before or after another proposition B yields different results (AB ≠ BA), producing a “zero” or absurd state when contradictory propositions are combined. In quantum cognition, the Lüders‑Niestegge rule ρ_A(B) = ρ(ABA)/ρ(A) replaces Bayesian conditioning, reflecting the non‑commutativity of Hilbert‑space projections.

2. Anaphor Resolution – Dynamic predicate logics treat quantifiers and pronouns as epistemic operators. The sentence “John sat, George entered, he wore a hat” can be formalized as C B A or C A B, where the pronoun “he” refers to different antecedents depending on the order of application. This demonstrates that anaphoric interpretation is inherently non‑commutative.

3. Default Reasoning – By relaxing the stability condition of logical consequence, default operators become non‑monotonic. Veltman’s (1996) example shows that the sequence “Someone knocks, maybe it’s John, it’s Mary” (C B A) yields a coherent narrative, whereas inserting the default again later (B C B A) creates inconsistency. The order of defaults thus matters, again reflecting non‑commutative dynamics.

The conclusion emphasizes that classical dynamic semantics, with its commutative, idempotent operators, cannot capture these order effects. Belief revision, anaphor resolution, and default reasoning all require non‑commutative, often non‑monotonic, operations. Quantum probability theory naturally accommodates such structures, suggesting a promising avenue for future research. While probabilistic extensions of dynamic semantics have employed Bayesian updating, fully quantum‑probabilistic models for these cognitive phenomena remain largely unexplored, representing an important direction for subsequent work.