The Independence of Ramsey's Theorem. - E. M. Kleinberg (J. Symb. Log., 1969)

Strong Partition Properties for Infinite Cardinals. - E. M. Kleinberg (J. Symb. Log., 1970)

Recursion Theory and Formal Deducibility. - E. M. Kleinberg (J. Symb. Log., 1970)

On Large Cardinals and Partition Relations. - E. M. Kleinberg; Richard A. Shore (J. Symb. Log., 1971)

Weak Compactness and Square Bracket Partition Relations. - E. M. Kleinberg; Richard A. Shore (J. Symb. Log., 1972)

Rowbottom Cardinals and Jonsson Cardinals are Almost the Same. - E. M. Kleinberg (J. Symb. Log., 1973)

Infinite Exponent Partition Relations and Well-Ordered Choice. - E. M. Kleinberg; Joel I. Seiferas (J. Symb. Log., 1973)

Adding a Closed Unbounded Set. - James E. Baumgartner; Leo Harrington; E. M. Kleinberg (J. Symb. Log., 1976)

A Flipping Characterization of Ramsey Cardinals. - James M. Henle; Eugene M. Kleinberg (Math. Log. Q., 1978)

Producing Measurable Cardinals Beyond kappa. - E. M. Kleinberg (J. Symb. Log., 1981)

An Absoluteness Theorem. - Eugene M. Kleinberg (Math. Log. Q., 1981)

A Measure Representation Theorem for Strong Partition Cardinals. - E. M. Kleinberg (J. Symb. Log., 1982)

On the Ultrafilters and Ultrapowers of Strong Partition Cardinals. - James M. Henle; E. M. Kleinberg; Ronald J. Watro (J. Symb. Log., 1984)

Filters for Square-Bracket Partition Relations. - James M. Henle; Aki Kanamori; E. M. Kleinberg (Math. Log. Q., 1984)

Stochastic Discrimination. - E. M. Kleinberg (Ann. Math. Artif. Intell., 1990)

Building projectable classifiers of arbitrary complexity. - Tin Kam Ho; Eugene M. Kleinberg (ICPR, 1996)

A Mathematically Rigorous Foundation for Supervised Learning. - Eugene M. Kleinberg (Multiple Classifier Systems, 2000)

On the Algorithmic Implementation of Stochastic Discrimination. - Eugene M. Kleinberg (IEEE Trans. Pattern Anal. Mach. Intell., 2000)