Following recent works connecting two-variable logic to circuits and monoids, we establish, for numerical predicate sets P satisfying a certain closure property, a one-to-one correspondence between FO[<, P]-uniform linear circuits, two-variable formulas with P predicates, and weak block products of monoids. In particular, we consider the case of linear TC, majority quantifiers, and finitely typ...
