1. J.K. Barwise, Admissible sets and structures, Springer, Berlin 1975.
2. A.K. Chandra and D. Harel, Computable queries for relational data bases, JCSS vol. 21.2 (1980) pp. 156–178.
3. A.K. Chandra and D. Harel, Structure and complexity of relational queries, JCSS vol. 25, (1982) pp. 99–128.
4. E. Dahlhaus and J.A. Makowsky, Computable Directory Queries, Technical report of the Institut fuer Informatik, ETH-Zuerich, No. 65 (September 1985), extended abstract to appear in the Proceedings of CAAP '86, LNCS, Springer, Berlin 1986.
5. R. Fagin, Generalized first order spectra and polynomial-time recognizable sets, in: Complexity of Computation, R.Karp ed., SIAM-AMS Proceedings no. 7 (1974) p.27–41.