R. Shore

发表

α-Recursion Theory

R. Shore, 1977 .

Nowhere Simple Sets and the Lattice of Recursively Enumerable Sets

Richard A. Shore, R. Shore, 1978, J. Symb. Log..

r-Maximal major subsets

R. Soare, R. Shore, M. Lerman, 1978 .

Determining automorphisms of the recursively enumerable sets

R. Shore, 1977 .

1 1 relations and paths through O

Richard A. Shore, Valentina S. Harizanov, R. Shore, 2004 .

Undecidability and Beyond

R. Shore, 2007 .

Π11 relations and paths through

R. Shore, S. Goncharov, V. Harizanov, 2004, Journal of Symbolic Logic.

Jumps of Ʃ02-high e-degrees and properly Ʃ02 e-degrees

A. Sorbi, R. Shore, 1999 .

The Theory of the Degrees below 0

R. Shore, 1981 .

SPLITTING AN a-RECURSIVELY ENUMERABLE SET

R. Shore, Richard A. SHOREl, R. A. Shore, 2010 .

The recursively enumerable α-degrees are dense

R. Shore, 1976 .

Jumps of Minimal Degrees Below 0

R. Downey, R. Shore, S. Lempp, 1996 .

On isolating r.e. and isolated d-r.e. degrees

Richard A. Shore, Steffen Lempp, Marat M. Arslanov, 1996 .

The strength of Turing determinacy within second order arithmetic

Richard A. Shore, Antonio Montalbán, A. Montalbán, 2016 .

The atomic model theorem and type omitting

Denis R. Hirschfeldt, Richard A. Shore, Theodore A. Slaman, 2009 .

The Atomic Model Theorem

Denis R. Hirschfeldt, Richard A. Shore, Theodore A. Slaman, 2007 .

Rigidity and biinterpretability in the hyperdegrees

Richard A. Shore, R. Shore, 2005 .

The ∀ ∃ theory of D ( ≤ , ∨ , ′ ) is undecidable

T. Slaman, R. Shore, 2003 .

Minimal degrees which are Sigma~2^0 but not Delta~2^0

R. A. Shore, R. Shore, 2003 .

Natural Definability in Degree Structures

Richard A. Shore, R. Shore, 1999 .

Degrees of Constructibility

R. Shore, 1992 .

Initial segments of the degrees of constructibility

Marcia J. Groszek, Richard A. Shore, R. Shore, 1988 .

Initial segments of the degrees of size ℵ1

Uri Abraham, Richard A. Shore, R. Shore, 1986 .

Embeddings and extensions of embeddings in the r.e. tt and wtt-degrees

Richard A. Shore, Peter A. Fejer, R. Shore, 1985 .

Annual Meeting of the Association for Symbolic Logic, Los Angeles, 1989

R. Shore, 1990, Journal of Symbolic Logic.

The theories of the t , tt and wtt r . E . Degrees : undecidability and beyond

R. Shore, 1993 .

Biinterpretability up to double jump in the degrees below 0 0

R. Shore, 2011 .

Contemporary Mathematics Natural Definability in Degree Structures

R. Shore, 1999 .

THE DEGREES R.E. IN A DEGREE d

R. Shore, 2010 .

Computably Enumerable Partial Orders

Peter A. Cholak, R. Shore, D. Dzhafarov, 2011, Comput..

DEFINABLE DEGREES AND AUTOMORPHISMS OF V BY

R. Shore, L. Harrington, 2007 .

The lown and lowm r. e. degrees are not elementarily equivalent

R. Shore, 2004 .

Computing maximal chains

A. Montalbán, R. Shore, Alberto Marcone, 2012, Archive for Mathematical Logic.

A few results

A. Montalbán, R. Shore, 2010 .

In Reviews

R. Shore, 2003, Bulletin of Symbolic Logic.

The maximal linear extension theorem in second order arithmetic

Alberto Marcone, Richard A. Shore, R. Shore, 2010, Arch. Math. Log..

On the strength of Fraïssé’s conjecture

Richard A. Shore, R. Shore, 1993 .

Undecidability and initial segments of the (r.e.) tt-degrees

Richard A. Shore, Christine Ann Haught, R. Shore, 1990, Journal of Symbolic Logic.

On the strength of König's duality theorem for infinite bipartite graphs

Richard A. Shore, Ron Aharoni, Menachem Magidor, 1992, J. Comb. Theory, Ser. B.

On the ∀∃-Sentences of α-Recursion Theory

Richard A. Shore, R. Shore, 1978 .

Some More Minimal Pairs of α-Recursively Enumerable Degrees

Richard A. Shore, R. Shore, 1978, Math. Log. Q..

Minimal a-degrees

Richard A. Shore, R. Shore, 1972 .

Reasoning about common knowledge with infinitely many agents

Joseph Y. Halpern, Richard A. Shore, R. Shore, 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

The Recursively Enumerable Degrees

Richard A. Shore, R. Shore, 1999, Handbook of Computability Theory.

Boolean Algebras, Tarski Invariants, and Index Sets

Barbara F. Csima, Richard A. Shore, Antonio Montalbán, 2006, Notre Dame J. Formal Log..

Degree spectra and computable dimensions in algebraic structures

Arkadii M. Slinko, Denis R. Hirschfeldt, Richard A. Shore, 2002, Ann. Pure Appl. Log..

Conjectures and questions from Gerald Sacks's Degrees of Unsolvability

R. Shore, 1997, Arch. Math. Log..

Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem

Denis R. Hirschfeldt, Richard A. Shore, Karen Lange, 2017 .

On the jump of an -recursively enumerable set

Richard A. Shore, R. Shore, 1976 .

The irregular and non-hyperregular α-r.e. degrees

Richard A. Shore, R. Shore, 1975 .

Logic for Applications

Anil Nerode, Richard A. Shore, A. Nerode, 1997, Graduate Texts in Computer Science.

Mass problems and density

Stephen G. Simpson, Richard A. Shore, S. G. Simpson, 2016, J. Math. Log..

Degree Structures: Local and Global Investigations

Richard A. Shore, R. Shore, 2006, Bull. Symb. Log..

The Theory of the Metarecursively Enumerable Degrees

Richard A. Shore, Theodore A. Slaman, Noam Greenberg, 2006, J. Math. Log..

Decomposition and infima in the computably enumerable degrees

Rodney G. Downey, Geoffrey LaForte, Richard A. Shore, 2003, Journal of Symbolic Logic.

Undecidability and 1-types in intervals of the computably enumerable degrees

Denis R. Hirschfeldt, Richard A. Shore, Klaus Ambos-Spies, 2000, Ann. Pure Appl. Log..

Undecidability and 1-Types in the Recursively Enumerable Degrees

Richard A. Shore, Klaus Ambos-Spies, R. Shore, 1993, Ann. Pure Appl. Log..

Lattice embeddings below a nonlow2 recursively enumerable degree

Richard A. Shore, Rod Downey, R. Downey, 1996 .

Σ n sets which are Δ n -incomparable (uniformly)

R. Shore, 1974, Journal of Symbolic Logic.

Low Level Nondelegability Results: Domination and Recursive Enumeration

Richard A. Shore, Mingzhong Cai, R. Shore, 2013, The Journal of Symbolic Logic.

Lattice initial segments of the hyperdegrees

Richard A. Shore, Bjørn Kjos-Hanssen, B. Kjos-Hanssen, 2010, The Journal of Symbolic Logic.

The ∀∃-theory of ℛ(≤,∨,∧) is undecidable

André Nies, Richard A. Shore, Russell Miller, 2003 .

The P-T-degrees of the recursive sets: lattice embeddings, extensions of embeddings and the two quantifier theory

Richard A. Shore, Theodore A. Slaman, T. Slaman, 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

Reducibility orderings: Theories, definability and automorphisms☆

Anil Nerode, Richard A. Shore, A. Nerode, 1980 .

A direct construction of a minimal recursively enumerable truth-table degree

Richard A. Shore, Peter A. Fejer, R. Shore, 1990 .

The degrees of unsolvability: Global results

Richard A. Shore, R. Shore, 1981 .

Second order logic and first order theories of reducibility orderings

Anil Nerode, Richard A. Shore, A. Nerode, 1980 .

Countable Thin Pi01 Classes

Douglas Cenzer, Rodney Downey, Carl Jockusch, 1993, Ann. Pure Appl. Log..

THEOREMS OF HYPERARITHMETIC ANALYSIS AND ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS

Jun Le Goh, R. Shore, James S. Barnes, 2022, The Bulletin of Symbolic Logic.

The n-R.E. Degrees: Undecidability and σ1 Substructures

Richard A. Shore, Theodore A. Slaman, Mingzhong Cai, 2012, J. Math. Log..

Domination, forcing, array nonrecursiveness and relative recursive enumerability

Richard A. Shore, Mingzhong Cai, R. Shore, 2012, The Journal of Symbolic Logic.

Topological aspects of the Medvedev lattice

Andrea Sorbi, Richard A. Shore, Andrew E. M. Lewis, 2011, Arch. Math. Log..

Direct and Local Definitions of the Turing jump

Richard A. Shore, R. Shore, 2007, J. Math. Log..

Generalized high degrees have the complementation property

Richard A. Shore, Antonio Montalbán, Noam Greenberg, 2004, Journal of Symbolic Logic.

Definability in the Recursively Enumerable Degrees

André Nies, Richard A. Shore, Theodore A. Slaman, 1996, Bulletin of Symbolic Logic.

Degree theoretic definitions of the low2 recursively enumerable sets

Rodney G. Downey, Richard A. Shore, R. Downey, 1995, Journal of Symbolic Logic.

Working below a high recursively enumerable degree

Richard A. Shore, Theodore A. Slaman, T. Slaman, 1993, Journal of Symbolic Logic.

Working below a low2 recursively enumerably degree

Richard A. Shore, Theodore A. Slaman, T. Slaman, 1990, Arch. Math. Log..

Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers

Carl G. Jockusch, Richard A. Shore, C. Jockusch, 1984, Journal of Symbolic Logic.

The limits of determinacy in second order arithmetic: consistency and complexity strength

Richard A. Shore, Antonio Montalbán, A. Montalbán, 2012, Israel Journal of Mathematics.

The complexity of ascendant sequences in locally nilpotent groups

Chris J. Conidis, Richard A. Shore, R. Shore, 2014, Int. J. Algebra Comput..

Decidability and invariant classes for degree structures

R. Shore, M. Lerman, 1988 .

Controlling the dependence degree of a recursively enumerable vector space

Richard A. Shore, R. Shore, 1978, Journal of Symbolic Logic.

Computably categorical structures and expansions by constants

Richard A. Shore, Bakhadyr Khoussainov, Peter Cholak, 1999, Journal of Symbolic Logic.

Local Definitions in Degree Structures: The Turing Jump, Hyperdegrees and Beyond

Richard A. Shore, R. Shore, 2007, Bulletin of Symbolic Logic.

The Prospects for Mathematical Logic in the Twenty-First Century

Samuel R. Buss, Richard A. Shore, Anand Pillay, 2001, Bulletin of Symbolic Logic.

A splitting theorem for n - REA degrees

Richard A. Shore, Theodore A. Slaman, T. Slaman, 2001 .

Defining the Turing Jump

Richard A. Shore, Theodore A. Slaman, T. Slaman, 1999 .

A non-inversion theorem for the jump operator

Richard A. Shore, R. Shore, 1988, Ann. Pure Appl. Log..

Pseudojump operators. I. The r.e. case

Carl G. Jockusch, Richard A. Shore, C. Jockusch, 1983 .

On homogeneity and definability in the first-order theory of the Turing degrees

Richard A. Shore, R. Shore, 1982, Journal of Symbolic Logic.

Defining jump classes in the degrees below 0

Richard A. Shore, R. Shore, 1988 .

Definable degrees and automorphisms of $\mathcal {D}$

Richard A. Shore, Leo Harrington, R. Shore, 1981 .

Highness and Bounding Minimal Pairs

Rodney G. Downey, Richard A. Shore, Steffen Lempp, 1993, Math. Log. Q..

ℒ*() and other lattices of recursively enumerable sets

R. Shore, 1980 .

THE TURING DEGREES BELOW GENERICS AND RANDOMS

Richard A. Shore, R. Shore, 2014, The Journal of Symbolic Logic.