72 found
Order:
  1. Degrees of Categoricity and the Hyperarithmetic Hierarchy.Barbara F. Csima, Johanna N. Y. Franklin & Richard A. Shore - 2013 - Notre Dame Journal of Formal Logic 54 (2):215-231.
    We study arithmetic and hyperarithmetic degrees of categoricity. We extend a result of E. Fokina, I. Kalimullin, and R. Miller to show that for every computable ordinal $\alpha$, $\mathbf{0}^{}$ is the degree of categoricity of some computable structure $\mathcal{A}$. We show additionally that for $\alpha$ a computable successor ordinal, every degree $2$-c.e. in and above $\mathbf{0}^{}$ is a degree of categoricity. We further prove that every degree of categoricity is hyperarithmetic and show that the index set of structures with degrees (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  2.  18
    Combinatorial Principles Weaker Than Ramsey's Theorem for Pairs.Denis R. Hirschfeldt & Richard A. Shore - 2007 - Journal of Symbolic Logic 72 (1):171-206.
    We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus in particular on the principles ADS (Ascending or Descending Sequence), which states that every infinite linear order has either an infinite descending sequence or an infinite ascending sequence, and CAC (Chain-AntiChain), which states that every infinite partial order has either an infinite chain or an infinite antichain. It is well-known that Ramsey's Theorem for pairs (...)
    Direct download (8 more)  
     
    Export citation  
     
    My bibliography   13 citations  
  3.  10
    Degree Spectra and Computable Dimensions in Algebraic Structures.Denis R. Hirschfeldt, Bakhadyr Khoussainov, Richard A. Shore & Arkadii M. Slinko - 2002 - Annals of Pure and Applied Logic 115 (1-3):71-113.
    Whenever a structure with a particularly interesting computability-theoretic property is found, it is natural to ask whether similar examples can be found within well-known classes of algebraic structures, such as groups, rings, lattices, and so forth. One way to give positive answers to this question is to adapt the original proof to the new setting. However, this can be an unnecessary duplication of effort, and lacks generality. Another method is to code the original structure into a structure in the given (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   17 citations  
  4. A Computably Stable Structure with No Scott Family of Finitary Formulas.Peter Cholak, Richard A. Shore & Reed Solomon - 2006 - Archive for Mathematical Logic 45 (5):519-538.
  5.  18
    Computable Models of Theories with Few Models.Bakhadyr Khoussainov, Andre Nies & Richard A. Shore - 1997 - Notre Dame Journal of Formal Logic 38 (2):165-178.
    In this paper we investigate computable models of -categorical theories and Ehrenfeucht theories. For instance, we give an example of an -categorical but not -categorical theory such that all the countable models of except its prime model have computable presentations. We also show that there exists an -categorical but not -categorical theory such that all the countable models of except the saturated model, have computable presentations.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   15 citations  
  6. Σn Sets Which Are Δn-Incomparable (Uniformly).Richard A. Shore - 1974 - Journal of Symbolic Logic 39 (2):295 - 304.
  7.  3
    Computable Isomorphisms, Degree Spectra of Relations, and Scott Families.Bakhadyr Khoussainov & Richard A. Shore - 1998 - Annals of Pure and Applied Logic 93 (1-3):153-193.
    The spectrum of a relation on a computable structure is the set of Turing degrees of the image of R under all isomorphisms between and any other computable structure . The relation is intrinsically computably enumerable if its image under all such isomorphisms is c.e. We prove that any computable partially ordered set is isomorphic to the spectrum of an intrinsically c.e. relation on a computable structure. Moreover, the isomorphism can be constructed in such a way that the image of (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   13 citations  
  8.  6
    Then-Rea Enumeration Degrees Are Dense.Alistair H. Lachlan & Richard A. Shore - 1992 - Archive for Mathematical Logic 31 (4):277-285.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   11 citations  
  9.  2
    A Non-Inversion Theorem for the Jump Operator.Richard A. Shore - 1988 - Annals of Pure and Applied Logic 40 (3):277-303.
  10.  8
    Direct and Local Definitions of the Turing Jump.Richard A. Shore - 2007 - Journal of Mathematical Logic 7 (2):229-262.
  11. Decomposition and Infima in the Computably Enumerable Degrees.Rodney G. Downey, Geoffrey L. Laforte & Richard A. Shore - 2003 - Journal of Symbolic Logic 68 (2):551-579.
    Given two incomparable c.e. Turing degrees a and b, we show that there exists a c.e. degree c such that c = (a ⋃ c) ⋂ (b ⋃ c), a ⋃ c | b ⋃ c, and c < a ⋃ b.
    Direct download (8 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  12.  13
    Topological Aspects of the Medvedev Lattice.Andrew Em Lewis, Richard A. Shore & Andrea Sorbi - 2011 - Archive for Mathematical Logic 50 (3-4):319-340.
    We study the Medvedev degrees of mass problems with distinguished topological properties, such as denseness, closedness, or discreteness. We investigate the sublattices generated by these degrees; the prime ideal generated by the dense degrees and its complement, a prime filter; the filter generated by the nonzero closed degrees and the filter generated by the nonzero discrete degrees. We give a complete picture of the relationships of inclusion holding between these sublattices, these filters, and this ideal. We show that the sublattice (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  13.  13
    Working Below a Low2 Recursively Enumerably Degree.Richard A. Shore & Theodore A. Slaman - 1990 - Archive for Mathematical Logic 29 (3):201-211.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   9 citations  
  14.  57
    Reverse Mathematics: The Playground of Logic.Richard A. Shore - 2010 - Bulletin of Symbolic Logic 16 (3):378-402.
    This paper is essentially the author's Gödel Lecture at the ASL Logic Colloquium '09 in Sofia extended and supplemented by material from some other papers. After a brief description of traditional reverse mathematics, a computational approach to is presented. There are then discussions of some interactions between reverse mathematics and the major branches of mathematical logic in terms of the techniques they supply as well as theorems for analysis. The emphasis here is on ones that lie outside the usual main (...)
    Direct download (8 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  15. Definability in the Recursively Enumerable Degrees.André Nies, Richard A. Shore & Theodore A. Slaman - 1996 - Bulletin of Symbolic Logic 2 (4):392-404.
  16.  9
    The Maximal Linear Extension Theorem in Second Order Arithmetic.Alberto Marcone & Richard A. Shore - 2011 - Archive for Mathematical Logic 50 (5-6):543-564.
    We show that the maximal linear extension theorem for well partial orders is equivalent over RCA 0 to ATR 0. Analogously, the maximal chain theorem for well partial orders is equivalent to ATR 0 over RCA 0.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  17. The Reviews.Richard A. Shore - 2003 - Bulletin of Symbolic Logic 9 (1):1-2.
  18.  7
    Computably Categorical Structures and Expansions by Constants.Peter Cholak, Sergey Goncharov, Bakhadyr Khoussainov & Richard A. Shore - 1999 - Journal of Symbolic Logic 64 (1):13-37.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   6 citations  
  19.  7
    Undecidability and 1-Types in the Recursively Enumerable Degrees.Klaus Ambos-Spies & Richard A. Shore - 1993 - Annals of Pure and Applied Logic 63 (1):3-37.
    Ambos-Spies, K. and R.A. Shore, Undecidability and 1-types in the recursively enumerable degrees, Annals of Pure and Applied Logic 63 3–37. We show that the theory of the partial ordering of recursively enumerable Turing degrees is undecidable and has uncountably many 1-types. In contrast to the original proof of the former which used a very complicated O''' argument our proof proceeds by a much simpler infinite injury argument. Moreover, it combines with the permitting technique to get similar results for any (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   7 citations  
  20.  15
    Pseudo-Jump Operators. II: Transfinite Iterations, Hierarchies and Minimal Covers.Carl G. Jockusch Jr & Richard A. Shore - 1984 - Journal of Symbolic Logic 49 (4):1205 - 1236.
  21.  6
    Highness and Bounding Minimal Pairs.Rodney G. Downey, Steffen Lempp & Richard A. Shore - 1993 - Mathematical Logic Quarterly 39 (1):475-491.
  22.  18
    The Theory of the Recursively Enumerable Weak Truth-Table Degrees is Undecidable.Klaus Ambos-Spies, André Nies & Richard A. Shore - 1992 - Journal of Symbolic Logic 57 (3):864-874.
    We show that the partial order of Σ0 3-sets under inclusion is elementarily definable with parameters in the semilattice of r.e. wtt-degrees. Using a result of E. Herrmann, we can deduce that this semilattice has an undecidable theory, thereby solving an open problem of P. Odifreddi.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   7 citations  
  23. A Computably Categorical Structure Whose Expansion by a Constant has Infinite Computable Dimension.Denis R. Hirschfeldt, Bakhadyr Khoussainov & Richard A. Shore - 2003 - Journal of Symbolic Logic 68 (4):1199-1241.
    Cholak, Goncharov, Khoussainov, and Shore [1] showed that for each k > 0 there is a computably categorical structure whose expansion by a constant has computable dimension k. We show that the same is true with k replaced by ω. Our proof uses a version of Goncharov's method of left and right operations.
    Direct download (9 more)  
     
    Export citation  
     
    My bibliography  
  24.  1
    Reducibility Orderings: Theories, Definability and Automorphisms.Anil Nerode & Richard A. Shore - 1980 - Annals of Mathematical Logic 18 (1):61-89.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   10 citations  
  25.  4
    Working Below a High Recursively Enumerable Degree.Richard A. Shore & Theodore A. Slaman - 1993 - Journal of Symbolic Logic 58 (3):824-859.
  26.  3
    Countable Thin Π01 Classes.Douglas Cenzer, Rodney Downey, Carl Jockusch & Richard A. Shore - 1993 - Annals of Pure and Applied Logic 59 (2):79-139.
    Cenzer, D., R. Downey, C. Jockusch and R.A. Shore, Countable thin Π01 classes, Annals of Pure and Applied Logic 59 79–139. A Π01 class P {0, 1}ω is thin if every Π01 subclass of P is the intersection of P with some clopen set. Countable thin Π01 classes are constructed having arbitrary recursive Cantor- Bendixson rank. A thin Π01 class P is constructed with a unique nonisolated point A and furthermore A is of degree 0’. It is shown that no (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   6 citations  
  27.  8
    Recursion Theory.Anil Nerode & Richard A. Shore (eds.) - 1985 - American Mathematical Society.
    iterations of REA operators, as well as extensions, generalizations and other applications are given in [6] while those for the ...
    Direct download  
     
    Export citation  
     
    My bibliography   5 citations  
  28.  7
    Π 1 1 Relations and Paths Through.Sergey S. Goncharov, Valentina S. Harizanov, Julia F. Knight & Richard A. Shore - 2004 - Journal of Symbolic Logic 69 (2):585-611.
  29.  73
    Nowhere Simple Sets and the Lattice of Recursively Enumerable Sets.Richard A. Shore - 1978 - Journal of Symbolic Logic 43 (2):322-330.
  30.  2
    Π11 Relations and Paths Through.Sergey S. Goncharov, Valentina S. Harizanov, Julia F. Knight & Richard A. Shore - 2004 - Journal of Symbolic Logic 69 (2):585-611.
  31.  1
    The Recursively Enumerable Α-Degrees Are Dense.Richard A. Shore - 1976 - Annals of Mathematical Logic 9 (1-2):123-155.
  32.  20
    Degree Theoretic Definitions of the Low2 Recursively Enumerable Sets.Rod Downey & Richard A. Shore - 1995 - Journal of Symbolic Logic 60 (3):727 - 756.
  33.  7
    On Homogeneity and Definability in the First-Order Theory of the Turing Degrees.Richard A. Shore - 1982 - Journal of Symbolic Logic 47 (1):8-16.
  34.  21
    Degree Structures: Local and Global Investigations.Richard A. Shore - 2006 - Bulletin of Symbolic Logic 12 (3):369-389.
  35.  3
    Controlling the Dependence Degree of a Recursive Enumerable Vector Space.Richard A. Shore - 1978 - Journal of Symbolic Logic 43 (1):13-22.
  36. Minimal Α-Degrees.Richard A. Shore - 1972 - Annals of Mathematical Logic 4 (4):393-414.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   7 citations  
  37.  16
    Local Definitions in Degeree Structures: The Turing Jump, Hyperdegrees and Beyond.Richard A. Shore - 2007 - Bulletin of Symbolic Logic 13 (2):226-239.
    There are $\Pi_5$ formulas in the language of the Turing degrees, D, with ≤, ∨ and $\vedge$ , that define the relations $x" \leq y"$ , x" = y" and so $x \in L_{2}(y)=\{x\geqy|x"=y"\}$ in any jump ideal containing $0^(\omega)$ . There are also $\Sigma_6$ & $\Pi_6$ and $\Pi_8$ formulas that define the relations w = x" and w = x', respectively, in any such ideal I. In the language with just ≤ the quantifier complexity of each of these definitions (...)
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  38.  15
    Some More Minimal Pairs of Α-Recursively Enumerable Degrees.Richard A. Shore - 1978 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 24 (25-30):409-418.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  39.  15
    Boolean Algebras, Tarski Invariants, and Index Sets.Barbara F. Csima, Antonio Montalbán & Richard A. Shore - 2006 - Notre Dame Journal of Formal Logic 47 (1):1-23.
    Tarski defined a way of assigning to each Boolean algebra, B, an invariant inv(B) ∈ In, where In is a set of triples from ℕ, such that two Boolean algebras have the same invariant if and only if they are elementarily equivalent. Moreover, given the invariant of a Boolean algebra, there is a computable procedure that decides its elementary theory. If we restrict our attention to dense Boolean algebras, these invariants determine the algebra up to isomorphism. In this paper we (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  40.  54
    The N-R.E. Degrees: Undecidability and Σ1substructures.Mingzhong Cai, Richard A. Shore & Theodore A. Slaman - 2012 - Journal of Mathematical Logic 12 (01):1250005-.
  41.  13
    Conjectures and Questions From Gerald Sacks's Degrees of Unsolvability.Richard A. Shore - 1997 - Archive for Mathematical Logic 36 (4-5):233-253.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  42.  2
    Interpreting True Arithmetic in the Theory of the R.E. Truth Table Degrees.André Nies & Richard A. Shore - 1995 - Annals of Pure and Applied Logic 75 (3):269-311.
    We show that the elementary theory of the recursively enumerable tt-degrees has the same computational complexity as true first-order arithmetic. As auxiliary results, we prove theorems about exact pairs and initial segments in the tt-degrees.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  43.  20
    The Prospects for Mathematical Logic in the Twenty-First Century.Samuel R. Buss, Alexander S. Kechris, Anand Pillay & Richard A. Shore - 2001 - Bulletin of Symbolic Logic 7 (2):169-196.
    The four authors present their speculations about the future developments of mathematical logic in the twenty-first century. The areas of recursion theory, proof theory and logic for computer science, model theory, and set theory are discussed independently.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  44.  1
    On the Jumps of the Degrees Below a Recursively Enumerable Degree.David R. Belanger & Richard A. Shore - forthcoming - Notre Dame Journal of Formal Logic.
    We consider the set of jumps below a Turing degree, given by JB={x':x≤a}, with a focus on the problem: Which recursively enumerable degrees a are uniquely determined by JB? Initially, this is motivated as a strategy to solve the rigidity problem for the partial order R of r.e. degrees. Namely, we show that if every high2 r.e. degree a is determined by JB, then R cannot have a nontrivial automorphism. We then defeat the strategy—at least in the form presented—by constructing (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  45.  13
    Every Incomplete Computably Enumerable Truth-Table Degree is Branching.Peter A. Fejer & Richard A. Shore - 2001 - Archive for Mathematical Logic 40 (2):113-123.
    If r is a reducibility between sets of numbers, a natural question to ask about the structure ? r of the r-degrees containing computably enumerable sets is whether every element not equal to the greatest one is branching (i.e., the meet of two elements strictly above it). For the commonly studied reducibilities, the answer to this question is known except for the case of truth-table (tt) reducibility. In this paper, we answer the question in the tt case by showing that (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  46.  3
    Types of Simple Α-Recursively Enumerable Sets.Anne Leggett & Richard A. Shore - 1976 - Journal of Symbolic Logic 41 (3):681-694.
  47.  12
    The Bulletin of Symbolic Logic.Richard A. Shore - 1995 - Bulletin of Symbolic Logic 1 (1):1-3.
  48. Some More Minimal Pairs of Α‐Recursively Enumerable Degrees.Richard A. Shore - 1978 - Mathematical Logic Quarterly 24 (25‐30):409-418.
  49.  4
    Undecidability and Initial Segments of the (R.E.) TT-Degrees.Christine Ann Haught & Richard A. Shore - 1990 - Journal of Symbolic Logic 55 (3):987-1006.
  50.  1
    Infima of Recursively Enumerable Truth Table Degrees.Peter A. Fejer & Richard A. Shore - 1988 - Notre Dame Journal of Formal Logic 29 (3):420-437.
1 — 50 / 72