English

Bi-intermediate logics of trees and co-trees

Logic 2024-07-02 v2

Abstract

A bi-Heyting algebra validates the G\"odel-Dummett axiom (pq)(qp)(p\to q)\vee (q\to p) iff the poset of its prime filters is a disjoint union of co-trees (i.e., order duals of trees). Bi-Heyting algebras of this kind are called bi-G\"odel algebras and form a variety that algebraizes the extension bi\mathsf{bi}-LC\mathsf{LC} of bi-intuitionistic logic axiomatized by the G\"odel-Dummett axiom. In this paper we initiate the study of the lattice Λ(bi\Lambda(\mathsf{bi}-LC)\mathsf{LC}) of extensions of bi\mathsf{bi}-LC\mathsf{LC}. We develop the methods of Jankov-style formulas for bi-G\"odel algebras and use them to prove that there are exactly continuum many extensions of bi\mathsf{bi}-LC\mathsf{LC}. We also show that all these extensions can be uniformly axiomatized by canonical formulas. Our main result is a characterization of the locally tabular extensions of bi\mathsf{bi}-LC\mathsf{LC}. We introduce a sequence of co-trees, called the finite combs, and show that a logic in bi\mathsf{bi}-LC\mathsf{LC} is locally tabular iff it contains at least one of the Jankov formulas associated with the finite combs. It follows that there exists the greatest non-locally tabular extension of bi\mathsf{bi}-LC\mathsf{LC} and consequently, a unique pre-locally tabular extension of bi\mathsf{bi}-LC\mathsf{LC}. These results contrast with the case of the intermediate logic axiomatized by the G\"odel-Dummett axiom, which is known to have only countably many extensions, all of which are locally tabular.

Keywords

Cite

@article{arxiv.2211.14776,
  title  = {Bi-intermediate logics of trees and co-trees},
  author = {N. Bezhanishvili and M. Martins and T. Moraschini},
  journal= {arXiv preprint arXiv:2211.14776},
  year   = {2024}
}
R2 v1 2026-06-28T07:13:55.329Z