Finite axiomatizability of cycle-free binary relations

40 Views Asked by At

Let $R$ be a binary relation. $R$ is said to be cycle-free iff there are no cycles in the relation, meaning, there are no $x_1, ... ,x_n$ such that $x_1 R x_2, ..., x_n R x_1$. Certainly, the class of cycle-free binary relations is axiomatizable by an infinite set of sentences. Is it also finitely axiomatizable?