It is known that for every finite formula, there is an equivalent formula in CNF (conjunctive normal form) and another equivalent formula in DNF (disjunctive normal form).
But can any subset K of set of boolean funcions: P → {0, 1} (propositional formula), where P is infinite countable set of propositional variables (language) be re-written into equivalent CNF and DNF form?