Timeline for Is the field of constructible numbers known to be decidable?
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Jul 15 at 15:08 | vote | accept | Colin McLarty | ||
| Jul 4 at 5:11 | history | edited | David Roberts♦ | CC BY-SA 4.0 |
doi link; formatting
|
| Jul 4 at 0:01 | answer | added | GuestPoster5678 | timeline score: 29 | |
| Sep 14, 2018 at 11:47 | comment | added | Emil Jeřábek | A relevant result: the compositum of all quadratic extensions of $\mathbb Q$ is undecidable arxiv.org/abs/1809.04670 | |
| Sep 19, 2013 at 7:57 | answer | added | Marvin Jay Greenberg | timeline score: 14 | |
| Sep 18, 2013 at 17:31 | answer | added | Carlos R. Videla | timeline score: 37 | |
| Sep 18, 2013 at 14:15 | vote | accept | Colin McLarty | ||
| S Jul 15 at 15:08 | |||||
| Sep 18, 2013 at 14:03 | comment | added | Pasten | Write to Videla and ask him. He surely knows the state of the art and he will be happy to answer; he is a very nice person. As I understand, the problem is open and there is a group of people (including Videla) looking into it. | |
| Sep 17, 2013 at 13:33 | answer | added | shahram | timeline score: 27 | |
| Sep 17, 2013 at 13:27 | history | edited | Colin McLarty | CC BY-SA 3.0 |
Added clarification on Tarski's general conjecture on decidable fields.
|
| Sep 17, 2013 at 12:52 | history | asked | Colin McLarty | CC BY-SA 3.0 |