Numerical representation of intransitive preferences on a countable set

Let > be a preference relation on a countable set X. We prove that if > is acyclic (that is, has irreflexive transitive closure), then there exists a mapping u of X into $\text{R}$ such that x > y entails u(x)>u(y). We also give a simple proof of a representation theorem of Fishburn when > is an interval order.