Timeline for What are some important but still unsolved problems in mathematical logic?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 4 at 2:44 | comment | added | GuestPoster5678 | This was recently solved a couple of years ago by Mazur, Rubin, and Shlapentokh, and just published in Acta Arithmetica (see my answer at the link). | |
| Sep 12, 2018 at 21:53 | comment | added | Joel Adler | @EmilJerabek Thanks a lot for your comment, this settles my confusion. I thought it was about deciding whether there was an algorithm deciding the constructibility of a real number, which is decidable. | |
| Sep 12, 2018 at 8:59 | comment | added | Emil Jeřábek | @JoelAdler What do you mean? The problem asks if there exists an algorithm that can tell whether any given first-order sentence in the language of rings is true when interpreted in the field of all constructible numbers. It does not involve any specific real number. | |
| Sep 12, 2018 at 8:37 | comment | added | Joel Adler | I have an admittedly very naive question: How is the real number whose constructibility is of interest defined? | |
| Jun 15, 2017 at 6:26 | history | edited | Saeed Salehi | CC BY-SA 3.0 |
added 2 characters in body
|
| Jun 14, 2017 at 9:33 | review | Late answers | |||
| Jun 14, 2017 at 9:49 | |||||
| S Jun 14, 2017 at 9:16 | history | answered | Saeed Salehi | CC BY-SA 3.0 | |
| S Jun 14, 2017 at 9:16 | history | made wiki | Post Made Community Wiki by Saeed Salehi |