Search arXivSearch

arXiv · 2309.04771

Tense distributive lattices: algebra, logic and topology

Abstract

Tense logic was introduced by Arthur Prior in the late 1950s as a result of his interest in the relationship between tense and modality. Prior's idea was to add four primitive modal-like unary connectives to the base language today widely known as Prior's tense operators. Since then, Prior's operators have been considered in many contexts by different authors, in particular, in the context of algebraic logic. Here, we consider the category tdlat of bounded distributive lattices equipped with Prior's tense operators. We establish categorical dualities for tdlat in terms of certain categories of Kripke frames and Priestley spaces, respectively. As an application, we characterize the congruence lattice of any tense distributive lattice as well as the subdirectly irreducible members of this category. Finally, we define the logic that preserves degrees of truth with respect to tdlat-algebras and precise the relation between particular sub-classes of tdlat and know tense logics found in the literature.

Explore related subjects

Keep this discovery

BibTeXRIS

Aldo Victorio Figallo, Jonathan Sarmiento, Martín Figallo. 2023-09-09. Tense distributive lattices: algebra, logic and topology. https://arxiv.org/abs/2309.04771

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

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

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

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