Timeline for Can Vopenka's principle be violated definably?
Current License: CC BY-SA 2.5
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 19, 2010 at 16:57 | vote | accept | Mike Shulman | ||
| Nov 18, 2010 at 20:52 | answer | added | Joel David Hamkins | timeline score: 21 | |
| Nov 11, 2010 at 3:47 | comment | added | Mike Shulman | Partially, I think. I am also curious whether there is a single specific definable class that always violates Vopenka if anything does, in the same way that there is a single explicitly definable algorithm which solves SAT in polynomial time if anything does. | |
| Nov 11, 2010 at 0:56 | comment | added | Joel David Hamkins | In the set-theoretic terminology, are you asking whether Vopenka can fail in a GBC model, without failing for any definable class? | |
| Nov 10, 2010 at 21:14 | history | asked | Mike Shulman | CC BY-SA 2.5 |