On n-equivalence of binary trees. - Kees Doets (Notre Dame J. Formal Log., 1987)

Monadic Π11-Theories of Π11-Properties. - Kees Doets (Notre Dame J. Formal Log., 1989)

Axiomatizing Universal Properties of Quantifiers. - Kees Doets (J. Symb. Log., 1991)

A Slight Strengthening of a Theorem of Blair and Kunen. - Kees Doets (Theor. Comput. Sci., 1992)

Levationis Laus. - Kees Doets (J. Log. Comput., 1993)

From logic to logic programming. - Kees Doets (MIT Press, 1994)

A New Definition of SNDNF-Resolution. - Krzysztof R. Apt; Kees Doets (J. Log. Program., 1994)

Left Termination Turned into Termination. - Kees Doets (Theor. Comput. Sci., 1994)

Basic model theory. - Kees Doets (CSLI, 1996)

Elementary Properties of the Finite Ranks. - Anuj Dawar; Kees Doets; Steven Lindell; Scott Weinstein (Math. Log. Q., 1998)

Relatives of the Russell Paradox. - Kees Doets (Math. Log. Q., 1999)

Uniform Short Proofs for Classical Theorems. - Kees Doets (Notre Dame J. Formal Log., 2001)