Implicit Definability and Infinitary Languages. - Kenneth Kunen (J. Symb. Log., 1968)

Elementary Embeddings and Infinitary Combinatorics. - Kenneth Kunen (J. Symb. Log., 1971)

On Descendingly Incomplete Ultrafilters. - Kenneth Kunen; Karel Prikry (J. Symb. Log., 1971)

Annual Meeting of the Association for Symbolic Logic: Saint Louis, 1977. - Jon Barwise; Kenneth Kunen; Joseph S. Ullian (J. Symb. Log., 1978)

Saturated Ideals. - Kenneth Kunen (J. Symb. Log., 1978)

The Kleene Symposium and the Summer Meeting of the Association for Symbolic Logic. - John Addison; Jon Barwise; H. Jerome Keisler; Kenneth Kunen; Yiannis N. Moschovakis (J. Symb. Log., 1979)

Set theory - an introduction to independence proofs. - Kenneth Kunen (North-Holland, 1983)

On a Combinatorial Property of Menas Related to the Partition Property for Measures on Supercompact Cardinals. - Kenneth Kunen; Donald H. Pelletier (J. Symb. Log., 1983)

A Minimal Degree Which Collapses omega1. - Tim Carlson; Kenneth Kunen; Arnold W. Miller (J. Symb. Log., 1984)

Completeness Results for Inequality Provers. - W. W. Bledsoe; Kenneth Kunen; Robert E. Shostak (Artif. Intell., 1985)

Answer Sets and Negation-as-Failure. - Kenneth Kunen (ICLP, 1987)

Negation in Logic Programming. - Kenneth Kunen (J. Log. Program., 1987)

Some Remarks on the Completed Database. - Kenneth Kunen (ICLP/SLP, 1988)

Where Ma First Fails. - Kenneth Kunen (J. Symb. Log., 1988)

Signed Data Dependencies in Logic Programs. - Kenneth Kunen (J. Log. Program., 1989)

Descriptive Set Theory Over Hyperfinite Sets. - H. Jerome Keisler; Kenneth Kunen; Arnold W. Miller; Steven C. Leth (J. Symb. Log., 1989)

On the Structure and Complexity of Infinite Sets with Minimal Perfect Hash Functions. - Judy Goldsmith; Lane A. Hemachandra; Kenneth Kunen (FSTTCS, 1991)

Declarative Semantics of Logic Programming. - Kenneth Kunen (Bull. EATCS, 1991)

Polynomial-Time Compression. - Judy Goldsmith; Lane A. Hemachandra; Kenneth Kunen (Comput. Complex., 1992)

Single Axioms for Groups. - Kenneth Kunen (J. Autom. Reason., 1992)

Declarative Semantics of Logic Programming. - Kenneth Kunen (Current Trends in Theoretical Computer Science, 1993)

Single Axioms for Odd Exponent Groups. - Joan Hart; Kenneth Kunen (J. Autom. Reason., 1995)

A Ramsey Theorem in Boyer-Moore Logic. - Kenneth Kunen (J. Autom. Reason., 1995)

The Semantics of Answer Literals. - Kenneth Kunen (J. Autom. Reason., 1996)

Nonconstructive Computational Mathematics. - Kenneth Kunen (J. Autom. Reason., 1998)

The Real Line in Elementary Submodels of Set Theory. - Kenneth Kunen; Franklin D. Tall (J. Symb. Log., 2000)

Gregory trees, the continuum, and Martin's axiom. - Kenneth Kunen; Dilip Raghavan (J. Symb. Log., 2009)

Forcing and Differentiable Functions. - Kenneth Kunen (Order, 2012)

Continuous Maps on Aronszajn Trees. - Kenneth Kunen; Jean A. Larson; Juris Steprans (Order, 2012)