Timeline for The least admissible above a dominating real
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 31, 2018 at 23:28 | answer | added | Dmytro Taranovsky | timeline score: 1 | |
| Oct 6, 2015 at 22:48 | comment | added | Archimondain | Why cannot we apply the same argument to trees computable in Kleene's $O$ (given that Kleene's $O$ is arithmetical in $r$) ? | |
| S Sep 18, 2015 at 22:47 | history | bounty ended | CommunityBot | ||
| S Sep 18, 2015 at 22:47 | history | notice removed | CommunityBot | ||
| S Sep 10, 2015 at 21:30 | history | bounty started | Noah Schweber | ||
| S Sep 10, 2015 at 21:30 | history | notice added | Noah Schweber | Draw attention | |
| Sep 8, 2015 at 2:22 | comment | added | François G. Dorais | For the benefit of those who haven't read Blass's paper, he shows that the (1) every hyperarithmetic real is computable in every Hechler generic and (2) the only reals that are computable in every Hechler generic are the hyperarithmetic reals. | |
| Sep 8, 2015 at 2:12 | comment | added | François G. Dorais | Blass addresses a different question but the paper does have the right tools and references. What you're asking is significantly harder, as far as I know. Maybe you'll also need something like the Baumgartner-Dordal analysis of Hechler forcing to get the right density arguments. | |
| Sep 8, 2015 at 2:04 | comment | added | Noah Schweber | I've read that paper - I don't immediately see how it addresses the question? (I'm probably missing something obvious.) | |
| Sep 8, 2015 at 2:02 | comment | added | François G. Dorais | This is not easy to work through. You need some classic results of Solovay and Jockusch on "introreducibility". See Andreas Blass's paper Needed Reals and Recursion in Generic Reals [APAL 109 (2001), 77-88]. | |
| Sep 8, 2015 at 1:35 | history | asked | Noah Schweber | CC BY-SA 3.0 |