Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2504.19877

Semi-abelian by Design: Johnstone Algebras Unifying Implication and Division

David Forsman
View original source ↗Read source document ↗Export metadata ↓

Abstract

Johnstone demonstrated that Heyting semilattices form a semi-abelian category via a specific triple of terms. Inspired by this work, we introduce \emph{Johnstone algebras} or J-algebras. The algebraic $(*,\to,e)$-theory $J$ of arities $(2,2,0)$ consists of three axioms carefully chosen to ensure protomodularity in alignment with Johnstone's terms. Johnstone algebras generalize well-known structures such as groups (division) and Heyting semilattices (implication) providing a unified framework within the well-behaved setting of semi-abelian categories. We present two primary contributions. First, we identify the M-axiom, \[ (t(x,y)\to x)\to (t(x,y)\to z) \approx x\to z, \text{ where }t(x,y) = (x\to y)\to y. \] The M-axiom is satisfied by residuated Johnstone algebras, and it can be considered a weakening of the H-axiom to comparable elements. We show that $t(x,y)$ defines a \emph{relative closure term} in MBC-algebras, and it implies that MBC-algebras form a variety of algebras, thereby generalizing the corresponding theorem related to HBCK-algebras. Second, we prove several no-go results, demonstrating that balanced theories or theories admitting non-discrete monotone or inflationary algebras cannot possess Malcev terms. Together, these results establish Johnstone algebras as significant structures that achieve desirable categorical properties by carefully integrating both logical and symmetric features, while closely avoiding the constraints imposed by our no-go results.

Explore related subjects

math.LOmath.CTmath.RA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

David Forsman. 2025-04-28. Semi-abelian by Design: Johnstone Algebras Unifying Implication and Division. https://arxiv.org/abs/2504.19877

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗