SearcharxivSearch

arXiv · 1812.09616

Residuated operators and Dedekind-MacNeille completion

Abstract

The concept of operator residuation for bounded posets with unary operation was introduced by the first two authors. It turns out that in some cases when these operators are transformed into lattice terms and the poset ${\mathbf P}$ is completed into a Dedekind-MacNeille completion $\BDM(\mathbf P)$ then the complete lattice $\BDM(\mathbf P)$ becomes a residuated lattice with respect to these transformed terms. It is shown that this holds in particular for Boolean posets and for relatively pseudocomplemented posets. More complicated situation is with orthomodular and pseudo-orthomodular posets. We show which operators $M$ (multiplication) and $R$ (residuation) yield operator left-residuation in a pseudo-orthomodular poset ${\mathbf P}$ and if $\BDM(\mathbf P)$ is an orthomodular lattice then the transformed lattice terms $\odot$ and $\to$ form a left residuation in $\BDM(\mathbf P)$. However, it is a problem to determine when $\BDM(\mathbf P)$ is an orthomodular lattice. We get some classes of pseudo-orthomodular posets for which their Dedekind-MacNeille completion is an orthomodular lattice and we introduce the so called strongly $D$-continuous pseudo-orthomodular posets. Finally we prove that,for a pseudo-orthomodular poset ${\mathbf P}$, the Dedekind-MacNeille completion $\BDM(\mathbf P)$ is an orthomodular lattice if and only if ${\mathbf P}$ is strongly $D$-continuous.

Explore related subjects

Keep this discovery

BibTeXRIS

Ivan Chajda, Helmut Länger, Jan Paseka. 2018-12-22. Residuated operators and Dedekind-MacNeille completion. https://arxiv.org/abs/1812.09616

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