Idea
A stable canonical rule is a rule that syntactically encodes the structure of a finite algebra in a particular way. They are useful because they have well behaved refutation conditions: a stable canonical rule representing the structure of an algebra
Stable canonical rules were introduced in @BezhanishviliBezhanishvili2017LFRoHAaCF and @BezhanishviliEtAl2016SCR. They are related to the canonical formulas and rules of @Zakharyaschev1992CFfKPIBR and @Jerabek2009CR.
Definition
To illustrate, let’s take the case of stable canonical rules for modal algebras.1 Given a modal algebra
Thus the rule fully represents the Boolean structure of
Refutation conditions and duality
Given modal algebras
Via duality, we can characterize the refutation conditions of stable canonical rules on modal spaces (descriptive Kripke frames) as well. When
Note that when
When
Proposition
A modal space
refutes a stable canonical rule iff there is a stable surjection satisfying the BDC for .
This justifies writing a stable canonical rule
Footnotes
-
Stable canonical rules can also be developed for Heyting and bi-Heyting algebras, frontal Heyting algebras, Boolean algebras with operators, and probably many more kinds of algebras. ↩