As Goedel said, to every w-consistent class k of formulae there correspond recursive class signs r, such that neither v Gen r nor negative (v Gen r) belongs to Flg k (where v is the free variable of r).
Yes, this part of the thread made me scratch my head too...