50 found
Order:
Disambiguations
S. B. Cooper [26]S. Barry Cooper [24]
  1.  15
    Computability Theory.S. Barry Cooper - 2004 - Chapman & Hall.
  2. Partial Degrees and the Density Problem. Part 2: The Enumeration Degrees of the ∑2 Sets Are Dense.S. B. Cooper - 1984 - Journal of Symbolic Logic 49 (2):503 - 513.
  3. On Minimal Pairs of Enumeration Degrees.Kevin McEvoy & S. Barry Cooper - 1985 - Journal of Symbolic Logic 50 (4):983-1001.
  4.  10
    How Enumeration Reducibility Yields Extended Harrington Non-Splitting.Mariya I. Soskova & S. Barry Cooper - 2008 - Journal of Symbolic Logic 73 (2):634 - 655.
  5.  16
    Properly Σ2 Enumeration Degrees.S. B. Cooper & C. S. Copestake - 1988 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 34 (6):491-522.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   7 citations  
  6.  16
    Enumeration Reducibility Using Bounded Information: Counting Minimal Covers.S. Barry Cooper - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (6):537-560.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   6 citations  
  7. First Steps Into Metapredicativity in Explicit Mathematics.Thomas Strahm, S. Barry Cooper & John K. Truss - 2002 - Bulletin of Symbolic Logic 8 (4):535-536.
  8.  9
    Minimal Degrees and the Jump Operator.S. B. Cooper - 1973 - Journal of Symbolic Logic 38 (2):249-271.
  9.  1
    Properly Σ2 Enumeration Degrees.S. B. Cooper & C. S. Copestake - 1988 - Mathematical Logic Quarterly 34 (6):491-522.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   7 citations  
  10.  1
    Enumeration Reducibility Using Bounded Information: Counting Minimal Covers.S. Barry Cooper - 1987 - Mathematical Logic Quarterly 33 (6):537-560.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   7 citations  
  11.  5
    Minimal Pairs and High Recursively Enumerable Degrees.S. B. Cooper - 1974 - Journal of Symbolic Logic 39 (4):655-660.
  12.  17
    The Density of the Low2 N-R.E. Degrees.S. Barry Cooper - 1991 - Archive for Mathematical Logic 31 (1):19-24.
    No categories
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  13.  10
    New Computational Paradigms: Changing Conceptions of What is Computable.S. B. Cooper, Benedikt Löwe & Andrea Sorbi (eds.) - 2007 - Springer.
    Logicians and theoretical physicists will also benefit from this book.
    Direct download  
     
    Export citation  
     
    My bibliography   1 citation  
  14.  2
    A Jump Class of Noncappable Degrees.S. B. Cooper - 1989 - Journal of Symbolic Logic 54 (2):324-353.
  15. Cupping and Noncupping in the Enumeration Degrees of ∑20 Sets.S. Barry Cooper, Andrea Sorbi & Xiaoding Yi - 1996 - Annals of Pure and Applied Logic 82 (3):317-342.
    We prove the following three theorems on the enumeration degrees of ∑20 sets. Theorem A: There exists a nonzero noncuppable ∑20 enumeration degree. Theorem B: Every nonzero Δ20enumeration degree is cuppable to 0′e by an incomplete total enumeration degree. Theorem C: There exists a nonzero low Δ20 enumeration degree with the anticupping property.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  16.  3
    Complementing Below Recursively Enumerable Degrees.S. Barry Cooper & Richard L. Epstein - 1987 - Annals of Pure and Applied Logic 34 (1):15-32.
  17.  8
    Noncappable Enumeration Degrees Below 0'e. [REVIEW]S. Barry Cooper & Andrea Sorbi - 1996 - Journal of Symbolic Logic 61 (4):1347 - 1363.
    We prove that there exists a noncappable enumeration degree strictly below 0' e.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  18.  10
    On the Distribution of Lachlan Nonsplitting Bases.S. Barry Cooper, Angsheng Li & Xiaoding Yi - 2002 - Archive for Mathematical Logic 41 (5):455-482.
    We say that a computably enumerable (c.e.) degree b is a Lachlan nonsplitting base (LNB), if there is a computably enumerable degree a such that a > b, and for any c.e. degrees w,v ≤ a, if a ≤ w or; v or; b then either a ≤ w or; b or a ≤ v or; b. In this paper we investigate the relationship between bounding and nonbounding of Lachlan nonsplitting bases and the high /low hierarchy. We prove that there (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  19.  10
    Bounding and Nonbounding Minimal Pairs in the Enumeration Degrees.S. Barry Cooper, Angsheng Li, Andrea Sorbi & Yue Yang - 2005 - Journal of Symbolic Logic 70 (3):741 - 766.
    We show that every nonzero $\Delta _{2}^{0}$ e-degree bounds a minimal pair. On the other hand, there exist $\Sigma _{2}^{0}$ e-degrees which bound no minimal pair.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  20.  8
    The Strong Anticupping Property for Recursively Enumerable Degrees.S. B. Cooper - 1989 - Journal of Symbolic Logic 54 (2):527-539.
  21.  6
    Partial Degrees and the Density Problem.S. B. Cooper - 1982 - Journal of Symbolic Logic 47 (4):854-859.
  22.  1
    Degrees of Unsolvability Complementary Between Recursively Enumerable Degrees, Part 1.S. B. Cooper - 1972 - Annals of Mathematical Logic 4 (1):31-73.
  23.  12
    Jump Equivalence of the ? 0/2 Hyperhyperimmune Sets.S. B. Cooper - 1972 - Journal of Symbolic Logic 37 (3):598-600.
  24.  1
    "Properly Sigma~2 Minimal Degrees and 0" Complementation.S. B. Cooper & Andrew E. M. Lewis - 2005 - Mathematical Logic Quarterly 51 (3):274.
    We show that there exists a properly Σ2 minimal degree b, and moreover that b can be chosen to join with 0′ to 0″ – so that b is a 0″ complement for every degree a such that 0′ ≤ a < 0″.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  25.  17
    There is No Low Maximal D.C.E. Degree.M. Arslanov, S. B. Cooper & A. Li - 2000 - Mathematical Logic Quarterly 46 (3):409-416.
    We show that for any computably enumerable set A and any equation image set L, if L is low and equation image, then there is a c.e. splitting equation image such that equation image. In Particular, if L is low and n-c.e., then equation image is n-c.e. and hence there is no low maximal n-c.e. degree.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  26.  14
    On Lachlan's Major Sub-Degree Problem.S. Barry Cooper & Angsheng Li - 2008 - Archive for Mathematical Logic 47 (4):341-434.
    The Major Sub-degree Problem of A. H. Lachlan (first posed in 1967) has become a long-standing open question concerning the structure of the computably enumerable (c.e.) degrees. Its solution has important implications for Turing definability and for the ongoing programme of fully characterising the theory of the c.e. Turing degrees. A c.e. degree a is a major subdegree of a c.e. degree b > a if for any c.e. degree x, ${{\bf 0' = b \lor x}}$ if and only if (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  27.  13
    The Machine as Data: A Computational View of Emergence and Definability.S. Barry Cooper - 2015 - Synthese 192 (7):1955-1988.
    Turing’s paper on computable numbers has played its role in underpinning different perspectives on the world of information. On the one hand, it encourages a digital ontology, with a perceived flatness of computational structure comprehensively hosting causality at the physical level and beyond. On the other, it can give an insight into the way in which higher order information arises and leads to loss of computational control—while demonstrating how the control can be re-established, in special circumstances, via suitable type reductions. (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  28.  13
    There is No Low Maximal D.C.E. Degree - Corrigendum.M. Arslanov & S. B. Cooper - 2004 - Mathematical Logic Quarterly 50 (6):628.
    We give a corrected proof of an extension of the Robinson Splitting Theorem for the d. c. e. degrees.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  29. Degrees of Unsolvability Complementary Between Recursively Enumerable Degrees, Part I.S. B. Cooper - 1972 - Annals of Mathematical Logic 4 (1):31.
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography   2 citations  
  30.  8
    The Discontinuity of Splitting in the Recursively Enumerable Degrees.S. Barry Cooper & Xiaoding Yi - 1995 - Archive for Mathematical Logic 34 (4):247-256.
    In this paper we examine a class of pairs of recursively enumerable degrees, which is related to the Slaman-Soare Phenomenon.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  31.  18
    Splitting and Nonsplitting, II: A $Low_2$ C.E. Degree Above Which 0' is Not Splittable.S. Barry Cooper & Angsheng Li - 2002 - Journal of Symbolic Logic 67 (4):1391-1430.
    It is shown that there exists a low2 Harrington non-splitting base-that is, a low2 computably enumerable (c.e.) degree a such that for any c.e. degrees x, y, if $0' = x \vee y$ , then either $0' = x \vee a$ or $0' = y \vee a$ . Contrary to prior expectations, the standard Harrington non-splitting construction is incompatible with the $low_{2}-ness$ requirements to be satisfied, and the proof given involves new techniques with potentially wider application.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  32. Jump Equivalence of the Δ2 0 Hyperimmune Sets.S. B. Cooper - 1972 - Journal of Symbolic Logic 37 (3):598-600.
  33.  3
    What Makes A Computation Unconventional?S. Barry Cooper - 2013 - In Gordana Dodig-Crnkovic Raffaela Giovagnoli (ed.), Computing Nature. pp. 255--269.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  34.  2
    Cupping and Noncupping in the Enumeration Degrees of∑< Sub> 2< Sup> 0 Sets.S. Barry Cooper, Andrea Sorbi & Xiaoding Yi - 1996 - Annals of Pure and Applied Logic 82 (3):317-342.
  35.  2
    Preface.S. Barry Cooper, Herman Geuvers, Anand Pillay & Jouko Väänänen - 2008 - Annals of Pure and Applied Logic 156 (1):1-2.
  36.  1
    The Minimal E-Degree Problem in Fragments of Peano Arithmetic.M. M. Arslanov, C. T. Chong, S. B. Cooper & Y. Yang - 2005 - Annals of Pure and Applied Logic 131 (1-3):159-175.
    We study the minimal enumeration degree problem in models of fragments of Peano arithmetic () and prove the following results: in any model M of Σ2 induction, there is a minimal enumeration degree if and only if M is a nonstandard model. Furthermore, any cut in such a model has minimal e-degree. By contrast, this phenomenon fails in the absence of Σ2 induction. In fact, whether every Σ2 cut has minimal e-degree is independent of the Σ2 bounding principle.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  37.  1
    Review: J. Myhill, Category Methods in Recursion Theory. [REVIEW]S. B. Cooper - 1973 - Journal of Symbolic Logic 38 (4):654-654.
  38. There is No Low Maximal D. C. E. Degree– Corrigendum.Marat Arslanov, S. Barry Cooper & Angsheng Li - 2004 - Mathematical Logic Quarterly 50 (6):628-636.
    We give a corrected proof of an extension of the Robinson Splitting Theorem for the d. c. e. degrees.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  39. Preface.Samuel R. Buss, S. Barry Cooper, Benedikt Löwe & Andrea Sorbi - 2009 - Annals of Pure and Applied Logic 160 (3):229-230.
  40.  20
    Computability, Enumerability, Unsolvability: Directions in Recursion Theory.S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.) - 1996 - Cambridge University Press.
    The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book, by leaders in the field, provide a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory. The topics range over computable functions, enumerable sets, degree structures, complexity, subrecursiveness, domains and inductive inference. A number of the articles contain introductory and background material which it is hoped will (...)
    Direct download  
     
    Export citation  
     
    My bibliography  
  41.  13
    Computability in Context: Computation and Logic in the Real World.S. B. Cooper & Andrea Sorbi (eds.) - 2011 - World Scientific.
    Recent new paradigms of computation, based on biological and physical models, address in a radically new way questions of efficiency and challenge assumptions ...
    Direct download  
     
    Export citation  
     
    My bibliography  
  42. Degrees of Unsolvability Complementary Between Recursively Enumerable Degrees, Part I.S. B. Cooper - 1975 - Journal of Symbolic Logic 40 (1):86-86.
  43. Degrees of Unsolvability Complementary Between Recursively Enumerable Degrees, Part I.S. B. Cooper - 1972 - Annals of Pure and Applied Logic 4 (1):31.
     
    Export citation  
     
    My bibliography  
  44. 1997 European Summer Meeting of the Association for Symbolic Logic.S. B. Cooper - 1998 - Bulletin of Symbolic Logic 4 (1):55-117.
  45. How the World Computes.S. Barry Cooper (ed.) - 2012
  46.  10
    Models and Computability: Invited Papers From Logic Colloquium '97, European Meeting of the Association for Symbolic Logic, Leeds, July 1997.S. B. Cooper & J. K. Truss (eds.) - 1999 - Cambridge University Press.
    Together, Models and Computability and its sister volume Sets and Proofs will provide readers with a comprehensive guide to the current state of mathematical logic. All the authors are leaders in their fields and are drawn from the invited speakers at 'Logic Colloquium '97' (the major international meeting of the Association of Symbolic Logic). It is expected that the breadth and timeliness of these two volumes will prove an invaluable and unique resource for specialists, post-graduate researchers, and the informed and (...)
    Direct download  
     
    Export citation  
     
    My bibliography  
  47. Myhill J.. Category Methods in Recursion Theory. Pacific Journal of Mathematics, Vol. 11 , Pp. 1479–1486.S. B. Cooper - 1973 - Journal of Symbolic Logic 38 (4):654.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  48. On a Conjecture of Kleene and Post.S. B. Cooper - 2001 - Mathematical Logic Quarterly 47 (1):3-34.
    A proof is given that 0′ is definable in the structure of the degrees of unsolvability. This answers a long-standing question of Kleene and Post, and has a number of corollaries including the definability of the jump operator.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  49. Sets and Proofs.S. Barry Cooper & John K. Truss - 2001 - Studia Logica 69 (3):446-448.
  50. Automorphisms of Η -Like Computable Linear Orderings and Kierstead's Conjecture.Charles M. Harris, Kyung Il Lee & S. Barry Cooper - 2016 - Mathematical Logic Quarterly 62 (6):481-506.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography