Shore, Richard A. - Department of Mathematics, Cornell University

• Solutions of the Goncharov-Millar and Degree Spectra Problems in The Theory of
• DOUBLE JUMP INVERSIONS AND STRONG MINIMAL COVERS IN THE TURING DEGREES
• DOUBLE JUMP INVERSIONS AND STRONG MINIMAL COVERS IN THE TURING DEGREES
• Solutions of the Goncharov-Millar and Degree Spectra Problems in The Theory of
• DEGREE THEORETIC DEFINITIONS OF THE LOW2 RECURSIVELY ENUMERABLE SETS
• Lattice Embeddings below a Nonlow2 Recursively Enumerable Degree
• The Recursively Enumerable Degrees Richard A. Shore
• INTERVALS WITHOUT CRITICAL TRIPLES PETER CHOLAK, ROD DOWNEY AND RICHARD SHORE
• Computably Categorical Structures and Expansions by Constants
• Recursive Models of Theories with Few Bakhadyr Khoussainov
• Interpretability and definability in the recursively enumerable degrees
• Computable Isomorphisms, Degree Spectra of Relations, and Scott Families
• 2-high e-degrees and properly 0 Richard Shore
• A SPLITTING THEOREM FOR n -REA DEGREES RICHARD A. SHORE AND THEODORE A. SLAMAN
• A Discrete Splitting Theorem for the 2-REA Degrees
• INTERPRETING ARITHMETIC IN THE R.E. DEGREES UNDER 4-INDUCTION
• THE PROSPECTS FOR MATHEMATICAL LOGIC IN THE TWENTY-FIRST CENTURY
• The -Theory of R(, , ) is Undecidable Russell G. Miller
• A computably stable structure with no Scott family of finitary formulas
• Degree Structures: Local and Global Investigations Richard A. Shore
• The Atomic Model Theorem and Type Omitting Denis R. Hirschfeldt
• Domination, forcing, array nonrecursiveness and relative recursive enumerability
• Reverse Mathematics: The Playground of Logic Richard A. Shore
• The n-r.e. degrees: undecidability and 1 substructures
• Computability, Reverse Mathematics and Combinatorics: Open Problems
• Reasoning About Common Knowledge with Infinitely Many Agents Joseph Y. Halpern
• The nr.e. degrees: undecidability and # 1 substructures
• There is no degree invariant halfjump Rod Downey \Lambda
• Combinatorial Principles Weaker than Ramsey's Theorem for Pairs
• INTERPRETING ARITHMETIC IN THE R.E. DEGREES UNDER 4 -INDUCTION
• Effective Model Theory: The Number of Models and Their Complexity 1
• DEGREES OF RANDOM SETS A Dissertation
• JUMPS OF MINIMAL DEGREES BELOW 0 0 Rodney G. Downey, Steffen Lempp, and Richard A. Shore
• Soare, R. I. [1987], Recursively Enumerable Sets and Degrees, SpringerVerlag, Weinstein, B. J. [1988], On embeddings of the 131 into the recursively enu
• Direct and local de...nitions of the Turing jump Richard A. Shore
• Reverse Mathematics: The Playground of Logic Richard A. Shore #
• BEYOND THE ARITHMETIC A Dissertation
• Contemporary Mathematics Natural Definability in Degree Structures
• Computable Structures: Presentations Matter Richard A. Shore
• The Recursively Enumerable Degrees Richard A. Shore \Lambda
• THE PROSPECTS FOR MATHEMATICAL LOGIC IN THE TWENTY-FIRST CENTURY
• Computable Isomorphisms, Degree Spectra of Relations, and Scott Families
• Local de nitions in degree structures: the Turing jump, hyperdegrees and beyond
• The 89 theory of D( ; _; 0 ) is undecidable
• BEYOND THE ARITHMETIC A Dissertation
• The Theories of the T, tt and wtt R. E. Undecidability and Beyond
• Reasoning About Common Knowledge with In nitely Many Joseph Y. Halpern
• DEGREE SPECTRA OF RELATIONS ON COMPUTABLE STRUCTURES
• A nonlow 2 r.e. degree with the extension of embeddings properties of a low 2 degree
• Undecidability and 1-types in Intervals of the Computably Enumerable Degrees
• THE MAXIMAL LINEAR EXTENSION THEOREM IN SECOND ORDER ARITHMETIC
• Splitting Theorems and the Jump Operator R. G. Downey
• CHARACTERIZATIONS FOR COMPUTABLE STRUCTURES
• Reverse mathematics, countable and uncountable: a computational approach
• Degree Structures: Local and Global Investigations Richard A. Shore
• INTERVALS WITHOUT CRITICAL TRIPLES PETER CHOLAK, ROD DOWNEY AND RICHARD SHORE
• Lattice initial segents of the hyperdegrees Richard A. Shore #
• Generalized High Degrees have the Complementation Noam Greenberg, Antonio Montalban and Richard A. Shore
• Computable Isomorphisms, Degree Spectra of Relations, and Scott Families
• Highness and bounding minimal pairs Rodney G. Downey
• Categoricity and Scott Families Bakhadyr Khoussainov
• Computable Isomorphisms, Degree Spectra of Relations, and Scott Families
• THE SETTLINGTIME REDUCIBILITY ORDERING BARBARA F. CSIMA AND RICHARD A. SHORE
• A SPLITTING THEOREM FOR n REA DEGREES RICHARD A. SHORE AND THEODORE A. SLAMAN
• The Theories of the T, tt and wtt R. E. Undecidability and Beyond
• Generalized High Degrees have the Complementation Noam Greenberg, Antonio Montalb an and Richard A. Shore
• A computably stable structure with no Scott family of nitary formulas
• R i g i d i t y a n d b i i n t e r p r e t a b i l i t y i n t h e h y p e r d e g r e e s R i c h a r d A . S h o r e
• Jumps of \Sigma 0 2 high edegrees and properly \Sigma 0
• Lattice initial segments of the hyperdegrees Richard A. Shore
• The low n and low m r.e. degrees are not elementarily Richard A. Shore
• Contemporary Mathematics Natural De nability in Degree Structures
• Minimal degrees which are 0 2 but not 0
• Effective Model Theory: The Number of Models and Their Complexity1
• REVERSE MATHEMATICS AND ORDERED GROUPS A Dissertation
• Splitting Theorems and the Jump Operator R. G. Downey
• There is no degree invariant half-jump Mathematics Department
• Interpolating dr. e. and REA degrees between r. e. degrees
• THE ROLE OF TRUE FINITENESS IN THE ADMISSIBLE RECURSIVELY ENUMERABLE
• A nonlow2 r.e. degree with the extension of embeddings properties of a low2 degree
• Conjectures and Questions from Gerald Sacks's Degrees of Unsolvability
• A Computably Categorical Structure Whose Expansion by a Constant Has Infinite
• The lown and lowm r.e. degrees are not elementarily Richard A. Shore
• THE SETTLING-TIME REDUCIBILITY ORDERING BARBARA F. CSIMA AND RICHARD A. SHORE
• Recursive Models of Theories with Few Bakhadyr Khoussainov \Lambda
• Highness and bounding minimal pairs Rodney G. Downey \Lambda
• Invariants, Boolean Algebras and ACA+ Richard A. Shore
• The 89-Theory of R( ; _; ^) is Undecidable Russell G. Miller
• A Computably Categorical Structure Whose Expansion by a Constant Has In nite
• A Discrete Splitting Theorem for the 2-REA Degrees
• Definability in the recursively enumerable degrees Andre Nies
• Every Incomplete Computably Enumerable Truth-Table Degree Is Branching
• Defining the Turing Jump Richard A. Shore
• The theory of D(, , ) is undecidable Richard A. Shore
• Reasoning About Common Knowledge with Infinitely Many Joseph Y. Halpern
• Minimal degrees which are 0 2 but not 0
• USING TREE AUTOMATA TO INVESTIGATE INTUITIONISTIC PROPOSITIONAL LOGIC
• Corrections for Logic for Applications 2nd November 27, 2006
• Computable Structures: Presentations Matter Richard A. Shore
• DEGREE THEORETIC DEFINITIONS OF THE LOW 2 RECURSIVELY ENUMERABLE SETS
• Interpolating d-r. e. and REA degrees between r. e. degrees
• THE MAXIMAL LINEAR EXTENSION THEOREM IN SECOND ORDER ARITHMETIC
• Direct and local definitions of the Turing jump Richard A. Shore*
• Contemporary Mathematics Natural Definability in Degree Structures
• Computably Categorical Structures and Expansions by Constants
• Computable Isomorphisms, Degree Spectra of Relations, and Scott Families
• THE LIMITS OF DETERMINACY IN SECOND ORDER ARITHMETIC ANTONIO MONTALB'AN AND RICHARD A. SHORE
• Interpretability and definability in the recursively enumerable degrees
• A nonlow2 r.e. degree with the extension of embeddings properties of a low2 degree
• Boolean Algebras, Tarski Invariants, and Index Sets Barbara F. Csima
• The 89-Theory of R( , _, ^) is Undecidable Russell G. Miller Andre O. Nies
• Degree Spectra and Computable Dimensions in Algebraic Structures
• Combinatorial Principles Weaker than Ramsey's Theorem for Pairs
• Defining the Turing Jump Richard A. Shore*
• Highness and bounding minimal pairs Rodney G. Downey*
• 0 0 Jumps of 2 -high e-degrees and properly 2
• JUMPS OF MINIMAL DEGREES BELOW 00 Rodney G. Downey, Steffen Lempp, and Richard A. Shore
• Categoricity and Scott Families Bakhadyr Khoussainov
• Doination, forcing, array nonrecursiveness and relative recursive enuerability
• Invariants, Boolean Algebras and ACA + Richard A. Shore
• Reverse mathematics, countable and uncountable: a computational approach
• Interpretability and definability in the recursively enumerable degrees
• THE MAXIMAL LINEAR EXTENSION THEOREM IN SECOND ORDER ARITHMETIC
• COUNTABLE THIN 0 Douglas Cenzer, Rodney Downey, Carl Jockusch and Richard Shore
• THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES
• Combinatorial Principles Weaker than Ramsey's Theorem for Pairs
• THE LIMITS OF DETERMINACY IN SECOND ORDER ARITHMETIC ANTONIO MONTALB
• Direct and local de nitions of the Turing jump Richard A. Shore
• COUNTABLE THIN \Pi 0 Douglas Cenzer, Rodney Downey, Carl Jockusch and Richard Shore
• Undecidability and 1-types in Intervals of the Computably Enumerable Degrees
• Invariants, Boolean Algebras and ACA0 Richard A. Shore*
• Computable Structures: Presentations Matter Richard A. Shore*
• The n-r.e. degrees: undecidability and 1 substructures
• The Atomic Model Theorem and Type Omitting Denis R. Hirschfeldt Richard A. Shore
• Conjectures and Questions from Gerald Sacks's Degrees of Unsolvability
• INTERVALS WITHOUT CRITICAL TRIPLES PETER CHOLAK, ROD DOWNEY AND RICHARD SHORE
• Reasoning About Common Knowledge with Infinitely Many Agents
• A computably stable structure with no Scott family of finitary formulas
• Lattice Embeddings below a Nonlow2 Recursively Enumerable Degree
• The Theories of the T, tt and wtt R. E. Degrees
• THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES
• Splitting Theorems and the Jump Operator R. G. Downey*
• Reverse Mathematics: The Playground of Logic Richard A. Shore*
• COUNTABLE THIN 01 CLASSES Douglas Cenzer, Rodney Downey, Carl Jockusch and Richard Shore
• Solutions of the Goncharov-Millar and Degree Spectra Problems in The Theory of
• The Recursively Enumerable Degrees Richard A. Shore*
• Lattice initial segments of the hyperdegrees Richard A. Shore* Bj#rn Kjos-Hansseny
• Recursive Models of Theories with Few Models
• Reverse mathematics, countable and uncountable: a computational approach
• THE PROSPECTS FOR MATHEMATICAL LOGIC IN THE TWENTY-FIRST CENTURY
• A Computably Categorical Structure Whose Expansion by a Constant Has Infinite
• A Discrete Splitting Theorem for the 2-REA Degrees
• DOUBLE JUMP INVERSIONS AND STRONG MINIMAL COVERS IN THE TURING DEGREES
• Rigidity and biinterpretability in the hyperdegrees Richard A. Shore*
• There is no degree invariant half-jump Rod Downey*
• 0 The 89 theory of D( , _, ) is undecidable
• Local de...nitions in degree structures: the Turing jump, hyperdegrees and beyond
• Boolean Algebras, Tarski Invariants, and Index Sets Barbara F. Csima
• De ning the Turing Jump Richard A. Shore
• Rigidity and biinterpretability in the hyperdegrees Richard A. Shore
• JUMPS OF MINIMAL DEGREES BELOW 0 Rodney G. Downey, Steffen Lempp, and Richard A. Shore
• THE ROLE OF TRUE FINITENESS IN THE ADMISSIBLE RECURSIVELY ENUMERABLE
• Interpolating d-r. e. and REA degrees between r. e. degrees
• Boolean Algebras, Tarski Invariants, and Index Sets Barbara F. Csima
• Conjectures and Questions from Gerald Sacks's Degrees of Unsolvability \Lambda
• Degree Spectra and Computable Dimensions in Algebraic Structures
• Computably Categorical Structures and Expansions by Constants
• Every Incomplete Computably Enumerable TruthTable Degree Is Branching \Lambda
• THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES
• Undecidability and 1-types in Intervals of the Computably Enumerable Degrees
• A SPLITTING THEOREM FOR n -REA DEGREES RICHARD A. SHORE AND THEODORE A. SLAMAN
• Computable Isomorphisms, Degree Spectra of Relations, and Scott Families
• Degree Structures: Local and Global Investigations Richard A. Shore*
• Local definitions in degree structures: the Turing jump, hyperdegrees and beyond
• Generalized High Degrees have the Complementation Property
• Reasoning About Common Knowledge with Infinitely Many Agents Joseph Y. Halpern* Richard A. Shorex
• REVERSE MATHEMATICS AND ORDERED GROUPS A Dissertation
• Domination, forcing, array nonrecursiveness and relative recursive enumerability
• BEYOND THE ARITHMETIC A Dissertation
• INTERPRETING ARITHMETIC IN THE R.E. DEGREES UNDER 4-INDUCTION
• DEGREE SPECTRA OF RELATIONS ON COMPUTABLE STRUCTURES
• 0 0 Minimal degrees which are 2 but not 2
• The lown and lowm r.e. degrees are not elementarily equivalent
• CHARACTERIZATIONS FOR COMPUTABLE STRUCTURES
• DEGREE THEORETIC DEFINITIONS OF THE LOW2 RECURSIVELY ENUMERABLE SETS
• Categoricity and Scott Families Bakhadyr Khoussainov
• Deonability in the recursively enumerable degrees
• Eoeective Model Theory: The Number of Models and Their Complexity1
• Every Incomplete Computably Enumerable Truth-Table Degree Is Branching
• THE SETTLING-TIME REDUCIBILITY ORDERING BARBARA F. CSIMA AND RICHARD A. SHORE
• DEGREES OF CATEGORICITY AND THE HYPERARITHMETIC HIERARCHY
• ON THE COMPLEXITY OF MATHEMATICAL PROBLEMS: MEDVEDEV DEGREES AND
• ON THE COMPLEXITY OF MATHEMATICAL PROBLEMS: MEDVEDEV DEGREES AND
• ELEMENTS OF CLASSICAL RECURSION THEORY: DEGREE-THEORETIC PROPERTIES AND
• ON THE COMPLEXITY OF MATHEMATICAL PROBLEMS: MEDVEDEV DEGREES AND
• ELEMENTS OF CLASSICAL RECURSION THEORY: DEGREE-THEORETIC PROPERTIES AND
• ELEMENTS OF CLASSICAL RECURSION THEORY: DEGREETHEORETIC PROPERTIES AND
• DEGREES OF CATEGORICITY AND THE HYPERARITHMETIC HIERARCHY
• ON THE COMPLEXITY OF MATHEMATICAL PROBLEMS: MEDVEDEV DEGREES AND
• COMPUTABLY ENUMERABLE PARTIAL ORDERS PETER A. CHOLAK, DAMIR D. DZHAFAROV, NOAH SCHWEBER,
• COMPUTABLY ENUMERABLE PARTIAL ORDERS PETER A. CHOLAK, DAMIR D. DZHAFAROV, NOAH SCHWEBER,
• COMPUTABLY ENUMERABLE PARTIAL ORDERS PETER A. CHOLAK, DAMIR D. DZHAFAROV, NOAH SCHWEBER,
• Lecture notes on the Turing degrees, AII Graduate Suer School in Logic
• Biinterpretability up to double jup in the degrees Richard A. Shore #
• ALBERTO MARCONE, ANTONIO MONTALBN, AND RICHARD A. SHORE ########. In [Wol67], Wolk proved that every well partial order (wpo) has a axial
• Lecture notes on the Turing degrees, AII Graduate Summer School in Logic
• COMPUTING MAXIMAL CHAINS ALBERTO MARCONE, ANTONIO MONTALB#N, AND RICHARD A. SHORE
• Lecture notes on the Turing degrees, AII Graduate Summer School in Logic
• Biinterpretability up to double jump in the degrees 0
• Biinterpretability up to double jump in the degrees Richard A. Shore
• COMPUTING MAXIMAL CHAINS ALBERTO MARCONE, ANTONIO MONTALBN, AND RICHARD A. SHORE
• Richard A. Shore c January 25, 2012