Tense logic based on finite orthomodular posets

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F23%3A73620539" target="_blank" >RIV/61989592:15310/23:73620539 - isvavai.cz</a>
Result on the web
<a href="https://link.springer.com/article/10.1007/s10773-023-05327-7" target="_blank" >https://link.springer.com/article/10.1007/s10773-023-05327-7</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10773-023-05327-7" target="_blank" >10.1007/s10773-023-05327-7</a>

Result language
angličtina
Original language name
Tense logic based on finite orthomodular posets
Original language description
The logic of quantum mechanics is based on orthomodular posets. However, such a logic is dynamic, i.e. it incorporates time dimension. Hence, 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. We investigate the behaviour of these tense operators, e.g. we show that they form dynamic pairs .We show how to construct the binary relation of time preference on a given time set provided the tense operators are given.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10102 - Applied mathematics

Project
<a href="/en/project/GF20-09869L" target="_blank" >GF20-09869L: The many facets of orthomodularity</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2023
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)