A regular language is star-free iff it is definable in first-order logic of linear order FO[<] iff its syntactic monoid is aperiodic. The equivalence characterizes languages without modulo counting.