Search arXivSearch

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í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

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO