1. A complete list of papers published in the area of (complexity of) logical decision problem is out of the scope of this survey. However taking the union of all papers cited in any of the papers cited in this list will give you a rather complete picture of the situation
2. Aanderaa, Stål O. (1966): A Mew Undecidable Problem with Applications in Logic. Ph.D. thesis, Harvard University
3. Aanderaa, S.O. (1971): On the decision problem for formulas in which all disjunctions are binary. Proc. of the Second Scand. Log. Symp., pp. 1–18
4. The Horn complexity of Boolean functions and Cook's problem;Aanderaa,1979
5. The equivalence of Horn and network complexity for Boolean functions;Aanderaa;Acta Informatica,1981