SearcharxivSearch

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. 2023-12-28. 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

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