... Lynch, and M. Merritt. Easy impossibility proofs for distributed consen-sus. Distributed Computing, 1(1): 26 39, 19 86. [22] M.J. Fisher, N.A. Lynch, and M.S. Paterson. Impossibility of distributed ... predicate(using and, ” “or,” and “p -of- q” connectors) on its outgoing links; examples of suchpredicates are as follows: “(two of l1,l2,l3)or(l1 and l4)” and “( l1 and l2)or(l3 and l4),” ... Processing Letters, 66 :309–318, 1998.[ 36] Y. Moses and S. Rajsbaum. A layered analysis of consensus. SIAM Journal on Computing,31(4):989–1021, 2002.[37] N. Nishikawa, T. Masuzawa, and N. Tokura....