Corpus ID: 10420888

ON THE EXPANSION (N,+, 2) OF PRESBURGER ARITHMETIC

@inproceedings{Rabin2007ONTE,
  title={ON THE EXPANSION (N,+, 2) OF PRESBURGER ARITHMETIC},
  author={M. Rabin},
  year={2007}
}
This is based on a preprint ([9]) which appeared in the Proceedings of the fourth Easter Conference on model theory, Gross Köris, 1986, 17-34, Seminarberichte 86, Humboldt University, Berlin, where, with G. Cherlin, we gave a detailed proof of a result of Alexei L. Semenov that the theory of (N,+, 2) is decidable and admits quantifier elimination in an expansion of the language containing the Presburger congruence predicates and a logarithmic function. Expansions of Presburger arithmetic have… Expand
Modulo quantifiers over functional vocabularies extending addition

References

SHOWING 1-10 OF 40 REFERENCES
The definable criterion for definability in Presburger arithmetic and its applications
  • A. Muchnik
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 2003
Presburger Arithmetic and Recognizability of Sets of Natural Numbers by Automata: New Proofs of Cobham's and Semenov's Theorems
The Theory of (N, +, Vk, V1) is Undecidable
Decidability and Undecidability of Theories with a Predicate for the Primes
Quantifier elimination for the reals with a predicate for the powers of two
On decidable extensions of Presburger arithmetic: from A. Bertrand numeration sytems to Pisot numbers
Undecidable Extensions of Büchi Arithmetic and Cobham-Semënov Theorem
  • A. Bès
  • Mathematics, Computer Science
  • J. Symb. Log.
  • 1997
LOGIC AND p-RECOGNIZABLE SETS OF INTEGERS
...
1
2
3
4
...