Uniform Reliable Broadcast (URB) is a communication prim- itive that requires that if a process delivers a message, then all correct processes also deliver this message. A recent paper [HR99] uses Knowl- edge Theory to determine what failure detectors are necessary to imple- ment this primitive in asynchronous systems with process crashes and lossy links that are fair. In this paper, we revisit this problem using a different approach, and provide a result that is simpler, more intuitive, and, in a precise sense, more general.