Search arXivSearch

arXiv · 2312.16754

Local finiteness in varieties of MS4-algebras

Abstract

It is a classic result of Segerberg and Maksimova that a variety of $\mathsf{S4}$-algebras is locally finite iff it is of finite depth. Since the logic $\mathsf{MS4}$ (monadic $\mathsf{S4}$) axiomatizes the one-variable fragment of $\mathsf{QS4}$ (predicate $\mathsf{S4}$), it is natural to try to generalize the Segerberg--Maksimova theorem to this setting. We obtain several results in this direction. Our positive results include the identification of the largest semisimple variety of $\mathsf{MS4}$-algebras. We prove that the corresponding logic $\mathsf{MS4_S}$ has the finite model property. We show that both $\mathsf{S5}^2$ and $\mathsf{S4}_u$ are proper extensions of $\mathsf{MS4_S}$, and that a direct generalization of the Segerberg--Maksimova theorem holds for a family of varieties containing the variety of $\mathsf{S4}_u$-algebras. Our negative results include a translation of varieties of $\mathsf{S5}_2$-algebras into varieties of $\mathsf{MS4_S}$-algebras of depth 2, which preserves and reflects local finiteness. This, in particular, shows that the problem of characterizing locally finite varieties of $\mathsf{MS4}$-algebras (even of $\mathsf{MS4_S}$-algebras) is at least as hard as that of characterizing locally finite varieties of $\mathsf{S5}_2$-algebras -- a problem that remains wide open.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Guram Bezhanishvili, Chase Meadors. 2025-04-10. Local finiteness in varieties of MS4-algebras. https://arxiv.org/abs/2312.16754

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