On Large Cardinals and Partition Relations. - E. M. Kleinberg; Richard A. Shore (J. Symb. Log., 1971)

Weak Compactness and Square Bracket Partition Relations. - E. M. Kleinberg; Richard A. Shore (J. Symb. Log., 1972)

sigman Sets which are trianglen-Incomparable (Uniformly). - Richard A. Shore (J. Symb. Log., 1974)

Types of Simple alpha-Recursively Enumerable Sets. - Anne Leggett; Richard A. Shore (J. Symb. Log., 1976)

Controlling the Dependence Degree of a Recursive Enumerable Vector Space. - Richard A. Shore (J. Symb. Log., 1978)

Nowhere Simple Sets and the Lattice of Recursively Enumerable Sets. - Richard A. Shore (J. Symb. Log., 1978)

Some More Minimal Pairs of α-Recursively Enumerable Degrees. - Richard A. Shore (Math. Log. Q., 1978)

On Homogeneity and Definability in the First-Order Theory of the Turing Degrees. - Richard A. Shore (J. Symb. Log., 1982)

The arithmetic and Turing degrees are not elementarily equivalent. - Richard A. Shore (Arch. Math. Log., 1984)

Pseudo-Jump Operators. II: Transfinite Iterations, Hierarchies and Minimal Covers. - Carl G. Jockusch Jr.; Richard A. Shore (J. Symb. Log., 1984)

A non-inversion theorem for the jump operator. - Richard A. Shore (Ann. Pure Appl. Log., 1988)

Infima of recursively enumerable truth table degrees. - Peter A. Fejer; Richard A. Shore (Notre Dame J. Formal Log., 1988)

The P-T-Degrees of the Recursive Sets: Lattice Embeddings, Extension of Embeddings and the Two Quantifier Theory. - Richard A. Shore; Theodore A. Slaman (SCT, 1989)

Working below a low2 recursively enumerably degree. - Richard A. Shore; Theodore A. Slaman (Arch. Math. Log., 1990)

Undecidability and Initial Segments of the R.E. tt-Degrees. - Christine Ann Haught; Richard A. Shore (J. Symb. Log., 1990)

Then-rea enumeration degrees are dense. - Alistair H. Lachlan; Richard A. Shore (Arch. Math. Log., 1992)

On the strength of König's duality theorem for infinite bipartite graphs. - Ron Aharoni; Menachem Magidor; Richard A. Shore (J. Comb. Theory B, 1992)

The Theory of the Recursively Enumerable Weak Truth-Table Degrees Is Undecidability. - Klaus Ambos-Spies; André Nies; Richard A. Shore (J. Symb. Log., 1992)

The p-T Degrees of the Recursive Sets: Lattice Embeddings, Extensions of Embeddings and the Two-Quantifier Theory. - Richard A. Shore; Theodore A. Slaman (Theor. Comput. Sci., 1992)

Logic for Applications. - Anil Nerode; Richard A. Shore (Springer, 1993)

Undecidability and 1-Types in the Recursively Enumerable Degrees. - Klaus Ambos-Spies; Richard A. Shore (Ann. Pure Appl. Log., 1993)

Countable Thin Pi01 Classes. - Douglas A. Cenzer; Rodney G. Downey; Carl G. Jockusch Jr.; Richard A. Shore (Ann. Pure Appl. Log., 1993)

Working below a Highly Recursively Enumerable Degree. - Richard A. Shore; Theodore A. Slaman (J. Symb. Log., 1993)

Highness and Bounding Minimal Pairs. - Steffen Lempp; Rodney G. Downey; Richard A. Shore (Math. Log. Q., 1993)

Intervals Without Critical Triples. - Peter Cholak; Rod Downey; Richard A. Shore (Logic Colloquium, 1995)

Interpreting True Arithmetic in the Theory of the r.e. Truth Table Degrees. - André Nies; Richard A. Shore (Ann. Pure Appl. Log., 1995)

The Bulletin of Symbolic Logic. - Richard A. Shore (Bull. Symb. Log., 1995)

Degree Theoretic Definitions of the low2 Recursively Enumerable Sets. - Rodney G. Downey; Richard A. Shore (J. Symb. Log., 1995)

Categoricity and Scott Families. - Bakhadyr Khoussainov; Richard A. Shore (DMTCS, 1996)

Interpolating d-r.e. and REA Degrees between r.e. Degrees. - Marat M. Arslanov; Steffen Lempp; Richard A. Shore (Ann. Pure Appl. Log., 1996)

Definability in the recursively enumerable degrees. - André Nies; Richard A. Shore; Theodore A. Slaman (Bull. Symb. Log., 1996)

Logic for Applications, Second Edition. - Anil Nerode; Richard A. Shore (Springer, 1997)

Conjectures and questions from Gerald Sacks's Degrees of Unsolvability. - Richard A. Shore (Arch. Math. Log., 1997)

Logic Colloquium '95, Haifa, Israel, 9-17 August 1995 - Preface. - Richard A. Shore (Ann. Pure Appl. Log., 1997)

Alonzo Church. - Richard A. Shore (Bull. Symb. Log., 1997)

Computable Models of Theories with Few Models. - Bakhadyr Khoussainov; André Nies; Richard A. Shore (Notre Dame J. Formal Log., 1997)

Splitting Theorems and the Jump Operator. - Rodney G. Downey; Richard A. Shore (Ann. Pure Appl. Log., 1998)

Computable Isomorphisms, Degree Spectra of Relations, and Scott Families. - Bakhadyr Khoussainov; Richard A. Shore (Ann. Pure Appl. Log., 1998)

The Recursively Enumerable Degrees. - Richard A. Shore (Handbook of Computability Theory, 1999)

Erratum to "Computable Isomorphisms, Degree Spectra of Relations, and Scott Families". - Bakhadyr Khoussainov; Richard A. Shore (Ann. Pure Appl. Log., 1999)

Computably Categorical Structures and Expansions by Constants. - Peter Cholak; Sergei S. Goncharov; Bakhadyr Khoussainov; Richard A. Shore (J. Symb. Log., 1999)

Undecidability and 1-types in intervals of the computably enumerable degrees. - Klaus Ambos-Spies; Denis R. Hirschfeldt; Richard A. Shore (Ann. Pure Appl. Log., 2000)

Every incomplete computably enumerable truth-table degree is branching. - Peter A. Fejer; Richard A. Shore (Arch. Math. Log., 2001)

The prospects for mathematical logic in the twenty-first century. - Samuel R. Buss; Alexander S. Kechris; Anand Pillay; Richard A. Shore (Bull. Symb. Log., 2001)

Degree spectra and computable dimensions in algebraic structures. - Denis R. Hirschfeldt; Bakhadyr Khoussainov; Richard A. Shore; Arkadii M. Slinko (Ann. Pure Appl. Log., 2002)

A nonlow2 R. E. Degree with the Extension of Embeddings Properties of a low2 Degree. - Richard A. Shore; Yue Yang (Math. Log. Q., 2002)

Decomposition and infima in the computably enumerable degrees. - Rodney G. Downey; Geoffrey LaForte; Richard A. Shore (J. Symb. Log., 2003)

A computably categorical structure whose expansion by a constant has infinite computable dimension. - Denis R. Hirschfeldt; Bakhadyr Khoussainov; Richard A. Shore (J. Symb. Log., 2003)

Reasoning about common knowledge with infinitely many agents. - Joseph Y. Halpern; Richard A. Shore (Inf. Comput., 2004)

Pi11 relations and paths through. - Sergei S. Goncharov; Valentina S. Harizanov; Julia F. Knight; Richard A. Shore (J. Symb. Log., 2004)

Generalized high degrees have the complementation property. - Noam Greenberg; Antonio Montalbán; Richard A. Shore (J. Symb. Log., 2004)

A computably stable structure with no Scott family of finitary formulas. - Peter Cholak; Richard A. Shore; Reed Solomon (Arch. Math. Log., 2006)

Degree Structures: Local and Global Investigations. - Richard A. Shore (Bull. Symb. Log., 2006)

The Theory of the Metarecursively Enumerable Degrees. - Noam Greenberg; Richard A. Shore; Theodore A. Slaman (J. Math. Log., 2006)

Boolean Algebras, Tarski Invariants, and Index Sets. - Barbara F. Csima; Antonio Montalbán; Richard A. Shore (Notre Dame J. Formal Log., 2006)

Local Definitions in Degree Structures: The Turing Jump, Hyperdegrees and Beyond. - Richard A. Shore (Bull. Symb. Log., 2007)

Direct and Local Definitions of the Turing jump. - Richard A. Shore (J. Math. Log., 2007)

The settling-time reducibility ordering. - Barbara F. Csima; Richard A. Shore (J. Symb. Log., 2007)

Combinatorial principles weaker than Ramsey's Theorem for pairs. - Denis R. Hirschfeldt; Richard A. Shore (J. Symb. Log., 2007)

Reverse mathematics: the playground of logic. - Richard A. Shore (Bull. Symb. Log., 2010)

Lattice initial segments of the hyperdegrees. - Bjørn Kjos-Hanssen; Richard A. Shore (J. Symb. Log., 2010)

Topological aspects of the Medvedev lattice. - Andrew E. M. Lewis; Richard A. Shore; Andrea Sorbi (Arch. Math. Log., 2011)

The maximal linear extension theorem in second order arithmetic. - Alberto Marcone; Richard A. Shore (Arch. Math. Log., 2011)

Computing maximal chains. - Alberto Marcone; Antonio Montalbán; Richard A. Shore (Arch. Math. Log., 2012)

Computably Enumerable Partial Orders. - Peter Cholak; Damir D. Dzhafarov; Noah David Schweber; Richard A. Shore (Comput., 2012)

The n-R.E. Degrees: Undecidability and σ1 Substructures. - Mingzhong Cai; Richard A. Shore; Theodore A. Slaman (J. Math. Log., 2012)

Domination, forcing, array nonrecursiveness and relative recursive enumerability. - Mingzhong Cai; Richard A. Shore (J. Symb. Log., 2012)

Low level nondefinability results: Domination and recursive enumeration. - Mingzhong Cai; Richard A. Shore (J. Symb. Log., 2013)

Degrees of Categoricity and the Hyperarithmetic Hierarchy. - Barbara F. Csima; Johanna N. Y. Franklin; Richard A. Shore (Notre Dame J. Formal Log., 2013)

The complexity of ascendant sequences in locally nilpotent groups. - Chris J. Conidis; Richard A. Shore (Int. J. Algebra Comput., 2014)

The Turing Degrees below generics and randoms. - Richard A. Shore (J. Symb. Log., 2014)

The strength of the Grätzer-Schmidt theorem. - Katie Brodhead; Mushfeq Khan; Bjørn Kjos-Hanssen; William A. Lampe; Paul Kim Long V. Nguyen; Richard A. Shore (Arch. Math. Log., 2016)

Mass problems and density. - Stephen Binns; Richard A. Shore; Stephen G. Simpson (J. Math. Log., 2016)

Σ _1^1 in Every Real in a Σ _1^1 Class of Reals Is Σ _1^1. - Leo Harrington; Richard A. Shore; Theodore A. Slaman (Computability and Complexity, 2017)

Conservativity of Ultrafilters over Subsystems of second order Arithmetic. - Antonio Montalbán; Richard A. Shore (J. Symb. Log., 2018)

On the Jumps of the Degrees Below a Recursively Enumerable Degree. - David R. Bélanger; Richard A. Shore (Notre Dame J. Formal Log., 2018)

Theorems of Hyperarithmetic Analysis and Almost theorems of Hyperarithmetic Analysis. - James S. Barnes; Jun Le Goh; Richard A. Shore (Bull. Symb. Log., 2022)

Almost theorems of Hyperarithmetic Analysis. - Richard A. Shore (J. Symb. Log., 2023)

Halin's infinite ray theorems: Complexity and reverse mathematics. - James S. Barnes; Jun Le Goh; Richard A. Shore (J. Math. Log., 2025)