Timeline for A subset of all languages which is uncountable?
Current License: CC BY-SA 2.5
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 30, 2010 at 8:48 | answer | added | none | timeline score: 0 | |
| Mar 5, 2010 at 16:22 | comment | added | Hans-Peter Stricker | May I point you to my humble questions concerning "naturality": mathoverflow.net/questions/14281/…, very much in the vein of your "remove a few"? | |
| Nov 3, 2009 at 13:29 | vote | accept | Rune | ||
| Nov 3, 2009 at 5:54 | answer | added | Greg Kuperberg | timeline score: 5 | |
| Nov 3, 2009 at 1:25 | vote | accept | Rune | ||
| Nov 3, 2009 at 13:29 | |||||
| Nov 3, 2009 at 1:25 | vote | accept | Rune | ||
| Nov 3, 2009 at 1:25 | |||||
| Nov 3, 2009 at 1:21 | comment | added | Rune | Yes, that is a good question. A natural language that isn't constructed for the purpose of making it uncountable. | |
| Nov 3, 2009 at 1:08 | comment | added | Harald Hanche-Olsen | There are many easy answers, as the answers coming in so far demonstrate. What is far harder, I think, is to come up with a set of languages that arises naturally and is uncountable for a nontrivial (and interesting!) reason. | |
| Nov 3, 2009 at 0:56 | answer | added | David E Speyer | timeline score: 3 | |
| Nov 3, 2009 at 0:51 | answer | added | Ori Gurel-Gurevich | timeline score: 1 | |
| Nov 3, 2009 at 0:34 | comment | added | Akhil Mathew | "Perhaps some set in the arithmetic hierarchy?" Wouldn't this be countable by what you just said about recursive languages? | |
| Nov 3, 2009 at 0:20 | history | asked | Rune | CC BY-SA 2.5 |