Hostname: page-component-cd9895bd7-dzt6s Total loading time: 0 Render date: 2025-01-05T14:39:49.917Z Has data issue: false hasContentIssue false
  • English
  • Français

IN MEMORIAM: BARRY COOPER 1943–2015

Published online by Cambridge University Press:  10 October 2016

Andrew Lewis-Pye  and
Andrea Sorbi
Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
In Memoriam
Information
Bulletin of Symbolic Logic , Volume 22 , Issue 3 , September 2016 , pp. 361 - 365
Copyright
Copyright © The Association for Symbolic Logic 2016 

References

CITED PAPERS OF BARRY COOPER

Arslanov, M. M., Cooper, S. B., and Kalimullin, I. Sh., Splitting properties of total enumeration degrees . Algebra and Logic, vol. 42 (2003), pp. 1–13.CrossRefGoogle Scholar
Cooper, S. B., Minimal degrees and the jump operator . Journal of Symbolic Logic, vol. 38 (1973), pp. 249–271.CrossRefGoogle Scholar
Cooper, S. B., Minimal pairs and high recursively enumerable degrees . Journal of Symbolic Logic, vol. 39 (1974), pp. 655–660.CrossRefGoogle Scholar
Cooper, S. B., Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ2 sets are dense . Journal of Symbolic Logic, vol. 49 (1984), pp. 503–513.CrossRefGoogle Scholar
Cooper, S. B., Enumeration reducibility using bounded information: counting minimal covers . Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, vol. 33 (1987), pp. 537–560.CrossRefGoogle Scholar
Cooper, S. B., Enumeration reducibility, nondeterministic computations and relative computability of partial functions , Recursion Theory Week, Oberwolfach 1989 (Ambos-Spies, K., Müller, G., and Sacks, G. E., editors), Lecture Notes in Mathematics, vol. 1432, Heidelberg, Springer-Verlag, 1990, pp. 57–110.Google Scholar
Cooper, S. B., Clockwork or turing universe? Models and Computability (Cooper, S. B. and Truss, J. K., editors), London Mathematical Society Lecture Notes Series 259, Cambridge University Press, Cambridge, New York, Melbourne, 1999, pp. 63–116.CrossRefGoogle Scholar
Cooper, S. B., The machine as data: A computational view of emergence and definability . Synthese, vol. 192 (2015), pp. 1955–1988.CrossRefGoogle Scholar
Cooper, S. B. and Copestake, C. S., Properly Σ2 enumeration degrees . Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, vol. 34 (1988), pp. 491–522.CrossRefGoogle Scholar
Cooper, S. B., Harrington, L. A., Lachlan, A. H., Lempp, S., and Soare, R. I., The d.r.e. degrees are not dense . Annals of Pure and Applied Logic, vol. 55 (1991), pp. 125–151.CrossRefGoogle Scholar
Cooper, S. B., Li, A., Sorbi, A., and Yang, Y., Bounding and nonbounding minimal pairs in the enumeration degrees . Journal of Symbolic Logic, vol. 70 (2005), no. 3, pp. 741–766.CrossRefGoogle Scholar
Cooper, S. B. and Odifreddi, P., Incomputability in nature , Computability and Models: Perspectives East and West (Cooper, S. B. and Goncharov, S. S., editors), Kluwer Academic/Plenum Publishers, New York, Boston, Dordrecht, London, Moscow, 2003, pp. 137–160.CrossRefGoogle Scholar
Cooper, S. B. and Sorbi, A., Noncappable enumeration degrees below $0'_e$ . Journal of Symbolic Logic, vol. 61 (1996), pp. 1347–1363.CrossRefGoogle Scholar
Cooper, S. B., Sorbi, A., and Yi, X., Cupping and noncupping in the enumeration degrees of ${\rm{\Sigma }}_2^0$ sets . Annals of Pure and Applied Logic, vol. 82 (1997), no. 3, pp. 317–342.CrossRefGoogle Scholar
Soskova, M. I. and Cooper, S. B., How enumeration reducibility yields extended Harrington non-splitting . Journal of Symbolic Logic, vol. 73 (2008), pp. 634–655.CrossRefGoogle Scholar