Name
Title | ||
|---|---|---|
On Decidable Extensions of Presburger Arithmetic: From A. Bertrand Numeration Systems to Pisot Numbers |
Abstract | ||
|---|---|---|
We study extensions of Presburger arithmetic with a unary predicate R and we show that under certain conditions on R, R is sparse (a notion introduced by A. L. Semenov) and the theory of [N. +, R] is decidable. We axiomatize this theory and we show that in a reasonable language, it admits quantifier elimination. We obtain similar results for the structure [Q, + R]. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.2307/2586704 | JOURNAL OF SYMBOLIC LOGIC |
DocType | Volume | Issue |
Journal | 65 | 3 |
ISSN | Citations | PageRank |
0022-4812 | 3 | 0.44 |
References | Authors | |
2 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Françoise Point | 1 | 21 | 10.04 |