71 found
Order:
Disambiguations:
S. Barry Cooper [23]S. B. Cooper [22]Sarah Cooper [6]S. Cooper [5]
Stephen Cooper [4]Steven H. Cooper [4]Sandi E. Cooper [3]Stephen Andrew Cooper [2]

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

See also:
Profile: Sasha Cooper
Profile: Susan Cooper (Montana State University-Bozeman)
Profile: Scarlett Cooper
Profile: Steph Cooper (University of Western Ontario)
  1.  9
    S. Barry Cooper (2004). Computability Theory. Chapman & Hall.
  2. S. B. Cooper (1984). Partial Degrees and the Density Problem. Part 2: The Enumeration Degrees of the ∑2 Sets Are Dense. Journal of Symbolic Logic 49 (2):503 - 513.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   5 citations  
  3. Kevin McEvoy & S. Barry Cooper (1985). On Minimal Pairs of Enumeration Degrees. Journal of Symbolic Logic 50 (4):983-1001.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  4.  8
    S. Cooper & Mariya Soskova (2008). How Enumeration Reducibility Yields Extended Harrington Non-Splitting. Journal of Symbolic Logic 73 (2):634-655.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  5.  2
    Mariya I. Soskova & S. Barry Cooper (2008). How Enumeration Reducibility Yields Extended Harrington Non-Splitting. Journal of Symbolic Logic 73 (2):634 - 655.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  6. Sarah Cooper (2006). Selfless Cinema?: Ethics and French Documentary. Legenda.
  7. Thomas Strahm, S. Barry Cooper & John K. Truss (2002). First Steps Into Metapredicativity in Explicit Mathematics. Bulletin of Symbolic Logic 8 (4):535-536.
     
    Export citation  
     
    My bibliography   4 citations  
  8.  13
    S. Barry Cooper (1991). The Density of the Low2 N-R.E. Degrees. Archive for Mathematical Logic 31 (1):19-24.
    No categories
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  9.  5
    S. B. Cooper (1973). Minimal Degrees and the Jump Operator. Journal of Symbolic Logic 38 (2):249-271.
  10.  5
    S. B. Cooper (1974). Minimal Pairs and High Recursively Enumerable Degrees. Journal of Symbolic Logic 39 (4):655-660.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   8 citations  
  11.  13
    S. Barry Cooper & Angsheng Li (2008). On Lachlan's Major Sub-Degree Problem. 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 (...)
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  12.  6
    S. B. Cooper, Benedikt Löwe & Andrea Sorbi (eds.) (2007). New Computational Paradigms: Changing Conceptions of What is Computable. Springer.
    Logicians and theoretical physicists will also benefit from this book.
    Direct download  
     
    Export citation  
     
    My bibliography   1 citation  
  13.  2
    S. B. Cooper (1989). A Jump Class of Noncappable Degrees. Journal of Symbolic Logic 54 (2):324-353.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  14.  7
    Stephen Cooper & Peter Fantes (1987). On G0 and Cell Cycle Controls. Bioessays 7 (5):220-223.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  15.  12
    M. Arslanov & S. B. Cooper (2004). There is No Low Maximal D.C.E. Degree - Corrigendum. 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.
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  16.  8
    S. B. Cooper (1989). The Strong Anticupping Property for Recursively Enumerable Degrees. Journal of Symbolic Logic 54 (2):527-539.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  17.  20
    Tiffany K. Jantz, Jessica J. Tomory, Christina Merrick, Shanna Cooper, Adam Gazzaley & Ezequiel Morsella (2014). Subjective Aspects of Working Memory Performance: Memoranda-Related Imagery. Consciousness and Cognition 25 (1):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 (2 more)  
     
    Export citation  
     
    My bibliography  
  18.  10
    M. Arslanov, S. B. Cooper & A. Li (2000). There is No Low Maximal D.C.E. Degree. 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.
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  19.  4
    S. Barry Cooper (1987). Enumeration Reducibility Using Bounded Information: Counting Minimal Covers. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (6):537-560.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  20.  4
    S. B. Cooper & C. S. Copestake (1988). Properly Σ2 Enumeration Degrees. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 34 (6):491-522.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  21.  8
    S. Barry Cooper, Angsheng Li, Andrea Sorbi & Yue Yang (2005). Bounding and Nonbounding Minimal Pairs in the Enumeration Degrees. 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 (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  22. S. Barry Cooper (1987). Enumeration Reducibility Using Bounded Information: Counting Minimal Covers. Mathematical Logic Quarterly 33 (6):537-560.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  23.  29
    D. Pimentel, N. Brown, F. Vecchio, V. La Capra, S. Hausman, O. Lee, A. Diaz, J. Williams, S. Cooper & E. Newburger (1992). Ethical Issues Concerning Potential Global Climate Change on Food Production. 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 (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  24.  7
    Stephen A. Cooper (1996). Scripture at Cassiciacum. Augustinian Studies 27 (2):21-46.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  25.  5
    S. B. Cooper (1982). Partial Degrees and the Density Problem. Journal of Symbolic Logic 47 (4):854-859.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  26.  10
    Sarah Cooper (2009). Introduction: Levinas and Cinema. Film-Philosophy 11 (2).
    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 (5 more)  
     
    Export citation  
     
    My bibliography  
  27.  3
    S. Barry Cooper (2015). The Machine as Data: A Computational View of Emergence and Definability. 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. (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  28.  8
    S. Barry Cooper & Xiaoding Yi (1995). The Discontinuity of Splitting in the Recursively Enumerable Degrees. 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  
  29. S. B. Cooper & C. S. Copestake (1988). Properly Σ2 Enumeration Degrees. Mathematical Logic Quarterly 34 (6):491-522.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  30.  7
    S. Barry Cooper & Andrea Sorbi (1996). Noncappable Enumeration Degrees Below 0'e. [REVIEW] Journal of Symbolic Logic 61 (4):1347 - 1363.
    We prove that there exists a noncappable enumeration degree strictly below 0' e.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  31.  10
    Stephen Cooper (2008). On the Fiftieth Anniversary of the Schaechter, Maaløe, Kjeldgaard Experiments: Implications for Cell‐Cycle and Cell‐Growth Control. Bioessays 30 (10):1019-1024.
  32.  5
    S. B. Cooper (1972). Jump Equivalence of the ? 0/2 Hyperhyperimmune Sets. Journal of Symbolic Logic 37 (3):598-600.
  33.  8
    S. Barry Cooper, Angsheng Li & Xiaoding Yi (2002). On the Distribution of Lachlan Nonsplitting Bases. 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 (...)
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  34.  4
    S. Cooper, Anuj Dawar, Martin Hyland & Benedikt Löwe (2014). Turing Centenary Conference: How the World Computes. Annals of Pure and Applied Logic 165 (9):1353-1354.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  35.  7
    Sarah Cooper (2009). Mortal Ethics: Reading Levinas with the Dardenne Brothers. 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 (5 more)  
     
    Export citation  
     
    My bibliography  
  36.  7
    Stephen Cooper (2006). Checkpoints and Restriction Points in Bacteria and Eukaryotic Cells. Bioessays 28 (10):1035-1039.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  37. S. Barry Cooper, Andrea Sorbi & Xiaoding Yi (1996). Cupping and Noncupping in the Enumeration Degrees of ∑20 Sets. 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   1 citation  
  38.  17
    S. Barry Cooper & Angsheng Li (2002). Splitting and Nonsplitting, II: A $Low_2$ C.E. Degree Above Which 0' is Not Splittable. 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 (6 more)  
     
    Export citation  
     
    My bibliography  
  39.  3
    Klaus Berger, James M. Blythe, Albert Boime, Sandi E. Cooper, John A. Davies, Paul Ginsberg, Aleksa Djilas, Didier Eribon & Trans Betsy Wing (1992). RJW Evans and TV Thomas, Eds, Crown Church and Estates: Central European Politics in the 16th and 17th Centuries (New York: St Martin's Press, 1991), Studies In. [REVIEW] South African Journal of Philosophy 11:24.
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography  
  40.  4
    Stephen Cooper (2002). Minimally Disturbed, Multicycle, and Reproducible Synchrony Using a Eukaryotic?Baby Machine? Bioessays 24 (6):499-501.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  41.  3
    S. Barry Cooper & Richard L. Epstein (1987). Complementing Below Recursively Enumerable Degrees. Annals of Pure and Applied Logic 34 (1):15-32.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  42.  2
    S. Barry Cooper, Andrea Sorbi & Xiaoding Yi (1996). Cupping and Noncupping in the Enumeration Degrees of∑< Sub> 2< Sup> 0 Sets. Annals of Pure and Applied Logic 82 (3):317-342.
    Direct download  
     
    Export citation  
     
    My bibliography  
  43.  2
    S. Barry Cooper, Herman Geuvers, Anand Pillay & Jouko Väänänen (2008). Preface. Annals of Pure and Applied Logic 156 (1):1-2.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  44.  1
    Sandi E. Cooper (1987). British Labour, European Socialism and the Struggle for Peace, 1889–1914. History of European Ideas 8 (2):252-254.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  45.  1
    S. B. Cooper & Andrew E. M. Lewis (2005). "Properly Sigma~2 Minimal Degrees and 0" Complementation. 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″.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  46.  1
    S. B. Cooper (1972). Degrees of Unsolvability Complementary Between Recursively Enumerable Degrees, Part 1. Annals of Mathematical Logic 4 (1):31-73.
  47. Marat Arslanov, S. Barry Cooper & Angsheng Li (2004). There is No Low Maximal D. C. E. Degree– Corrigendum. Mathematical Logic Quarterly 50 (6):628-636.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  48. M. M. Arslanov, C. T. Chong, S. B. Cooper & Y. Yang (2005). The Minimal E-Degree Problem in Fragments of Peano Arithmetic. 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  
  49. Samuel R. Buss, S. Barry Cooper, Benedikt Löwe & Andrea Sorbi (2009). Preface. Annals of Pure and Applied Logic 160 (3):229-230.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  50. Steven H. Cooper (2010). A Disturbance in the Field: Essays in Transference-Countertransference Engagement. Routledge.
    The field, as Steven Cooper describes it, is comprised of the inextricably related worlds of internalized object relations and interpersonal interaction. Furthermore, the analytic dyad is neither static nor smooth sailing. Eventually, the rigorous work of psychoanalysis will offer a fraught opportunity to work through the most disturbing elements of a patient's inner life as expressed and experienced by the analyst - indeed, a disturbance in the field. How best to proceed when such tricky yet altogether common therapeutic situations arise, (...)
    No categories
     
    Export citation  
     
    My bibliography  
1 — 50 / 71