Counting relations on Ockham algebras
Brian A. Davey, Long T. Nguyen, and Jane G. Pitkethly

TL;DR
This paper classifies finite Ockham algebras based on the finiteness of their compatible relations, identifying two infinite families: quasi-primal Ockham algebras and generalized Stone algebras.
Contribution
It provides a complete classification of finite Ockham algebras with finitely many compatible relations, highlighting two specific algebraic families.
Findings
Two countably infinite families identified: quasi-primal Ockham algebras and generalized Stone algebras.
Finite Ockham algebras with finitely many compatible relations are fully characterized.
Classification up to isomorphism and symmetry achieved.
Abstract
We find all finite Ockham algebras that admit only finitely many compatible relations (modulo a natural equivalence). Up to isomorphism and symmetry, these Ockham algebras form two countably infinite families: one family consists of the quasi-primal Ockham algebras, and the other family is a sequence of generalised Stone algebras.
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 · Constraint Satisfaction and Optimization · semigroups and automata theory
