The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Richard A. Shore: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  40. Every incomplete computably enumerable truth-table degree is branching. [Citation Graph (, )][DBLP]


  41. Conjectures and questions from Gerald Sacks's Degrees of Unsolvability. [Citation Graph (, )][DBLP]


  42. Degree Structures: Local and Global Investigations. [Citation Graph (, )][DBLP]


  43. Local Definitions in Degree Structures: The Turing Jump, Hyperdegrees and Beyond. [Citation Graph (, )][DBLP]


Search in 0.192secs, Finished in 0.195secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002