James C. Owings

11 papers Journal 11
YearRankTypeTitle / Venue / Authors
2002 J jnl
Max and min limiters.
Arch. Math. Log.
James C. Owings, William I. Gasarch, Georgia Martin
1993 J jnl
Terse, Superterse, and Verbose Sets
Inf. Comput.
Richard Beigel, William I. Gasarch, John Gill, James C. Owings
1992 J jnl
Frequency Computations and the Cardinality Theorem.
J. Symb. Log.
Valentina S. Harizanov, Martin Kummer, James C. Owings
1990 J jnl
Weakly Semirecursive Sets.
J. Symb. Log.
Carl G. Jockusch Jr., James C. Owings
1989 J jnl
A Cardinality Version of Biegel's Nonspeedup Theorem.
J. Symb. Log.
James C. Owings
1989 J jnl
Corrigendum to "Diagonalization and the Recursion Theorem".
Notre Dame J. Formal Log.
James C. Owings
1989 J jnl
Nondeterministic Bounded Query Reducibilities.
Ann. Pure Appl. Log.
Richard Beigel, William I. Gasarch, James C. Owings
1986 J jnl
Effective Choice Functions and Index Sets.
J. Comput. Syst. Sci.
James C. Owings
1976 J jnl
Meeting of the Association for Symbolic Logic Washington, D.C., 1975.
J. Symb. Log.
James C. Owings, Hilary Putnam, Gerald E. Sacks
1975 J jnl
Splitting a Context-Sensitive Set.
J. Comput. Syst. Sci.
James C. Owings
1973 J jnl
Diagonalization and the recursion theorem.
Notre Dame J. Formal Log.
James C. Owings