Timeline for Join Density in R.E. Degrees: Are there r.e. B, C with all r.e. X below B computable or C join X computes B
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 16, 2018 at 11:20 | vote | accept | Peter Gerdes | ||
| Dec 1, 2020 at 4:43 | |||||
| May 16, 2018 at 3:47 | answer | added | Theodore Slaman | timeline score: 7 | |
| May 15, 2018 at 15:56 | history | edited | Peter Gerdes | CC BY-SA 4.0 |
Gave spiffier title
|
| May 15, 2018 at 15:45 | history | edited | Peter Gerdes | CC BY-SA 4.0 |
forgot part about C not being above B
|
| May 15, 2018 at 15:43 | comment | added | Peter Gerdes | Ohh yah, forgot to add that i will do that now. | |
| May 15, 2018 at 15:42 | comment | added | Joel David Hamkins | I guess you want that $B$ and $C$ are incomparable? Otherwise, taking $C\geq_T B$ satisfies your conditions. | |
| May 15, 2018 at 15:40 | history | asked | Peter Gerdes | CC BY-SA 4.0 |