Timeline for Skolem's version of quantifier elimination for linear algebra over the integers
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 30, 2022 at 13:25 | vote | accept | user1868607 | ||
| Mar 30, 2022 at 13:13 | answer | added | Emil Jeřábek | timeline score: 5 | |
| Mar 30, 2022 at 12:50 | comment | added | user1868607 | I see @EmilJeřábek I overlooked then that that's equivalent to Presburger feel free to post it as an answer. | |
| Mar 30, 2022 at 12:48 | comment | added | Emil Jeřábek | My German is a bit rusty, but reviews of Skolem’s paper (Gödel, Ackermann) indicate that it does, indeed, prove quantifier elimination for Presburger arithmetic (albeit in a somewhat unusual language, including function symbols for multiplication by rational constants and $\lfloor x\rfloor$, so apparently the values of terms may be rationals, even though variables range over integers). | |
| Mar 30, 2022 at 10:51 | history | asked | user1868607 | CC BY-SA 4.0 |