What makes a causal loop consistent?

Abstract

Causal loops escape paradoxes if they generate valid probabilities under arbitrary independent local interventions. We show that a deterministic classical process is logically consistent if and only if it contains no signaling loops: cyclic signaling is forbidden but cyclic causation is not, allowing indefinite causal order. Logical consistency is then found to hold exactly when the list of events of a process is pairwise exclusive and complete, providing the first event-based, intervention-free, non-recursive characterization of consistent causal loops. Our results repair a previously introduced intervention-free criterion that misses global loops and reveal that what makes deterministic classical communications without causal order consistent is a multipartite form of Specker's principle: if any two of several questions can be answered jointly, so can all of them.