  In most presentations of ACP with guarded recursion, recursive specifications
are finite or infinite sets of recursion equations of which the right-hand
sides are guarded terms. The completeness with respect to bisimulation
equivalence of the axioms of ACP with guarded recursion has only been proved
for the special case where recursive specifications are finite sets of
recursion equations of which the right-hand sides are guarded terms of a
restricted form known as linear terms. In this note, we widen this completeness
result to the general case.
