Richard A. Shore

Publication Activity (10 Years)

Years Active: 1971-2023
Publications (10 Years): 7

Top Topics

Interactive Theorem Proving

Recursively Enumerable

Top Venues

Bull. Symb. Log.

Arch. Math. Log.

Int. J. Algebra Comput.

Publications

Richard A. Shore
Almost theorems of Hyperarithmetic Analysis. J. Symb. Log. 88 (2) (2023)
James S. Barnes, Jun Le Goh, Richard A. Shore
Theorems of Hyperarithmetic Analysis and Almost theorems of Hyperarithmetic Analysis. Bull. Symb. Log. 28 (1) (2022)
Antonio Montalbán, Richard A. Shore
Conservativity of Ultrafilters over Subsystems of second order Arithmetic. J. Symb. Log. 83 (2) (2018)
David R. Bélanger, Richard A. Shore
On the Jumps of the Degrees Below a Recursively Enumerable Degree. Notre Dame J. Formal Log. 59 (1) (2018)
Leo Harrington, Richard A. Shore, Theodore A. Slaman
Σ _1^1 in Every Real in a Σ _1^1 Class of Reals Is Σ _1^1. Computability and Complexity (2017)
Stephen Binns, Richard A. Shore, Stephen G. Simpson
Mass problems and density. J. Math. Log. 16 (2) (2016)
Katie Brodhead, Mushfeq Khan, Bjørn Kjos-Hanssen, William A. Lampe, Paul Kim Long V. Nguyen, Richard A. Shore
The strength of the Grätzer-Schmidt theorem. Arch. Math. Log. 55 (5-6) (2016)
Chris J. Conidis, Richard A. Shore
The complexity of ascendant sequences in locally nilpotent groups. Int. J. Algebra Comput. 24 (2) (2014)
Richard A. Shore
The Turing Degrees below generics and randoms. J. Symb. Log. 79 (1) (2014)
Barbara F. Csima, Johanna N. Y. Franklin, Richard A. Shore
Degrees of Categoricity and the Hyperarithmetic Hierarchy. Notre Dame J. Formal Log. 54 (2) (2013)
Mingzhong Cai, Richard A. Shore
Low level nondefinability results: Domination and recursive enumeration. J. Symb. Log. 78 (3) (2013)
Alberto Marcone, Antonio Montalbán, Richard A. Shore
Computing maximal chains. Arch. Math. Log. 51 (5-6) (2012)
Peter Cholak, Damir D. Dzhafarov, Noah David Schweber, Richard A. Shore
Computably Enumerable Partial Orders. Comput. 1 (2) (2012)
Mingzhong Cai, Richard A. Shore, Theodore A. Slaman
Substructures. J. Math. Log. 12 (1) (2012)
Mingzhong Cai, Richard A. Shore
Domination, forcing, array nonrecursiveness and relative recursive enumerability. J. Symb. Log. 77 (1) (2012)
Andrew E. M. Lewis, Richard A. Shore, Andrea Sorbi
Topological aspects of the Medvedev lattice. Arch. Math. Log. 50 (3-4) (2011)
Alberto Marcone, Richard A. Shore
The maximal linear extension theorem in second order arithmetic. Arch. Math. Log. 50 (5-6) (2011)
Richard A. Shore
Reverse mathematics: the playground of logic. Bull. Symb. Log. 16 (3) (2010)
Bjørn Kjos-Hanssen, Richard A. Shore
Lattice initial segments of the hyperdegrees. J. Symb. Log. 75 (1) (2010)
Richard A. Shore
Direct and Local Definitions of the Turing jump. J. Math. Log. 7 (2) (2007)
Denis R. Hirschfeldt, Richard A. Shore
Combinatorial principles weaker than Ramsey's Theorem for pairs. J. Symb. Log. 72 (1) (2007)
Barbara F. Csima, Richard A. Shore
The settling-time reducibility ordering. J. Symb. Log. 72 (3) (2007)
Richard A. Shore
Local Definitions in Degree Structures: The Turing Jump, Hyperdegrees and Beyond. Bull. Symb. Log. 13 (2) (2007)
Richard A. Shore
Degree Structures: Local and Global Investigations. Bull. Symb. Log. 12 (3) (2006)
Peter Cholak, Richard A. Shore, Reed Solomon
A computably stable structure with no Scott family of finitary formulas. Arch. Math. Log. 45 (5) (2006)
Barbara F. Csima, Antonio Montalbán, Richard A. Shore
Boolean Algebras, Tarski Invariants, and Index Sets. Notre Dame J. Formal Log. 47 (1) (2006)
Noam Greenberg, Richard A. Shore, Theodore A. Slaman
The Theory of the Metarecursively Enumerable Degrees. J. Math. Log. 6 (1) (2006)
Joseph Y. Halpern, Richard A. Shore
Reasoning about common knowledge with infinitely many agents. Inf. Comput. 191 (1) (2004)
Noam Greenberg, Antonio Montalbán, Richard A. Shore
Generalized high degrees have the complementation property. J. Symb. Log. 69 (4) (2004)
Sergei S. Goncharov, Valentina S. Harizanov, Julia F. Knight, Richard A. Shore
relations and paths through. J. Symb. Log. 69 (2) (2004)
Denis R. Hirschfeldt, Bakhadyr Khoussainov, Richard A. Shore
A computably categorical structure whose expansion by a constant has infinite computable dimension. J. Symb. Log. 68 (4) (2003)
Rodney G. Downey, Geoffrey LaForte, Richard A. Shore
Decomposition and infima in the computably enumerable degrees. J. Symb. Log. 68 (2) (2003)
Samuel R. Buss, Alexander S. Kechris, Anand Pillay, Richard A. Shore
The prospects for mathematical logic in the twenty-first century CoRR (2002)
Denis R. Hirschfeldt, Bakhadyr Khoussainov, Richard A. Shore, Arkadii M. Slinko
Degree spectra and computable dimensions in algebraic structures. Ann. Pure Appl. Log. 115 (1-3) (2002)
Richard A. Shore, Yue Yang
Degree. Math. Log. Q. 48 (1) (2002)
Peter A. Fejer, Richard A. Shore
Every incomplete computably enumerable truth-table degree is branching. Arch. Math. Log. 40 (2) (2001)
Samuel R. Buss, Alexander S. Kechris, Anand Pillay, Richard A. Shore
The prospects for mathematical logic in the twenty-first century. Bull. Symb. Log. 7 (2) (2001)
Klaus Ambos-Spies, Denis R. Hirschfeldt, Richard A. Shore
Undecidability and 1-types in intervals of the computably enumerable degrees. Ann. Pure Appl. Log. 106 (1-3) (2000)
Bakhadyr Khoussainov, Richard A. Shore
Erratum to "Computable Isomorphisms, Degree Spectra of Relations, and Scott Families". Ann. Pure Appl. Log. 98 (1-3) (1999)
Joseph Y. Halpern, Richard A. Shore
Reasoning about Common Knowledge with Infinitely Many Agents. LICS (1999)
Peter Cholak, Sergei S. Goncharov, Bakhadyr Khoussainov, Richard A. Shore
Computably Categorical Structures and Expansions by Constants. J. Symb. Log. 64 (1) (1999)
Joseph Y. Halpern, Richard A. Shore
Reasoning About Common Knowledge with Infinitely Many Agents CoRR (1999)
Rodney G. Downey, Richard A. Shore
Splitting Theorems and the Jump Operator. Ann. Pure Appl. Log. 94 (1-3) (1998)
Bakhadyr Khoussainov, Richard A. Shore
Computable Isomorphisms, Degree Spectra of Relations, and Scott Families. Ann. Pure Appl. Log. 93 (1-3) (1998)
Richard A. Shore
. Arch. Math. Log. 36 (4-5) (1997)
Richard A. Shore
Alonzo Church. Bull. Symb. Log. 3 (2) (1997)
Bakhadyr Khoussainov, André Nies, Richard A. Shore
Computable Models of Theories with Few Models. Notre Dame J. Formal Log. 38 (2) (1997)
Richard A. Shore
Logic Colloquium '95, Haifa, Israel, 9-17 August 1995 - Preface. Ann. Pure Appl. Log. 87 (2) (1997)
André Nies, Richard A. Shore, Theodore A. Slaman
Definability in the recursively enumerable degrees. Bull. Symb. Log. 2 (4) (1996)
Marat M. Arslanov, Steffen Lempp, Richard A. Shore
Interpolating d-r.e. and REA Degrees between r.e. Degrees. Ann. Pure Appl. Log. 78 (1-3) (1996)
Bakhadyr Khoussainov, Richard A. Shore
Categoricity and Scott Families. DMTCS (1996)
Richard A. Shore
The Bulletin of Symbolic Logic. Bull. Symb. Log. 1 (1) (1995)
Rodney G. Downey, Richard A. Shore
Recursively Enumerable Sets. J. Symb. Log. 60 (3) (1995)
André Nies, Richard A. Shore
Interpreting True Arithmetic in the Theory of the r.e. Truth Table Degrees. Ann. Pure Appl. Log. 75 (3) (1995)
Peter Cholak, Rod Downey, Richard A. Shore
Intervals Without Critical Triples. Logic Colloquium (1995)
Steffen Lempp, Rodney G. Downey, Richard A. Shore
Highness and Bounding Minimal Pairs. Math. Log. Q. 39 (1993)
Klaus Ambos-Spies, Richard A. Shore
Undecidability and 1-Types in the Recursively Enumerable Degrees. Ann. Pure Appl. Log. 63 (1) (1993)
Douglas A. Cenzer, Rodney G. Downey, Carl G. Jockusch Jr., Richard A. Shore
Classes. Ann. Pure Appl. Log. 59 (2) (1993)
Richard A. Shore, Theodore A. Slaman
Working below a Highly Recursively Enumerable Degree. J. Symb. Log. 58 (3) (1993)
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) (1992)
Alistair H. Lachlan, Richard A. Shore
-rea enumeration degrees are dense. Arch. Math. Log. 31 (4) (1992)
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) (1992)
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) (1992)
Richard A. Shore, Theodore A. Slaman
recursively enumerably degree. Arch. Math. Log. 29 (3) (1990)
Christine Ann Haught, Richard A. Shore
Undecidability and Initial Segments of the R.E. tt-Degrees. J. Symb. Log. 55 (3) (1990)
Richard A. Shore, Theodore A. Slaman
The P-T-Degrees of the Recursive Sets: Lattice Embeddings, Extension of Embeddings and the Two Quantifier Theory. Computational Complexity Conference (1989)
Richard A. Shore
A non-inversion theorem for the jump operator. Ann. Pure Appl. Log. 40 (3) (1988)
Peter A. Fejer, Richard A. Shore
Infima of recursively enumerable truth table degrees. Notre Dame J. Formal Log. 29 (3) (1988)
Richard A. Shore
The arithmetic and Turing degrees are not elementarily equivalent. Arch. Math. Log. 24 (1) (1984)
Carl G. Jockusch Jr., Richard A. Shore
Pseudo-Jump Operators. II: Transfinite Iterations, Hierarchies and Minimal Covers. J. Symb. Log. 49 (4) (1984)
Richard A. Shore
On Homogeneity and Definability in the First-Order Theory of the Turing Degrees. J. Symb. Log. 47 (1) (1982)
Richard A. Shore
Some More Minimal Pairs of α-Recursively Enumerable Degrees. Math. Log. Q. 24 (25-30) (1978)
Richard A. Shore
Nowhere Simple Sets and the Lattice of Recursively Enumerable Sets. J. Symb. Log. 43 (2) (1978)
Richard A. Shore
Controlling the Dependence Degree of a Recursive Enumerable Vector Space. J. Symb. Log. 43 (1) (1978)
Anne Leggett, Richard A. Shore
Types of Simple alpha-Recursively Enumerable Sets. J. Symb. Log. 41 (3) (1976)
Richard A. Shore
-Incomparable (Uniformly). J. Symb. Log. 39 (2) (1974)
E. M. Kleinberg, Richard A. Shore
Weak Compactness and Square Bracket Partition Relations. J. Symb. Log. 37 (4) (1972)
E. M. Kleinberg, Richard A. Shore
On Large Cardinals and Partition Relations. J. Symb. Log. 36 (2) (1971)