SearcharxivSearch

arXiv · 2110.06924

Duality for Normal Lattice Expansions and Sorted, Residuated Frames with Relations

Abstract

We revisit the problem of Stone duality for lattices with various quasioperators, first studied in [14], presenting a fresh duality result. The new result is an improvement over that of [14] in two important respects. First, the axiomatization of frames in [14] was rather cumbersome and it is now simplified, partly by incorporating Gehrke's proposal [8] of section stability for relations. Second, morphisms are redefined so as to preserve Galois stable (and co-stable) sets and we rely for this, partly again, on Goldblatt's [11] recently proposed definition of bounded morphisms for polarities, though we need to strengthen the definition in order to get a Stone duality result. In studying the dual algebraic structures associated to polarities with relations we demonstrate that stable/co-stable set operators result as the Galois closure of the restriction of classical (though sorted) image operators generated by the frame relations to Galois stable/co-stable sets. This provides a proof, at the representation level, that non-distributive logics can be viewed as fragments of sorted, residuated (poly)modal logics, a research direction initiated in [16,17].

Explore related subjects

Keep this discovery

BibTeXRIS

Chrysafis Hartonas. 2021-10-13. Duality for Normal Lattice Expansions and Sorted, Residuated Frames with Relations. https://arxiv.org/abs/2110.06924

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