We present a Hilbert style axiomatisation for the set of formulas in the temporal language with F and P which are valid over non-transitive cyclical flows of time. We also give a simpler axiomatisation using the slightly controversial 'irreflexivity rule' and go on to prove the decidability of any temporal logic over cyclical time provided it uses only connectives with first-order tables.

It has sometimes been suggested that backwards time travel always incurs causal loops. I show that this is mistaken, by describing worlds where backwards time travel occurs and yet no causal loops occur. Arguments that backwards time travel can occur without causal loops have been given before in the literature, but I show that those arguments are unconvincing.