Short conditional complete diagnostic tests for circuits under one-type constant faults of gates

We prove that any (almost any) $n$-place Boolean function can be implemented by a logic circuit in the “conjunction, disjunction, implication, negation” basis admitting a conditional complete diagnostic test of length at most $n$ (at most $n-1$, respectively) relative to constant faults of type $0$ on outputs of gates.