Order:
Disambiguations
S. Barry Cooper [26]S. B. Cooper [20]S. Cooper [9]Sarah Cooper [8]
Stephen Cooper [5]Steven H. Cooper [4]Sandi E. Cooper [3]Sheila Cooper [2]

Not all matches are shown. Search with initial or firstname to single out others.

See also
Susan Cooper
Montana State University-Bozeman
  1.  23
    Computability Theory.S. Barry Cooper - 2004 - Chapman & Hall.
  2.  1
    The Role of Psychometrics in Individual Differences Research in Cognition: A Case Study of the AX-CPT.Shelly R. Cooper, Corentin Gonthier, Deanna M. Barch & Todd S. Braver - 2017 - Frontiers in Psychology 8.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  3.  57
    Mortal Ethics: Reading Levinas with the Dardenne Brothers.Sarah Cooper - 2007 - Film-Philosophy 11 (2):56-87.
    Prior to the productive encounters that can be staged between Emmanuel Levinas’sthought and cinema at the level of reception, Jean-Pierre and Luc Dardenne introducehis philosophy to their filmmaking at its moment of inception.1Luc Dardenne’s diary Audos de nos images documents their filmmaking from 1991 to 2005, and isinterspersed with brief but erudite references to Levinas’s work. While Levinasianthinking is one among many cited influences in this text, which also features quotationsfrom the writings of novelists, poets, and other philosophers, along with (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  4. 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.
  5.  18
    The D.R.E. Degrees Are Not Dense.S. Cooper, Leo Harrington, Alistair Lachlan, Steffen Lempp & Robert Soare - 1991 - Annals of Pure and Applied Logic 55 (2):125-151.
    By constructing a maximal incomplete d.r.e. degree, the nondensity of the partial order of the d.r.e. degrees is established. An easy modification yields the nondensity of the n-r.e. degrees and of the ω-r.e. degrees.
    Direct download  
     
    Export citation  
     
    Bookmark   18 citations  
  6. On Minimal Pairs of Enumeration Degrees.Kevin McEvoy & S. Barry Cooper - 1985 - Journal of Symbolic Logic 50 (4):983-1001.
  7.  13
    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 (6 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  8.  28
    How Enumeration Reducibility Yields Extended Harrington Non-Splitting.Mariya I. Soskova & S. Barry Cooper - 2008 - Journal of Symbolic Logic 73 (2):634 - 655.
  9.  29
    Ubuntu as a Framework for Ethical Decision Making in Africa: Responding to Epidemics.Evanson Z. Sambala, Sara Cooper & Lenore Manderson - 2020 - Ethics and Behavior 30 (1):1-13.
    Public health decisions made by the state involve considerable disagreements on the course of actions, uncertainties, and compromises that arise from moral tensions between the demands of civil liberties and the goals of public health. With such complex decisions, it can be extremely difficult to arrive at and justify the best option. In this article, we propose an ethical decision-making framework based on the philosophy of Ubuntu and argue that in sub-Saharan African settings, this approach provides attractive alternative conventions of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  10.  19
    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  
     
    Bookmark   12 citations  
  11.  8
    American Journal of Philology: The "Modern" Prometheus in Antiquity: Aristophanes and Lucian.Samuel D. Cooper - 2019 - American Journal of Philology 140 (4):579-611.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  12.  20
    Properly Σ2 Enumeration Degrees.S. B. Cooper & C. S. Copestake - 1988 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 34 (6):491-522.
  13.  5
    Enumeration Reducibility Using Bounded Information: Counting Minimal Covers.S. Barry Cooper - 1987 - Mathematical Logic Quarterly 33 (6):537-560.
  14.  40
    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 (4 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  15.  79
    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 (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  16. Selfless Cinema?: Ethics and French Documentary.Sarah Cooper - 2006 - Legenda.
  17.  10
    Minimal Pairs and High Recursively Enumerable Degrees.S. B. Cooper - 1974 - Journal of Symbolic Logic 39 (4):655-660.
  18.  6
    Properly Σ2 Enumeration Degrees.S. B. Cooper & C. S. Copestake - 1988 - Mathematical Logic Quarterly 34 (6):491-522.
  19.  17
    Minimal Degrees and the Jump Operator.S. B. Cooper - 1973 - Journal of Symbolic Logic 38 (2):249-271.
  20.  27
    The Machine as Data: A Computational View of Emergence and Definability.S. 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 (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  21.  30
    Partial Degrees and the Density Problem.S. B. Cooper - 1982 - Journal of Symbolic Logic 47 (4):854-859.
  22.  36
    Subjective Aspects of Working Memory Performance: Memoranda-Related Imagery.Tiffany K. Jantz, Jessica J. Tomory, Christina Merrick, Shanna Cooper, Adam Gazzaley & Ezequiel Morsella - 2014 - Consciousness and Cognition 25:88-100.
    Although it is well accepted that working memory is intimately related to consciousness, little research has illuminated the liaison between the two phenomena. To investigate this under-explored nexus, we used an imagery monitoring task to investigate the subjective aspects of WM performance. Specifically, in two experiments, we examined the effects on consciousness of holding in mind information having a low versus high memory load, and holding memoranda in mind during the presentation of distractors . Higher rates of rehearsal occurred in (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  23.  38
    Introduction: Levinas and Cinema.Sarah Cooper - 2007 - Film-Philosophy 11 (2):66-87.
    Emmanuel Levinas never wrote about cinema. To the uninitiated, this may appearsurprising, given that his life spanned the twentieth century, in which film emerged as amajor art form, and his work includes tantalising allusions to films and the cinematicmedium. Far from surprising, however, the liminal place that cinema occupies inLevinas’s thought is entirely understandable. Although his philosophy features manycultured references to literature and the other arts, and he discusses the work of suchwriters as Marcel Proust and Michel Leiris in some (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  24.  13
    Introduction: The Occluded Relation: Levinas and Cinema.Sarah Cooper - 2007 - Film-Philosophy 11 (2):i-vii.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  25.  20
    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 (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  26.  49
    Jump Equivalence of the Δ2 0 Hyperimmune Sets.S. B. Cooper - 1972 - Journal of Symbolic Logic 37 (3):598-600.
  27.  56
    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  
     
    Bookmark   1 citation  
  28.  12
    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 (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  29.  36
    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.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  30.  13
    Properly Σ2 Minimal Degrees and 0″ Complementation.S. Cooper, Andrew Lewis & Yue Yang - 2005 - Mathematical Logic Quarterly 51 (3):274-276.
    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  
     
    Bookmark   2 citations  
  31.  30
    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  
  32.  17
    A Jump Class of Noncappable Degrees.S. B. Cooper - 1989 - Journal of Symbolic Logic 54 (2):324-353.
  33.  62
    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  
  34.  17
    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  
  35.  18
    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  
     
    Bookmark   1 citation  
  36.  11
    Degrees of Unsolvability Complementary Between Recursively Enumerable Degrees, Part I.S. B. Cooper - 1972 - Annals of Mathematical Logic 4 (1):31.
  37.  16
    On G0 and Cell Cycle Controls.Stephen Cooper & Peter Fantes - 1987 - Bioessays 7 (5):220-223.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  38.  27
    The Strong Anticupping Property for Recursively Enumerable Degrees.S. B. Cooper - 1989 - Journal of Symbolic Logic 54 (2):527-539.
  39.  67
    Ethical Issues Concerning Potential Global Climate Change on Food Production.D. Pimentel, N. Brown, F. Vecchio, V. La Capra, S. Hausman, O. Lee, A. Diaz, J. Williams, S. Cooper & E. Newburger - 1992 - Journal of Agricultural and Environmental Ethics 5 (2):113-146.
    Burning fossil fuel in the North American continent contributes more to the CO2 global warming problem than in any other continent. The resulting climate changes are expected to alter food production. The overall changes in temperature, moisture, carbon dioxide, insect pests, plant pathogens, and weeds associated with global warming are projected to reduce food production in North America. However, in Africa, the projected slight rise in rainfall is encouraging, especially since Africa already suffers from severe shortages of rainfall. For all (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  40.  6
    Complementing Below Recursively Enumerable Degrees.S. Barry Cooper & Richard L. Epstein - 1987 - Annals of Pure and Applied Logic 34 (1):15-32.
  41.  34
    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 (5 more)  
     
    Export citation  
     
    Bookmark  
  42.  12
    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.
  43.  5
    Noncappable Enumeration Degrees Below $0'_e$.S. Cooper & Andrea Sorbi - 1996 - Journal of Symbolic Logic 61 (3):1347-1363.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  44.  10
    The Ethics of Rewriting the Loss of Exile in Manne aux Mandelstams aux Mandelas.Sarah Cooper - 2000 - Paragraph 23 (3):311-323.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  45.  4
    Strong Minimal Covers for Recursively Enumerable Degrees.S. Cooper - 1996 - Mathematical Logic Quarterly 42 (1):191-196.
    We prove that there exists a nonzero recursively enumerable Turing degree possessing a strong minimal cover.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  46.  28
    On the Fiftieth Anniversary of the Schaechter, Maaløe, Kjeldgaard Experiments: Implications for Cell‐Cycle and Cell‐Growth Control.Stephen Cooper - 2008 - Bioessays 30 (10):1019-1024.
  47.  13
    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 (6 more)  
     
    Export citation  
     
    Bookmark  
  48.  23
    Checkpoints and Restriction Points in Bacteria and Eukaryotic Cells.Stephen Cooper - 2006 - Bioessays 28 (10):1035-1039.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  49.  7
    Minimal Degrees and the Jump Operator.S. B. Cooper - 1975 - Journal of Symbolic Logic 40 (1):86-87.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  50.  14
    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  
     
    Bookmark  
1 — 50 / 82