James C. Owings

According to our database, James C. Owings authored at least 11 papers between 1973 and 2002.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2002

Max and min limiters.

James C. Owings, William I. Gasarch, Georgia Martin

Arch. Math. Log., 2002

1993

Terse, Superterse, and Verbose Sets

Richard Beigel, William I. Gasarch, John Gill, James C. Owings

Inf. Comput., March, 1993

1992

Frequency Computations and the Cardinality Theorem.

Valentina S. Harizanov, Martin Kummer, James C. Owings

J. Symb. Log., 1992

1990

Weakly Semirecursive Sets.

Carl G. Jockusch Jr., James C. Owings

J. Symb. Log., 1990

1989

Corrigendum to "Diagonalization and the Recursion Theorem".

James C. Owings

Notre Dame J. Formal Log., 1989

A Cardinality Version of Biegel's Nonspeedup Theorem.

James C. Owings

J. Symb. Log., 1989

Nondeterministic Bounded Query Reducibilities.

Richard Beigel, William I. Gasarch, James C. Owings

Ann. Pure Appl. Log., 1989

1986

Effective Choice Functions and Index Sets.

James C. Owings

J. Comput. Syst. Sci., 1986

1976

Meeting of the Association for Symbolic Logic Washington, D.C., 1975.

James C. Owings, Hilary Putnam, Gerald E. Sacks

J. Symb. Log., 1976

1975

Splitting a Context-Sensitive Set.

James C. Owings

J. Comput. Syst. Sci., 1975

1973

Diagonalization and the recursion theorem.

James C. Owings

Notre Dame J. Formal Log., 1973