Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2311.06109

On Contextuality and Unsharp Quantum Logic

Davide Fazio·Raffaele Mascella
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper we provide a preliminary investigation of subclasses of bounded posets with antitone involution which are "pastings" of their maximal Kleene sub-lattices. Specifically, we introduce super-paraorthomodular lattices, namely paraothomodular lattices whose order determines, and it is fully determined by, the order of their maximal Kleene sub-algebras. It will turn out that the (spectral) paraorthomodular lattice of effects over a separable Hilbert space can be considered as a prominent example of such. Therefore, it arguably provides an algebraic/order theoretical rendering of complementarity phenomena between unsharp observables. A number of examples, properties and characterization theorems for structures we deal with will be outlined. For example, we prove a forbidden configuration theorem and we investigate the notion of commutativity for modular pseudo-Kleene lattices, examples of which are (spectral) paraorthomodular lattices of effects over finite-dimensional Hilbert spaces. Finally, we show that structures introduced in this paper yield paraconsistent partial referential matrices, the latter being generalizations of J. Czelakowski's partial referential matrices. As a consequence, a link between some classes of posets with antitone involution and algebras of partial "unsharp" propositions is established.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Davide Fazio, Raffaele Mascella. 2023-11-10. On Contextuality and Unsharp Quantum Logic. https://arxiv.org/abs/2311.06109

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↗