Timeline for Decidable theorem or result that is not weaker than Tarski's theorem
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 6, 2017 at 22:02 | vote | accept | XL _At_Here_There | ||
| Nov 26, 2014 at 1:29 | comment | added | XL _At_Here_There | @EmilJeřábek, you are so severe on any questions, like an excellent judge in supremcourt. But let us list the decidable result near or above any theorems relating Tarski. | |
| Nov 25, 2014 at 14:40 | answer | added | David E Speyer | timeline score: 1 | |
| Nov 25, 2014 at 12:12 | comment | added | Emil Jeřábek | Tarski has many results on decidability. The whole Tarski-Mostowski-Robinson monograph is devoted to undecidability of theories. | |
| Nov 25, 2014 at 11:46 | comment | added | Wojowu | One theorem of his shows that theory of real ordered fields is decidable, another says so about his axiomatization of Euclidean geometry. Tarski's undefinability theorem can also be thought as concerning decidability (there is no predicate which "decides" truth of statements). | |
| Nov 25, 2014 at 11:40 | comment | added | XL _At_Here_There | @Wojowu, thank you for your comments, which one of his theorems is about decidability? | |
| Nov 25, 2014 at 11:26 | comment | added | Wojowu | Which Tarski's theorem do you have in mind? I think he had few... | |
| Nov 25, 2014 at 11:21 | history | asked | XL _At_Here_There | CC BY-SA 3.0 |