New Directions in Categorical Logic, for Classical, Probabilistic and Quantum Logic

Abstract

Abstract. Intuitionistic logic, in which the double negation law ¬¬P = P fails, is dominant in categorical logic, notably in topos theory. This paper follows a different direction in which double negation does hold, especially in quantitative logics for probabilistic and quantum systems. The algebraic notions of effect algebra and effect module that emerged in theoretical physics form the cornerstone. It is shown that under mild conditions on a category, its maps of the form X → 1 + 1 carry such effect module structure, and can be used as predicates. Maps of this form X → 1 + 1 are identified in many different situations, and capture for instance ordinary subsets, fuzzy predicates in a probabilistic setting, idempotents in a ring, and effects (positive elements below the unit) in a C * -algebra or Hilbert space.In quantum foundations the duality between states and effects (predicates) plays an important role. This duality appears in the form of an adjunction in our categorical setting, where we use maps 1 → X as states. For such a state ω and a predicate p, the validity probability ω |= p is defined, as an abstract Born rule. It captures many forms of (Boolean or probabilistic) validity known from the literature.Measurement from quantum mechanics is formalised categorically in terms of 'instruments', using Lüders rule in the quantum case. These instruments are special maps associated with predicates (more generally, with tests), which perform the act of measurement and may have a side-effect that disturbs the system under observation. This abstract description of side-effects is one of the main achievements of the current approach. It is shown that in the special case of C * -algebras, side-effects appear exclusively in the noncommutative (properly quantum) case. Also, these instruments are used for test operators in a dynamic logic that can be used for reasoning about quantum programs/protocols. The paper describes four successive assumptions, towards a categorical axiomatisation of quantitative logic for probabilistic and quantum systems, in which the above mentioned elements occur.

From probability monads to commutative effectuses

“…This can be shown in general, for every effectus, see [30,10] for details. In fact, one can also show in general that states in an effectus form convex sets.…”

“…For a partially additive monad T we can define a partial sum operation on the homsets of the Kleisli category K (T ) of partial maps, as in [5,27], and in [30,9,10]. This sum then exists in particular for predicates.…”

“…The main result of this section gives conditions that ensure that a Kleisli category is an effectus, see [30,10]. Briefly, an effectus is a category with finite coproducts and a final object in which the two maps ··· ·· , ··· ·· : (1 + 1) + 1 ⇒ 1 + 1 in (13) are jointly monic, and in which the following diagrams are pullbacks.…”

“…These effectuses have been introduced in [30], and give rise to a rich theory that includes quantum computation, see the overview paper [10]. Subclasses of 'commutative' effectuses and 'Boolean' effectuses have been identified.…”

Strong Completeness for Iteration-Free Coalgebraic Dynamic Logics

“…Such a multi-valued approach to weakest preconditions for non-deterministic, probabilistic and quantum computation has recently been investigated in a categorical setting via so-called state-and-effect-triangles [13,14], see also [12,6]. Weakest preconditions are closely related to dynamic modal logic, e.g., the weakest precondition for ϕ with respect to program α is expressed in PDL as [α]ϕ.…”