1. Alechina, N., On a decidable generalized quantifier logic corresponding to a decidable fragment of predicate logic, Journal of Logic, Language and Information 4(3) (1995), 177–189.
2. Report;N. Alechina,1997
3. Alechina, N. and van Lambalgen, M., Correspondence and completeness for generalized quantifiers, Bulletin of the Interest Group in Pure and Applied Logic 3(1995), 167–190.
4. Andréka, H., Complexity of Equations Valid in Algebras of Relations, D. Sc. Dissertation, Hungarian Academy of Sciences, Budapest, 1991. To appear in Annals of Pure and Applied Logic.
5. Andréka, H., van Benthem, J. and Németi, I., What Makes Modal Logic Tick?, manuscript, Institute for Logic, Language and Computation, University of Amsterdam, 1992.