Tense logics based on posets

Warning

This publication doesn't include Institute of Computer Science. It includes Faculty of Science. Official publication website can be found on muni.cz.
Authors

CHAJDA Ivan LAENGER Helmut LEDDA Antonio PASEKA Jan VERGOTTINI Gandolfo

Year of publication 2025
Type Article in Periodical
Magazine / Source Journal of Logic and Computation
MU Faculty or unit

Faculty of Science

Citation
web https://doi.org/10.1093/logcom/exae081
Doi http://dx.doi.org/10.1093/logcom/exae081
Keywords poset; orthomodular poset; Dedekind-MacNeille completion; implication; adjoint operator; adjoint pair; tense operator; tense logic
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.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.

More info