Usually when people say "not finitely axiomatizable" they just mean first-order logic. For example, Peano arithmetic is finitely axiomatizable using second-orde

Usually when people say "not finitely axiomatizable" they just mean first-order logic. For example, Peano arithmetic is finitely axiomatizable using second-order logic, which allows quantification of predicate variables, which is required for the axiom of induction.