Completeness of the De Morgan basis #

Every Boolean function has a De Morgan circuit, by the Lupanov construction with no data bits, so the basis is complete and complexity interpretation f is the circuit complexity of f over it, for any number of outputs. This agrees with the standard measure of [Jukna, Chapter 1][Jukna2012] up to the counting of constants and negations; see Cslib.Computability.Circuit.Boolean.Basic.