Kees Doets

According to our database, Kees Doets authored at least 12 papers between 1987 and 2001.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2001

Uniform Short Proofs for Classical Theorems.

Kees Doets

Notre Dame J. Formal Log., 2001

1999

Relatives of the Russell Paradox.

Kees Doets

Math. Log. Q., 1999

1998

Elementary Properties of the Finite Ranks.

Anuj Dawar, Kees Doets, Steven Lindell, Scott Weinstein

Math. Log. Q., 1998

1996

Basic model theory.

Kees Doets

Studies in logic, language and information, CSLI, ISBN: 978-1-57586-049-7, 1996

1994

Left Termination Turned into Termination.

Kees Doets

Theor. Comput. Sci., 1994

A New Definition of SNDNF-Resolution.

Krzysztof R. Apt, Kees Doets

J. Log. Program., 1994

From logic to logic programming.

Kees Doets

Foundations of computing series, MIT Press, ISBN: 978-0-262-04142-3, 1994

1993

Levationis Laus.

Kees Doets

J. Log. Comput., 1993

1992

A Slight Strengthening of a Theorem of Blair and Kunen.

Kees Doets

Theor. Comput. Sci., 1992

1991

Axiomatizing Universal Properties of Quantifiers.

Kees Doets

J. Symb. Log., 1991

1989

Monadic Π₁¹-Theories of Π₁¹-Properties.

Kees Doets

Notre Dame J. Formal Log., 1989

1987

On n-equivalence of binary trees.

Kees Doets

Notre Dame J. Formal Log., 1987