2006 |
41 | EE | Peter Cholak,
Richard A. Shore,
Reed Solomon:
A computably stable structure with no Scott family of finitary formulas.
Arch. Math. Log. 45(5): 519-538 (2006) |
2004 |
40 | EE | Joseph Y. Halpern,
Richard A. Shore:
Reasoning about common knowledge with infinitely many agents.
Inf. Comput. 191(1): 1-40 (2004) |
2003 |
39 | | Rodney G. Downey,
Geoffrey LaForte,
Richard A. Shore:
Decomposition and infima in the computably enumerable degrees.
J. Symb. Log. 68(2): 551-579 (2003) |
2002 |
38 | | Denis R. Hirschfeldt,
Bakhadyr Khoussainov,
Richard A. Shore,
Arkadii M. Slinko:
Degree spectra and computable dimensions in algebraic structures.
Ann. Pure Appl. Logic 115(1-3): 71-113 (2002) |
37 | EE | Samuel R. Buss,
Alexander S. Kechris,
Anand Pillay,
Richard A. Shore:
The prospects for mathematical logic in the twenty-first century
CoRR cs.LO/0205003: (2002) |
36 | EE | Richard A. Shore,
Yue Yang:
A nonlow2 R. E. Degree with the Extension of Embeddings Properties of a low2 Degree.
Math. Log. Q. 48(1): 131-146 (2002) |
2001 |
35 | EE | Peter A. Fejer,
Richard A. Shore:
Every incomplete computably enumerable truth-table degree is branching.
Arch. Math. Log. 40(2): 113-123 (2001) |
34 | EE | Samuel R. Buss,
Alexander S. Kechris,
Anand Pillay,
Richard A. Shore:
The prospects for mathematical logic in the twenty-first century.
Bulletin of Symbolic Logic 7(2): 169-196 (2001) |
2000 |
33 | | Klaus Ambos-Spies,
Denis R. Hirschfeldt,
Richard A. Shore:
Undecidability and 1-types in intervals of the computably enumerable degrees.
Ann. Pure Appl. Logic 106(1-3): 1-47 (2000) |
1999 |
32 | EE | Joseph Y. Halpern,
Richard A. Shore:
Reasoning about Common Knowledge with Infinitely Many Agents.
LICS 1999: 384-393 |
31 | | Bakhadyr Khoussainov,
Richard A. Shore:
Erratum to "Computable Isomorphisms, Degree Spectra of Relations, and Scott Families".
Ann. Pure Appl. Logic 98(1-3): 297-298 (1999) |
30 | EE | Joseph Y. Halpern,
Richard A. Shore:
Reasoning About Common Knowledge with Infinitely Many Agents
CoRR cs.LO/9909014: (1999) |
29 | | Peter Cholak,
Sergei S. Goncharov,
Bakhadyr Khoussainov,
Richard A. Shore:
Computably Categorical Structures and Expansions by Constants.
J. Symb. Log. 64(1): 13-37 (1999) |
1998 |
28 | | Bakhadyr Khoussainov,
Richard A. Shore:
Computable Isomorphisms, Degree Spectra of Relations, and Scott Families.
Ann. Pure Appl. Logic 93(1-3): 153-193 (1998) |
27 | | Rodney G. Downey,
Richard A. Shore:
Splitting Theorems and the Jump Operator.
Ann. Pure Appl. Logic 94(1-3): 45-52 (1998) |
1997 |
26 | | Richard A. Shore:
Logic Colloquium '95, Haifa, Israel, 9-17 August 1995 - Preface.
Ann. Pure Appl. Logic 87(2): 101-102 (1997) |
25 | EE | Richard A. Shore:
Conjectures and questions from Gerald Sacks's Degrees of Unsolvability.
Arch. Math. Log. 36(4-5): 233-253 (1997) |
24 | EE | Richard A. Shore:
Alonzo Church.
Bulletin of Symbolic Logic 3(2): 153- (1997) |
23 | | Bakhadyr Khoussainov,
André Nies,
Richard A. Shore:
Computable Models of Theories with Few Models.
Notre Dame Journal of Formal Logic 38(2): 165-178 (1997) |
1996 |
22 | | Marat M. Arslanov,
Steffen Lempp,
Richard A. Shore:
Interpolating d-r.e. and REA Degrees between r.e. Degrees.
Ann. Pure Appl. Logic 78(1-3): 29-56 (1996) |
21 | EE | André Nies,
Richard A. Shore,
Theodore A. Slaman:
Definability in the recursively enumerable degrees.
Bulletin of Symbolic Logic 2(4): 392-404 (1996) |
1995 |
20 | | André Nies,
Richard A. Shore:
Interpreting True Arithmetic in the Theory of the r.e. Truth Table Degrees.
Ann. Pure Appl. Logic 75(3): 269-311 (1995) |
19 | EE | Richard A. Shore:
The Bulletin of Symbolic Logic.
Bulletin of Symbolic Logic 1(1): 1-3 (1995) |
18 | | Rodney G. Downey,
Richard A. Shore:
Degree Theoretic Definitions of the low2 Recursively Enumerable Sets.
J. Symb. Log. 60(3): 727-756 (1995) |
1993 |
17 | | Douglas A. Cenzer,
Rodney G. Downey,
Carl G. Jockusch Jr.,
Richard A. Shore:
Countable Thin Pi01 Classes.
Ann. Pure Appl. Logic 59(2): 79-139 (1993) |
16 | | Klaus Ambos-Spies,
Richard A. Shore:
Undecidability and 1-Types in the Recursively Enumerable Degrees.
Ann. Pure Appl. Logic 63(1): 3-37 (1993) |
15 | | Richard A. Shore,
Theodore A. Slaman:
Working below a Highly Recursively Enumerable Degree.
J. Symb. Log. 58(3): 824-859 (1993) |
14 | | Steffen Lempp,
Rodney G. Downey,
Richard A. Shore:
Highness and Bounding Minimal Pairs.
Math. Log. Q. 39: 475-491 (1993) |
1992 |
13 | EE | Ron Aharoni,
Menachem Magidor,
Richard A. Shore:
On the strength of König's duality theorem for infinite bipartite graphs.
J. Comb. Theory, Ser. B 54(2): 257-290 (1992) |
12 | | Klaus Ambos-Spies,
André Nies,
Richard A. Shore:
The Theory of the Recursively Enumerable Weak Truth-Table Degrees Is Undecidability.
J. Symb. Log. 57(3): 864-874 (1992) |
11 | | Richard A. Shore,
Theodore A. Slaman:
The p-T Degrees of the Recursive Sets: Lattice Embeddings, Extensions of Embeddings and the Two-Quantifier Theory.
Theor. Comput. Sci. 97(2): 263-284 (1992) |
1990 |
10 | | Christine Ann Haught,
Richard A. Shore:
Undecidability and Initial Segments of the R.E. tt-Degrees.
J. Symb. Log. 55(3): 987-1006 (1990) |
1989 |
9 | | Richard A. Shore,
Theodore A. Slaman:
The P-T-Degrees of the Recursive Sets: Lattice Embeddings, Extension of Embeddings and the Two Quantifier Theory.
Structure in Complexity Theory Conference 1989: 68-76 |
1984 |
8 | | Carl G. Jockusch Jr.,
Richard A. Shore:
Pseudo-Jump Operators. II: Transfinite Iterations, Hierarchies and Minimal Covers.
J. Symb. Log. 49(4): 1205-1236 (1984) |
1982 |
7 | | Richard A. Shore:
On Homogeneity and Definability in the First-Order Theory of the Turing Degrees.
J. Symb. Log. 47(1): 8-16 (1982) |
1978 |
6 | | Richard A. Shore:
Controlling the Dependence Degree of a Recursive Enumerable Vector Space.
J. Symb. Log. 43(1): 13-22 (1978) |
5 | | Richard A. Shore:
Nowhere Simple Sets and the Lattice of Recursively Enumerable Sets.
J. Symb. Log. 43(2): 322-330 (1978) |
1976 |
4 | | Anne Leggett,
Richard A. Shore:
Types of Simple alpha-Recursively Enumerable Sets.
J. Symb. Log. 41(3): 681-694 (1976) |
1974 |
3 | | Richard A. Shore:
sigman Sets which are trianglen-Incomparable (Uniformly).
J. Symb. Log. 39(2): 295-304 (1974) |
1972 |
2 | | E. M. Kleinberg,
Richard A. Shore:
Weak Compactness and Square Bracket Partition Relations.
J. Symb. Log. 37(4): 673-676 (1972) |
1971 |
1 | | E. M. Kleinberg,
Richard A. Shore:
On Large Cardinals and Partition Relations.
J. Symb. Log. 36(2): 305-308 (1971) |