Finitely generated free Heyting algebras via Birkhoff duality and coalgebra

Algebras axiomatized entirely by rank 1 axioms are algebras for a functor and thus the free algebras can be obtained by a direct limit process. Dually, the final coalgebras can be obtained by an inverse limit process. In order to explore the limits of this method we look at Heyting algebras which have mixed rank 0-1 axiomatizations. We will see that Heyting algebras are special in that they are almost rank 1 axiomatized and can be handled by a slight variant of the rank 1 coalgebraic methods.

💡 Research Summary

The paper investigates how to construct free Heyting algebras—algebraic models of intuitionistic logic—using techniques originally developed for logics whose axioms are of rank 1. In rank 1 settings every variable in an axiom occurs exactly once under an operation, which makes the class of algebras a category of algebras for a functor. Consequently, free algebras can be obtained as initial algebras via a direct‑limit construction, and dually final coalgebras arise as inverse limits. Heyting algebras, however, are axiomatized by rank 0‑1 equations (each variable appears at most once under the implication operator), so the standard rank 1 coalgebraic machinery does not apply directly.

To bridge this gap the authors introduce two intermediate varieties: weak Heyting algebras (wHA) and pre‑Heyting algebras. Both are defined by subsets of the Heyting axioms that are genuinely rank 1, allowing the use of Birkhoff’s discrete duality for finite distributive lattices. Starting from a finite distributive lattice (D), they consider the free distributive lattice generated by formal symbols (a_b) (standing for a→b). The four weak‑Heyting axioms are encoded as a lattice congruence (\approx) on this free lattice. By successively quotienting with respect to each axiom they obtain a chain of posets (P_1\subseteq P_0), (P_2\subseteq P_1), (P_3\subseteq P_2). Using Birkhoff duality, each (P_i) is identified with a set of join‑irreducible elements, which in turn correspond to functions (f:D\to D) satisfying increasingly strong conditions:

• After the first axiom (a→a=1) the admissible join‑irreducibles are those containing all diagonal elements (a_a); dually they correspond to functions with (f(a)\le a).
• Adding the axiom (a\to(b\wedge c)=(a\to b)\wedge(a\to c)) forces the functions to be monotone and preserve finite meets, i.e. (f(a\wedge b)=f(a)\wedge f(b)).
• Incorporating ((a\vee b)\to c=(a\to c)\wedge(b\to c)) yields join‑preserving functions, so finally the admissible functions are exactly the join‑preserving, order‑contractive maps (f:D\to D).

Thus the poset of join‑irreducibles of the free weak Heyting algebra is isomorphic to the poset of such functions ordered pointwise. This gives an explicit, combinatorial description of the free weak Heyting algebra.

The next step is to enforce the remaining Heyting axioms that are not rank 1, thereby moving from weak to pre‑Heyting and finally to full Heyting algebras. The authors show that each additional axiom corresponds to a further restriction on the admissible functions (for instance, requiring that (a\to b=1) iff (a\le b)). By iterating this restriction process they obtain a limit object whose underlying lattice is precisely the free Heyting algebra generated by the original set of generators. In other words, the free Heyting algebra can be built as the colimit of a sequence of rank 1 approximations, each described via Birkhoff duality and a concrete function space.

Section 6 translates the algebraic constructions into a coalgebraic framework. Weak and pre‑Heyting algebras are shown to be algebras for specific endofunctors on the category of bounded distributive lattices; the corresponding final coalgebras are obtained as inverse limits of the dual poset constructions. This mirrors the classical duality between initial algebras (free structures) and final coalgebras (canonical models) known from rank 1 logics, thereby extending the coalgebraic methodology to the rank 0‑1 setting of intuitionistic logic.

The paper concludes by emphasizing that while the method exploits special features of Heyting algebras (notably the existence of splitting and co‑splitting elements), it demonstrates that rank 0‑1 logics can be treated with a variant of the rank 1 coalgebraic toolkit. The authors suggest that similar approaches may succeed for other non‑rank‑1 modal logics such as S4, and they point to ongoing work with Alexander Kurz on extending these ideas. Overall, the work provides a systematic, modular construction of finitely generated free Heyting algebras, unifying algebraic, order‑theoretic, and coalgebraic perspectives.