IN MEMORIAM: BARRY COOPER 1943–2015

DOI10.1017/bsl.2016.17zbMath1362.01019OpenAlexW2531707744MaRDI QIDQ5346708

Andrea Sorbi, Andrew E. M. Lewis-Pye

Publication date: 26 May 2017

Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/bsl.2016.17

Mathematics Subject Classification ID

Biographies, obituaries, personalia, bibliographies (01A70)

Cites Work

• The machine as data: a computational view of emergence and definability
• The d.r.e. degrees are not dense
• Noncappable enumeration degrees below 0_e^′
• How enumeration reductibility yields extended Harrington non-splitting
• Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ₂ sets are dense
• Enumeration Reducibility Using Bounded Information: Counting Minimal Covers
• Properly Σ2 Enumeration Degrees
• Minimal pairs and high recursively enumerable degrees
• Minimal degrees and the jump operator
• Bounding and nonbounding minimal pairs in the enumeration degrees
• Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: IN MEMORIAM: BARRY COOPER 1943–2015