Tense logics based on posets

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14310%2F25%3A00144295" target="_blank" >RIV/00216224:14310/25:00144295 - isvavai.cz</a>
Alternative codes found
RIV/61989592:15310/25:73633246
Result on the web
<a href="https://doi.org/10.1093/logcom/exae081" target="_blank" >https://doi.org/10.1093/logcom/exae081</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1093/logcom/exae081" target="_blank" >10.1093/logcom/exae081</a>

Result language
angličtina
Original language name
Tense logics based on posets
Original language description
Quantum mechanics, initially formalized with orthomodular lattices, benefits from a simpler approach using just partially ordered sets (posets). This paper explores how logical connectives are introduced in poset-based logics. Building on prior work by the authors, we delve deeper into 'dynamic' logics where truth values can change over time. We consider time sets with a preference relation and propositions whose truth depends on time. Tense operators, introduced by J.Burgess and extended for various logics, become a valuable tool. This paper proposes several approaches to this topic, aiming to inspire a further stream of research.
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
10100 - 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
2025
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)