Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2410.06822 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914968357568512 |
|---|---|
| author | Choffrut, Christian |
| author_facet | Choffrut, Christian |
| contents | This work was presented in June 5-7, 2017 at the conference "Journées sur les Arithmétiques Faibles -- Weak Arithmetics Days" held in Saint-Pertersburg of which no proceeding was ever published. It was not a new result but showed that a different approach is possible. The paper presented at ICALP 2024 addresses, among other problems, the complexity issues which were ignored in my 2017 talk. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_06822 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Unary counting quantifiers do not increase the expressive power of Presburger aritmetic: an alternative shorter proof Choffrut, Christian Logic in Computer Science This work was presented in June 5-7, 2017 at the conference "Journées sur les Arithmétiques Faibles -- Weak Arithmetics Days" held in Saint-Pertersburg of which no proceeding was ever published. It was not a new result but showed that a different approach is possible. The paper presented at ICALP 2024 addresses, among other problems, the complexity issues which were ignored in my 2017 talk. |
| title | Unary counting quantifiers do not increase the expressive power of Presburger aritmetic: an alternative shorter proof |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2410.06822 |