Recursion, Metarecursion, and Inclusion. - James C. Owings Jr. (J. Symb. Log., 1967)

pi11 Sets, omega-Sets, and Metacompleteness. - James C. Owings Jr. (J. Symb. Log., 1969)

The Meta-R.E. Sets, but Not the pi11 Sets, Can Be Enumerated Without Repetition. - James C. Owings Jr. (J. Symb. Log., 1970)

A Splitting Theorem for Simple pi11 Sets. - James C. Owings Jr. (J. Symb. Log., 1971)

A class of universal linear bounded automata. - Eliot D. Feldman; James C. Owings Jr. (Inf. Sci., 1973)

The Inequivalence of Two Well-Known Notions of Randomness for Binary Sequences. - Thomas Herzog; James C. Owings Jr. (Math. Log. Q., 1976)

A Sum of Chebyshev Inequalities: 10687. - James C. Owings Jr.; Jeremy E. Dawson; Robin J. Chapman; Darryl K. Nester; Robert A. Agnew; John Beebee; David Callan; R. Garcia-Pelayo; V. Hernandez; J. Martin; J. Hickman; D. Jones; et al. (Am. Math. Mon., 2000)