1. Abiteboul, S., Vianu, V.: Generic computation and its complexity. In Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, pp. 209–219 (1991)
2. Ambos-Spies, K.: Polynomial time degrees of NP-sets. In: Börger, E.B (ed.) Trends in Theoretical Computer Science, pp. 95–142. Computer Science Press, Rockville (1988)
3. Baldwin, J.T.: Definable second-order quantifiers. In: Barwise, J., Feferman, S. (eds.) Model-Theoretic Logics, Perspectives in Mathematical Logic, Chapter 19. Springer (1985)
4. Barwise, J., Feferman, S. (eds.): Model-Theoretic Logics. Perspectives in Mathematical Logic. Springer, New York (1985)
5. Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and Real Computation. Complexity and Real Computation. Springer, New York (1998). https://doi.org/10.1007/978-1-4612-0701-6