Timeline for Are computable models sufficient?
Current License: CC BY-SA 2.5
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 22 at 17:55 | comment | added | The Amplitwist | Reposting the link mentioned in a previous comment so that it appears in the "Linked" questions list: Is there a computable model of ZFC? | |
| Aug 2, 2010 at 20:54 | answer | added | Kaveh | timeline score: 7 | |
| Aug 2, 2010 at 16:59 | vote | accept | Sergei Tropanets | ||
| Aug 2, 2010 at 15:57 | comment | added | Carl Mummert | I think I answered this in the question below. If I didn't, could you clarify the question? | |
| Aug 2, 2010 at 12:24 | comment | added | Sergei Tropanets | As Carl Mummert points out in the answer below the first part of a question is <<about all countable models in the language of particular formula, rather than all models of a particular theory.>> So, more generally, is there a first-order theory which is true in all computable structures and false in some (all) uncomputable? Can it be finite or infinite? | |
| Aug 2, 2010 at 12:07 | comment | added | Sergei Tropanets | Thanks, it partially answers. ZFC is infinite theory, but what about one sentence? | |
| Aug 2, 2010 at 11:51 | answer | added | Carl Mummert | timeline score: 10 | |
| Aug 2, 2010 at 11:12 | comment | added | Carsten S | MO points out mathoverflow.net/questions/12426/… as related. Does this already answer your question? | |
| Aug 2, 2010 at 10:49 | history | edited | Sergei Tropanets | CC BY-SA 2.5 |
added 96 characters in body; added 11 characters in body
|
| Aug 2, 2010 at 10:41 | history | asked | Sergei Tropanets | CC BY-SA 2.5 |