Timeline for The topos for forcing in computability theory
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 31, 2017 at 14:18 | comment | added | Ingo Blechschmidt | Have you, since asking the question two years ago, learned about a topos-theoretic treatment of forcing in computability theory? | |
| Feb 6, 2015 at 14:38 | comment | added | Jason Rute | @BjørnKjos-Hanssen, I would be happy to know the answer in that case. (The application I have in mind is a bit more general, but I think knowing what is going on in the case of a computable forcing poset is sufficient for me to get a general idea of what is going on.) | |
| Feb 6, 2015 at 9:20 | comment | added | Bjørn Kjos-Hanssen | Did you also want the forcing partial order to be a (close to) computable relation? | |
| Feb 6, 2015 at 4:06 | history | edited | Jason Rute | CC BY-SA 3.0 |
Added "proof theory" in solidarity to my advisor.
|
| Feb 6, 2015 at 3:55 | history | asked | Jason Rute | CC BY-SA 3.0 |