Richard A. Shore

Orcid: 0000-0003-0381-5259

Affiliations:
  • Cornell University, Department of Mathematics, Ithaca, NY, USA


According to our database1, Richard A. Shore authored at least 78 papers between 1971 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Almost theorems of Hyperarithmetic Analysis.
J. Symb. Log., 2023

2022
Theorems of Hyperarithmetic Analysis and Almost theorems of Hyperarithmetic Analysis.
Bull. Symb. Log., 2022

2018
On the Jumps of the Degrees Below a Recursively Enumerable Degree.
Notre Dame J. Formal Log., 2018

Conservativity of Ultrafilters over Subsystems of second order Arithmetic.
J. Symb. Log., 2018

2017
Σ _1^1 in Every Real in a Σ _1^1 Class of Reals Is Σ _1^1.
Proceedings of the Computability and Complexity, 2017

2016
Mass problems and density.
J. Math. Log., 2016

The strength of the Grätzer-Schmidt theorem.
Arch. Math. Log., 2016

2014
The Turing Degrees below generics and randoms.
J. Symb. Log., 2014

The complexity of ascendant sequences in locally nilpotent groups.
Int. J. Algebra Comput., 2014

2013
Degrees of Categoricity and the Hyperarithmetic Hierarchy.
Notre Dame J. Formal Log., 2013

Low level nondefinability results: Domination and recursive enumeration.
J. Symb. Log., 2013

2012
Domination, forcing, array nonrecursiveness and relative recursive enumerability.
J. Symb. Log., 2012

The n-R.E. Degrees: Undecidability and σ<sub>1</sub> Substructures.
J. Math. Log., 2012

Computably Enumerable Partial Orders.
Comput., 2012

Computing maximal chains.
Arch. Math. Log., 2012

2011
The maximal linear extension theorem in second order arithmetic.
Arch. Math. Log., 2011

Topological aspects of the Medvedev lattice.
Arch. Math. Log., 2011

2010
Lattice initial segments of the hyperdegrees.
J. Symb. Log., 2010

Reverse mathematics: the playground of logic.
Bull. Symb. Log., 2010

2007
Combinatorial principles weaker than Ramsey's Theorem for pairs.
J. Symb. Log., 2007

The settling-time reducibility ordering.
J. Symb. Log., 2007

Direct and Local Definitions of the Turing jump.
J. Math. Log., 2007

Local Definitions in Degree Structures: The Turing Jump, Hyperdegrees and Beyond.
Bull. Symb. Log., 2007

2006
Boolean Algebras, Tarski Invariants, and Index Sets.
Notre Dame J. Formal Log., 2006

The Theory of the Metarecursively Enumerable Degrees.
J. Math. Log., 2006

Degree Structures: Local and Global Investigations.
Bull. Symb. Log., 2006

A computably stable structure with no Scott family of finitary formulas.
Arch. Math. Log., 2006

2004
Generalized high degrees have the complementation property.
J. Symb. Log., 2004

Pi<sub>1</sub><sup>1</sup> relations and paths through.
J. Symb. Log., 2004

Reasoning about common knowledge with infinitely many agents.
Inf. Comput., 2004

2003
A computably categorical structure whose expansion by a constant has infinite computable dimension.
J. Symb. Log., 2003

Decomposition and infima in the computably enumerable degrees.
J. Symb. Log., 2003

2002
A nonlow<sub>2</sub> R. E. Degree with the Extension of Embeddings Properties of a low<sub>2</sub> Degree.
Math. Log. Q., 2002

Degree spectra and computable dimensions in algebraic structures.
Ann. Pure Appl. Log., 2002

2001
The prospects for mathematical logic in the twenty-first century.
Bull. Symb. Log., 2001

Every incomplete computably enumerable truth-table degree is branching.
Arch. Math. Log., 2001

2000
Undecidability and 1-types in intervals of the computably enumerable degrees.
Ann. Pure Appl. Log., 2000

1999
Computably Categorical Structures and Expansions by Constants.
J. Symb. Log., 1999

Erratum to "Computable Isomorphisms, Degree Spectra of Relations, and Scott Families".
Ann. Pure Appl. Log., 1999

The Recursively Enumerable Degrees.
Proceedings of the Handbook of Computability Theory, 1999

1998
Computable Isomorphisms, Degree Spectra of Relations, and Scott Families.
Ann. Pure Appl. Log., 1998

Splitting Theorems and the Jump Operator.
Ann. Pure Appl. Log., 1998

1997
Computable Models of Theories with Few Models.
Notre Dame J. Formal Log., 1997

Alonzo Church.
Bull. Symb. Log., 1997

Logic Colloquium '95, Haifa, Israel, 9-17 August 1995 - Preface.
Ann. Pure Appl. Log., 1997

Conjectures and questions from Gerald Sacks's <i>Degrees of Unsolvability</i>.
Arch. Math. Log., 1997

Logic for Applications, Second Edition.
Graduate Texts in Computer Science, Springer, ISBN: 978-1-4612-0649-1, 1997

1996
Definability in the recursively enumerable degrees.
Bull. Symb. Log., 1996

Interpolating d-r.e. and REA Degrees between r.e. Degrees.
Ann. Pure Appl. Log., 1996

Categoricity and Scott Families.
Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

1995
Degree Theoretic Definitions of the low<sub>2</sub> Recursively Enumerable Sets.
J. Symb. Log., 1995

The Bulletin of Symbolic Logic.
Bull. Symb. Log., 1995

Interpreting True Arithmetic in the Theory of the r.e. Truth Table Degrees.
Ann. Pure Appl. Log., 1995

Intervals Without Critical Triples.
Proceedings of the Annual European Summer Meeting of the Association of Symbolic Logic, 1995

1993
Highness and Bounding Minimal Pairs.
Math. Log. Q., 1993

Working below a Highly Recursively Enumerable Degree.
J. Symb. Log., 1993

Countable Thin Pi<sup>0</sup><sub>1</sub> Classes.
Ann. Pure Appl. Log., 1993

Undecidability and 1-Types in the Recursively Enumerable Degrees.
Ann. Pure Appl. Log., 1993

Logic for Applications.
Texts and Monographs in Computer Science, Springer, ISBN: 978-1-4684-0211-7, 1993

1992
The p-T Degrees of the Recursive Sets: Lattice Embeddings, Extensions of Embeddings and the Two-Quantifier Theory.
Theor. Comput. Sci., 1992

The Theory of the Recursively Enumerable Weak Truth-Table Degrees Is Undecidability.
J. Symb. Log., 1992

On the strength of König's duality theorem for infinite bipartite graphs.
J. Comb. Theory B, 1992

The<i>n</i>-rea enumeration degrees are dense.
Arch. Math. Log., 1992

1990
Undecidability and Initial Segments of the R.E. tt-Degrees.
J. Symb. Log., 1990

Working below a low<sub>2</sub> recursively enumerably degree.
Arch. Math. Log., 1990

1989
The P-T-Degrees of the Recursive Sets: Lattice Embeddings, Extension of Embeddings and the Two Quantifier Theory.
Proceedings of the Proceedings: Fourth Annual Structure in Complexity Theory Conference, 1989

1988
Infima of recursively enumerable truth table degrees.
Notre Dame J. Formal Log., 1988

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

1984
Pseudo-Jump Operators. II: Transfinite Iterations, Hierarchies and Minimal Covers.
J. Symb. Log., 1984

The arithmetic and Turing degrees are not elementarily equivalent.
Arch. Math. Log., 1984

1982
On Homogeneity and Definability in the First-Order Theory of the Turing Degrees.
J. Symb. Log., 1982

1978
Some More Minimal Pairs of α-Recursively Enumerable Degrees.
Math. Log. Q., 1978

Nowhere Simple Sets and the Lattice of Recursively Enumerable Sets.
J. Symb. Log., 1978

Controlling the Dependence Degree of a Recursive Enumerable Vector Space.
J. Symb. Log., 1978

1976
Types of Simple alpha-Recursively Enumerable Sets.
J. Symb. Log., 1976

1974
sigma<sub>n</sub> Sets which are triangle<sub>n</sub>-Incomparable (Uniformly).
J. Symb. Log., 1974

1972
Weak Compactness and Square Bracket Partition Relations.
J. Symb. Log., 1972

1971
On Large Cardinals and Partition Relations.
J. Symb. Log., 1971


  Loading...