is there a result in the literature about the inexpressibility of deterministic transitive closure in first-order logic with counting quantifiers along with ordering and multiplication?