Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · math/0106059

Logic of Dynamics & Dynamics of Logic; Some Paradigm Examples

Bob Coecke·David J. Moore·Sonja Smets
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper surveys some recent developments towards a dynamic quantum logic and outlines its explicite construction -- some analogies and contrasts with other logics of dynamics are indicated. Abstract: The development of ``(static) operational quantum logic" points out that classical boolean structures are too rigid to describe the actual and potential properties of quantum systems. On the other hand, an intuitionistic perspective on operational quantum logic, guides us in the direction of incorporating dynamics logically by reconsidering the primitive propositions required to describe the behavior of a quantum system, in particular in view of the emergent disjunctivity due to the non-determinism of quantum measurements. A further elaboration on "intuitionistic quantum logic" emerges into a "dynamic operational quantum logic", which allows us to express dynamic reasoning in the sense that we can capture how actual properties propagate, including their temporal causal structure, and provides a unified logical description of systems which evolve or which are submitted to measurements. This setting reveals that even static operational quantum logic bears a hidden dynamic ingredient in terms of what is called "the orthomodularity" of the lattice-structure. Focusing on the quantale semantics for dynamic operational quantum logic, we delineate some points of difference with the existing quantale semantics for (non)-commutative linear logic.

Explore related subjects

math.LOquant-ph

Keep this discovery

BibTeXRIS

Bob Coecke, David J. Moore, Sonja Smets. 2002-05-06. Logic of Dynamics & Dynamics of Logic; Some Paradigm Examples. https://arxiv.org/abs/math/0106059

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO↗
arXiv2026

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO↗
arXiv2026

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO↗