1. Abramsky, S., Gabbay, D.M., Maibaumeditors, T.S.E. (eds.): Handbook of Logic in Computer Science. Oxford University Press, Oxford (1992). Background: Mathematical Structures
2. Blum, M.: A machine-independent theory of the complexity of recursive functions. J. ACM 14(2), 322–336 (1967)
3. Blum, M.: On effective procedures for speeding up algorithms. J. ACM 18(2), 290–305 (1971)
4. Annals of Discrete Mathematics;C. Calude,1988
5. Cook, S.A.: Computability and complexity of higher type functions. In: Logic from Computer Science, pp. 51–72. Springer, Berlin (1991)