Finite BM-algebras and fixed-point combinators
math.LO, cs.LO
Submitted: 2026-10-27
Updated: 2026-10-27
License: http://creativecommons.org/licenses/by/4.0/
The gist: We study algebras for the BM -, BI -, and BMI-fragments of combinatory logic, where B xyz to w x (yz), M x to w xx and I x to w x.
Abstract
We study algebras for the BM -, BI -, and BMI-fragments of combinatory logic, where B xyz to w x (yz), M x to w xx and I x to w x. We prove that every finite BM-algebra A contains an element Y satisfying Yx = x (Yx) for all x in A. Moreover, a single closed BM-term represents such an element in every finite BM-algebra. On the other hand, we show that there exists an infinite BMI-algebra with no such element. Consequently, the variety of BM-algebras is not generated by finite BM-algebras. We also characterise finite BI-algebras as finite semigroups with two distinguished left units B and I, and finite BMI-algebras as finite idempotent semigroups with three distinguished left units B, M and I.
Related papers
- The consistency strength of the failure of amenable C-sequences
- Classification of bipartite observables III: simplicity, mixtures and quantum error correction
- The Additive Arithmetic of Linear Orders
- Indiscernible Extraction in Theories with Bounded k-splitting
- Measuring the Complexity of Countable Presburger Models
- A non-trivially non-trivial automorphism at an inaccessible cardinal