Timeline for Does higher order arithmetic interpret the axiom of choice?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 9 at 18:19 | comment | added | plm | Thank you. Im not sure with the sub/superscripts, does this imply countable AC, thus the Rasiowa-Sikorski lemma ? If so does how does that relate to forcing proofs relying on this lemma ? It is often claimed that forcing can be carried out in weak theories of arithmetic, but it seems to me that that is only true for formal presentations of those proofs: we prove something like "a forcing proof of independence of CH from ZFC can be described in arithmetic by predicates on Gödel numbers of set theory formulas" - any universal theory should do. Actual forcing requires a set theory with infinity. | |
| S Jul 2, 2013 at 22:50 | history | suggested | jeq | CC BY-SA 3.0 |
Removed three back-ticks which seemed to spoil rendering
|
| Jul 2, 2013 at 22:19 | review | Suggested edits | |||
| S Jul 2, 2013 at 22:50 | |||||
| Aug 3, 2012 at 23:57 | vote | accept | Colin McLarty | ||
| Aug 3, 2012 at 3:49 | history | answered | Carl Mummert | CC BY-SA 3.0 |