On the expansion (n, +, 2x) of Presburger arithmetic

Abstract

oris, 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, +, 2x) is decidable and admits quantifier elimination in an expansion of the language containing the Presburger..

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,672

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Analytics

Added to PP
2009-01-28

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references