| 2002 |
|---|
| 10 | EE | James C. Owings,
William I. Gasarch,
Georgia Martin:
Max and min limiters.
Arch. Math. Log. 41(5): 483-495 (2002) |
| 1993 |
|---|
| 9 | | Richard Beigel,
William I. Gasarch,
John Gill,
James C. Owings:
Terse, Superterse, and Verbose Sets
Inf. Comput. 103(1): 68-85 (1993) |
| 1992 |
|---|
| 8 | | Valentina S. Harizanov,
Martin Kummer,
James C. Owings:
Frequency Computations and the Cardinality Theorem.
J. Symb. Log. 57(2): 682-687 (1992) |
| 1990 |
|---|
| 7 | | Carl G. Jockusch Jr.,
James C. Owings:
Weakly Semirecursive Sets.
J. Symb. Log. 55(2): 637-644 (1990) |
| 1989 |
|---|
| 6 | | Richard Beigel,
William I. Gasarch,
James C. Owings:
Nondeterministic Bounded Query Reducibilities.
Ann. Pure Appl. Logic 41(2): 107-118 (1989) |
| 5 | | James C. Owings:
A Cardinality Version of Biegel's Nonspeedup Theorem.
J. Symb. Log. 54(3): 761-767 (1989) |
| 4 | | James C. Owings:
Corrigendum to ``Diagonalization and the Recursion Theorem''.
Notre Dame Journal of Formal Logic 30(1): 153 (1989) |
| 1986 |
|---|
| 3 | | James C. Owings:
Effective Choice Functions and Index Sets.
J. Comput. Syst. Sci. 32(3): 370-373 (1986) |
| 1976 |
|---|
| 2 | | James C. Owings,
Hilary Putnam,
Gerald E. Sacks:
Meeting of the Association for Symbolic Logic Washington, D.C., 1975.
J. Symb. Log. 41(1): 279-288 (1976) |
| 1975 |
|---|
| 1 | | James C. Owings:
Splitting a Context-Sensitive Set.
J. Comput. Syst. Sci. 10(1): 83-87 (1975) |
