Timeline for Theorems in set theory that use computability theory tools, and vice versa
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 27, 2023 at 12:05 | answer | added | 喻 良 | timeline score: 4 | |
| Apr 26, 2023 at 3:14 | comment | added | 喻 良 | Groszek and Slaman's perfect set basis theorem is always my favorite example. See cambridge.org/core/journals/bulletin-of-symbolic-logic/article/… | |
| Apr 19, 2023 at 14:02 | vote | accept | Clement Yung | ||
| Apr 18, 2023 at 22:24 | answer | added | Peter Gerdes | timeline score: 5 | |
| Apr 18, 2023 at 20:34 | answer | added | Jason Zesheng Chen | timeline score: 8 | |
| Apr 18, 2023 at 13:44 | history | edited | gmvh | CC BY-SA 4.0 |
Added missing preposition
|
| Apr 18, 2023 at 9:59 | history | became hot network question | |||
| Apr 18, 2023 at 2:16 | answer | added | Joel David Hamkins | timeline score: 21 | |
| Apr 18, 2023 at 1:55 | history | asked | Clement Yung | CC BY-SA 4.0 |