SearcharxivSearch

arXiv · 2602.21960

There are only countably many locally tabular bi-intermediate logics of co-trees

Abstract

A bi-Heyting algebra validates the G\"odel-Dummett axiom $(p \to q) \lor (q \to p)$ iff the poset of its prime filters is a disjoint union of co-trees. Bi-Heyting algebras of this kind are called bi-G\"odel algebras and form a variety $\operatorname{\mathsf{bi-GA}}$ that algebraizes the extension $\operatorname{\mathsf{bi-GD}}$ of bi-intuitionistic logic axiomatized by the G\"odel-Dummett axiom. In this paper we show that there are only countably many locally tabular bi-intermediate logics of co-trees, all of which are finitely axiomatizable. The theory of canonical formulas of bi-G\"odel algebras has shown that $\operatorname{\mathsf{bi-GA}}$ has continuum many subvarieties, among which the locally finite ones coincide with the subvarieties of the $\mathsf{V}_n \coloneqq \{\mathbf{A} \in \operatorname{\mathsf{bi-GA}} \colon \mathbf{A} \models \beta(\mathfrak{C}_n)\}$ (where $\beta(\mathfrak{C}_n)$ is the subframe formula of the $n$-comb). We identify the multiset projectivity relation (a binary relation that, when defined on the set of finite multisets of a better partial order, is necessarily a better partial order) and use it to prove that every $\mathsf{V}_n$ is a Specht variety, hence has only countably many subvarieties, all of which are finitely axiomatizable. By the algebraizability of $\operatorname{\mathsf{bi-GD}}$, the main result follows. We also provide an informative depiction of the lattice of varieties of bi-G\"odel algebras.

Explore related subjects

Keep this discovery

BibTeXRIS

Miguel Martins. 2026-02-25. There are only countably many locally tabular bi-intermediate logics of co-trees. https://arxiv.org/abs/2602.21960

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