1. Aanderaa, S.O.: 1971, ‘On the decision problem for formulas in which all disjunctions are binary’, in: Proc. 2nd Scandinavian Logic Symposium, pp. 1–18, 19.
2. Aanderaa, S.O. and Börger, E.: 1979, ‘The Horn complexity of Boolean functions and Cook’s problem’, in: Proc. 5th Scandinavian Logic Symposium (B. Mayoh and F. Jensen, eds.), Aalborg University Press, pp. 231–256.
3. Aanderaa, S.O. and Börger, E.: 1981, ‘The equivalence of Horn and network complexity for Boolean functions’, Acta Informatica 15,303–307.
4. Aanderaa, S.O. and Lewis, H.R.: 1973, ‘Prefix cJasses of Krom formulas’, JSL 38, 62–2.
5. Ackerman, W.: 1954, Solvable Cases of the Decision Problem, Amsterdam, North-Holland Publishing Co.