SearcharxivSearch

arXiv · 2601.22023

A categorical equivalence for monadic algebras of first-order substructural logics motivated by Kalman's construction

Abstract

The category $\mathbb{DRDL'}$, whose objects are c-differential residuated distributive lattices that satisfy the condition $\mathbf{CK}$, is the image of the category $\mathbb{RDL}$, whose objects are residuated distributive lattices, under the categorical equivalence (Kalman functor) $\mathbf{K}$. The main goal of this paper is to lift this equivalence $\mathbf{K}$ to the category $\mathbb{MRDL}$, whose objects are monadic residuated distributive lattices, and the category $\mathbb{MDRDL'}$, whose objects are pairs formed by an object of $\mathbb{DRDL'}$ and a center universal quantifier. Firstly, based on the variety of monadic FL$_\textrm{e}$-algebras, we introduce the concept of monadic residuated lattices and study some of their further algebraic properties, proving the classes of monadic residuated distributive lattices and monadic c-differential residuated distributive lattices are in one-to-one correspondence. Subsequently, based on this corresponding relation, we prove that there exists a categorical equivalence between the categories $\mathbb{MRDL}$ and $\mathbb{MDRDL'}$. The results of this paper not only generalizes the works of Sagastume and San Mart\'{i}n in [Mathematical Logic Quarterly, {\bf 60}(2014), 375--388], but also addresses and overcomes the limitations identified in the works of [Studia Logica, {\bf 111}(2023), 361--390]. Finally, this paper concludes with some applications regarding descriptions of a 2-contextual translation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Juntao Wang, Mei Wang, William Zuluaga Botero. 2026-01-29. A categorical equivalence for monadic algebras of first-order substructural logics motivated by Kalman's construction. https://arxiv.org/abs/2601.22023

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