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

TL;DR
This paper proves that there are only countably many locally tabular bi-intermediate logics of co-trees, all finitely axiomatizable, and explores their algebraic and varietal structures.
Contribution
It establishes the countability and finite axiomatizability of locally tabular bi-intermediate logics of co-trees and analyzes their subvariety lattice.
Findings
Countably many locally tabular bi-intermediate logics of co-trees.
All such logics are finitely axiomatizable.
The subvariety structure of bi-G"odel algebras is characterized.
Abstract
A bi-Heyting algebra validates the G\"odel-Dummett axiom 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 that algebraizes the extension 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 has continuum many subvarieties, among which the locally finite ones coincide with the subvarieties of the (where…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Logic · Logic, Reasoning, and Knowledge · Logic, programming, and type systems
