1. M. Benedikt, G. Dong, L. Libkin, and L. Wong. Relational expressive power of constraint query languages. In Proc. 15th ACM Symp. on Principles of Database Systems, pages 5–16, 1996.
2. R.L. Dougherty. Monotone but not positive subsets of the Cantor space. Journal of Symbolic Logic, 52 (3): 817–818, 1987.
3. Y. Gurevich and S. Shelah. Fixed-point extensions of first-order logic. Annals of Pure and Applied Logic, 32: 265–280, 1986.
4. D. Harel and T. Hirst. More about recursive structures: Descriptive complexity and zero-one laws. In E. Clarke, editor, Proc. 11th IEEE Symp. on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 1996. to appear.
5. R. Kaye. Models of Peano Arithmetic. Clarendon Press, Oxford, England, 1991.