Related papers: Between quantum logic and concurrency

We apply to locally finite partially ordered sets a construction which associates a complete lattice to a given poset; the elements of the lattice are the closed subsets of a closure operator, defined starting from the concurrency relation.…

We consider a proper propositional quantum logic and show that it has multiple disjoint lattice models, only one of which is an orthomodular lattice (algebra) underlying Hilbert (quantum) space. We give an equivalent proof for the classical…

In this work we build a quantum logic that allows us to refer to physical magnitudes pertaining to different contexts from a fixed one without the contradictions with quantum mechanics expressed in no-go theorems. This logic arises from…

Complex information-processing systems, for example quantum circuits, cryptographic protocols, or multi-player games, are naturally described as networks composed of more basic information-processing systems. A modular analysis of such…

It is widely accepted that the logic of quantum mechanics is based on orthomodular posets. However, such a logic is not dynamic in the sense that it does not incorporate time dimension. To fill this gap, we introduce certain tense operators…

We give a mathematical framework to describe the evolution of an open quantum systems subjected to finitely many interactions with classical apparatuses. The systems in question may be composed of distinct, spatially separated subsystems…

In this work we propose a multi-valued extension of logic programs under the stable models semantics where each true atom in a model is associated with a set of justifications, in a similar spirit than a set of proof trees. The main…

This paper reveals a categorical equivalence connecting two distinct quantum logic structures. The first is the orthomodular lattice, an algebraic system designed to formalize the properties of quantum systems. The second is a finitary…

A fundamental result from Boolean modal logic states that a first-order definable class of Kripke frames defines a logic that is validated by all of its canonical frames. We generalise this to the level of non-distributive logics that have…

Requiring that the causal structure between different parties is well-defined imposes constraints on the correlations they can establish, which define so-called causal correlations. Some of these are known to have a "dynamical" causal order…

Causal reasoning is essential to science, yet quantum theory challenges it. Quantum correlations violating Bell inequalities defy satisfactory causal explanations within the framework of classical causal models. What is more, a theory…

Computational analysis of time-course data with an underlying causal structure is needed in a variety of domains, including neural spike trains, stock price movements, and gene expression levels. However, it can be challenging to determine…

Causal inequalities are bounds on correlations obtained when operations take place in a causal sequence, i.e. in which the background time or definite causal structure pre-exists such that every operation is either in the future, in the…

It is shown that propositional calculuses of both quantum and classical logics are non-categorical. We find that quantum logic is in addition to an orthomodular lattice also modeled by a weakly orthomodular lattice and that classical logic…

Quantum computation has suggested new forms of quantum logic, called quantum computational logics. The basic semantic idea is the following: the meaning of a sentence is identified with a quregister, a system of qubits, representing a…

It is shown that quantum logic is a logic in the very same way in which classical logic is a logic. Soundness and completeness of both quantum and classical logics have been proved for novel lattice models that are not orthomodular and…

Just as conventional functional programs may be understood as proofs in an intuitionistic logic, so quantum processes can also be viewed as proofs in a suitable logic. We describe such a logic, the logic of compact closed categories and…

Quantum computational logics represent a logical abstraction from the circuit-theory in quantum computation. In these logics formulas are supposed to denote pieces of quantum information (qubits, quregisters or mixtures of quregisters),…

The $\mathrm{Caus}[-]$ construction takes a base category of ``raw materials'' and builds a category of higher order causal processes, that is a category whose types encode causal (a.k.a. signalling) constraints between collections of…

We consider a simple modal logic whose non-modal part has conjunction and disjunction as connectives and whose modalities come in adjoint pairs, but are not in general closure operators. Despite absence of negation and implication, and of…