Timeline for Is there a Turing degree which is a strong minimal cover and does not have itself a strong minimal cover?
Current License: CC BY-SA 3.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 8, 2014 at 21:53 | vote | accept | Archimondain | ||
| Jan 8, 2014 at 21:53 | history | edited | Archimondain | CC BY-SA 3.0 |
edited body
|
| Jan 8, 2014 at 21:53 | comment | added | Archimondain | sorry for that, my english is sometimes a bit approximative ;) | |
| Jan 8, 2014 at 18:33 | comment | added | Dan Turetsky | Correct, a degree is not a strong minimal cover of itself. I suspect your confusion is with the final line. The question is not "don't have themselves as strong minimal covers", it's "don't themselves have strong minimal covers". | |
| Jan 8, 2014 at 13:48 | answer | added | Bjørn Kjos-Hanssen | timeline score: 5 | |
| Jan 8, 2014 at 12:29 | comment | added | Denis | The problem was not here. In your definition $a$ has to be strictly above $b$, so $a$ cannot be equal to $b$. | |
| Jan 8, 2014 at 11:30 | history | edited | Archimondain | CC BY-SA 3.0 |
added 27 characters in body
|
| Jan 8, 2014 at 11:29 | comment | added | Archimondain | By "below b", I don't mean "strictly below b" (I assume that is what you disagree with). I'll edit that so there is no confusion. | |
| Jan 8, 2014 at 11:19 | comment | added | Denis | Then your question does not make sense, because it is now impossible for a degree to have itself as strong minimal cover. | |
| Jan 8, 2014 at 11:15 | comment | added | Archimondain | You are right. I edited the question. | |
| Jan 8, 2014 at 11:13 | history | edited | Archimondain | CC BY-SA 3.0 |
added 47 characters in body
|
| Jan 8, 2014 at 11:08 | comment | added | Denis | from your definition, every degree is its own minimal cover. | |
| Jan 8, 2014 at 11:00 | history | asked | Archimondain | CC BY-SA 3.0 |