48 found
Order:
Disambiguations
S. Barry Cooper [27]S. B. Cooper [21]
  1.  40
    Computability Theory.S. Barry Cooper - 2003 - Chapman & Hall.
    Computability theory originated with the seminal work of Gödel, Church, Turing, Kleene and Post in the 1930s. This theory includes a wide spectrum of topics, such as the theory of reducibilities and their degree structures, computably enumerable sets and their automorphisms, and subrecursive hierarchy classifications. Recent work in computability theory has focused on Turing definability and promises to have far-reaching mathematical, scientific, and philosophical consequences. Written by a leading researcher, Computability Theory provides a concise, comprehensive, and authoritative introduction to contemporary (...)
  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.  14
    Minimal pairs and high recursively enumerable degrees.S. B. Cooper - 1974 - Journal of Symbolic Logic 39 (4):655-660.
  4. On minimal pairs of enumeration degrees.Kevin McEvoy & S. Barry Cooper - 1985 - Journal of Symbolic Logic 50 (4):983-1001.
  5.  18
    Minimal degrees and the jump operator.S. B. Cooper - 1973 - Journal of Symbolic Logic 38 (2):249-271.
  6.  22
    Properly Σ2 Enumeration Degrees.S. B. Cooper & C. S. Copestake - 1988 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 34 (6):491-522.
  7.  20
    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 (5 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  8.  6
    Enumeration Reducibility Using Bounded Information: Counting Minimal Covers.S. Barry Cooper - 1987 - Mathematical Logic Quarterly 33 (6):537-560.
    Direct download  
     
    Export citation  
     
    Bookmark   13 citations  
  9.  22
    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  
     
    Export citation  
     
    Bookmark   13 citations  
  10.  8
    Properly Σ2 Enumeration Degrees.S. B. Cooper & C. S. Copestake - 1988 - Mathematical Logic Quarterly 34 (6):491-522.
  11.  37
    Partial degrees and the density problem.S. B. Cooper - 1982 - Journal of Symbolic Logic 47 (4):854-859.
  12.  49
    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 (3 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  13.  33
    How Enumeration Reducibility Yields Extended Harrington Non-Splitting.Mariya I. Soskova & S. Barry Cooper - 2008 - Journal of Symbolic Logic 73 (2):634 - 655.
  14.  22
    A jump class of noncappable degrees.S. B. Cooper - 1989 - Journal of Symbolic Logic 54 (2):324-353.
  15.  18
    Degrees of unsolvability complementary between recursively enumerable degrees, Part I.S. B. Cooper - 1972 - Annals of Mathematical Logic 4 (1):31.
  16. There is No Low Maximal D.C.E. Degree.Marat Arslanov, S. Barry Cooper & Angsheng 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.
     
    Export citation  
     
    Bookmark   3 citations  
  17.  22
    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.
  18.  8
    Complementing below recursively enumerable degrees.S. Barry Cooper & Richard L. Epstein - 1987 - Annals of Pure and Applied Logic 34 (1):15-32.
  19.  58
    Jump equivalence of the Δ2 0 hyperimmune sets.S. B. Cooper - 1972 - Journal of Symbolic Logic 37 (3):598-600.
  20.  13
    On a Conjecture of Kleene and Post.S. Barry 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  
     
    Export citation  
     
    Bookmark   3 citations  
  21.  27
    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  
     
    Bookmark   3 citations  
  22.  36
    The strong anticupping property for recursively enumerable degrees.S. B. Cooper - 1989 - Journal of Symbolic Logic 54 (2):527-539.
  23.  28
    New computational paradigms: changing conceptions of what is computable.S. B. Cooper, Benedikt Löwe & Andrea Sorbi (eds.) - 2008 - New York: Springer.
    Logicians and theoretical physicists will also benefit from this book.
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  24.  16
    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.
    We develop an approach to the longstanding conjecture of Kierstead concerning the character of strongly nontrivial automorphisms of computable linear orderings. Our main result is that for any η-like computable linear ordering, such that has no interval of order type η, and such that the order type of is determined by a -limitwise monotonic maximal block function, there exists computable such that has no nontrivial automorphism.
    No categories
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  25.  41
    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 (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  26.  35
    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 (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  27.  66
    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 (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  28.  9
    Minimal Degrees and the Jump Operator.S. B. Cooper - 1975 - Journal of Symbolic Logic 40 (1):86-87.
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  29.  88
    Splitting and nonsplitting II: A low {\sb 2$} C.E. degree about which ${\bf 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  
     
    Bookmark   1 citation  
  30.  8
    Preface.S. Barry Cooper, Herman Geuvers, Anand Pillay & Jouko Väänänen - 2008 - Annals of Pure and Applied Logic 156 (1):1-2.
  31.  25
    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  
     
    Export citation  
     
    Bookmark   1 citation  
  32.  44
    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 (4 more)  
     
    Export citation  
     
    Bookmark  
  33.  5
    Preface.Samuel R. Buss, S. Barry Cooper, Benedikt Löwe & Andrea Sorbi - 2009 - Annals of Pure and Applied Logic 160 (3):229-230.
  34.  9
    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 Δ20, e-degree bounds a minimal pair. On the other hand, there exist Σ20, e-degrees which bound no minimal pair.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  35. Computation and Logic in the Real World. CiE 2007. Lecture Notes in Computer Science, vol 4497.S. B. Cooper, B. Löwe & A. Sorbi (eds.) - 2007
    No categories
     
    Export citation  
     
    Bookmark  
  36.  31
    Computability, enumerability, unsolvability: directions in recursion theory.S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.) - 1996 - New York: 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  
     
    Bookmark  
  37.  23
    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  
     
    Bookmark  
  38.  7
    1997 European Summer Meeting of the Association for Symbolic Logic.S. B. Cooper - 1998 - Bulletin of Symbolic Logic 4 (1):55-117.
  39. How the World Computes.S. Barry Cooper (ed.) - 2012
     
    Export citation  
     
    Bookmark  
  40.  25
    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 - New York: 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  
     
    Bookmark  
  41.  4
    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-654.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  42.  71
    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 (3 more)  
     
    Export citation  
     
    Bookmark  
  43. Sets and Proofs.S. Barry Cooper & John K. Truss - 2001 - Studia Logica 69 (3):446-448.
  44.  12
    Turing Centenary Conference: How the World Computes.S. Barry Cooper, Anuj Dawar, Martin Hyland & Benedikt Löwe - 2014 - Annals of Pure and Applied Logic 165 (9):1353-1354.
  45.  14
    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 (3 more)  
     
    Export citation  
     
    Bookmark  
  46.  10
    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  
     
    Bookmark  
  47.  25
    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 (7 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  48.  8
    Review: J. Myhill, Category Methods in Recursion Theory. [REVIEW]S. B. Cooper - 1973 - Journal of Symbolic Logic 38 (4):654-654.