Tense logic based on finite orthomodular posets

Ivan Chajda; Helmut Länger

doi:10.1007/s10773-023-05327-7

Home/Archive/arXiv

arXiv · 2208.09946

Tense logic based on finite orthomodular posets

Ivan Chajda·Helmut Länger

View original source ↗Read source document ↗Export metadata ↓

Abstract

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 on such a logic in an inexact way, but still satisfying requirements asked on tense operators in the classical logic based on Boolean algebras or in various non-classical logics. Our construction of tense operators works perfectly when the orthomodular poset in question is finite. We investigate the behaviour of these tense operators, e.g. we show that some of them form a dynamic pair. Moreover, we prove that if the tense operators preserve one of the inexact connectives conjunction or implication as defined by the authors recently in another paper, then they also preserve the other one. Finally, we show how to construct the binary relation of time preference on a given time set provided the tense operators are given, up to equivalence induced by natural quasiorders.

Explore related subjects

math.LO

Keep this discovery

BibTeX RIS

Ivan Chajda, Helmut Länger. 2022-08-21. Tense logic based on finite orthomodular posets. https://doi.org/10.1007/s10773-023-05327-7

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↗