Diagonalization and the recursion theorem. - James C. Owings (Notre Dame J. Formal Log., 1973)

Splitting a Context-Sensitive Set. - James C. Owings (J. Comput. Syst. Sci., 1975)

Meeting of the Association for Symbolic Logic Washington, D.C., 1975. - James C. Owings; Hilary Putnam; Gerald E. Sacks (J. Symb. Log., 1976)

Effective Choice Functions and Index Sets. - James C. Owings (J. Comput. Syst. Sci., 1986)

Nondeterministic Bounded Query Reducibilities. - Richard Beigel; William I. Gasarch; James C. Owings (Ann. Pure Appl. Log., 1989)

A Cardinality Version of Biegel's Nonspeedup Theorem. - James C. Owings (J. Symb. Log., 1989)

Corrigendum to "Diagonalization and the Recursion Theorem". - James C. Owings (Notre Dame J. Formal Log., 1989)

Weakly Semirecursive Sets. - Carl G. Jockusch Jr.; James C. Owings (J. Symb. Log., 1990)

Frequency Computations and the Cardinality Theorem. - Valentina S. Harizanov; Martin Kummer; James C. Owings (J. Symb. Log., 1992)

Terse, Superterse, and Verbose Sets - Richard Beigel; William I. Gasarch; John Gill; James C. Owings (Inf. Comput., 1993)

Max and min limiters. - James C. Owings; William I. Gasarch; Georgia Martin (Arch. Math. Log., 2002)