References
A. Robinson,E. Zakon, Elementary properties of ordered abelian groups, Trans. AMS 96 (1960), 222–236.
M.J. Fischer, M.O. Rabin, Super-exponential complexity of Presburger arithmetic, SIAM-AMS Proc. vol. 7 (1974), 27–41.
J. Ferrante, Ch. Rackoff, A decision procedure for the first-order theory of real addition with order, SIAM J. of Comp. 4(1975), 69–77.
L.Berman, Precise bounds for Presburger arithmetic and the reals with addition (prelim. report) Proc. 18. IEEE Symp. Found.Comp. Sci. (1977), 95–99.
V. Weispfenning, Elimination of quantifiers for certain ordered and lattice-ordered abelian groups, Bull. Soc.Math.Belg. 33 (1981), 131–156.
—"—, The complexity of linear problems in fields, submitted.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weispfenning, V. (1985). The complexity of elementary problems in archimedean ordered groups. In: Caviness, B.F. (eds) EUROCAL '85. EUROCAL 1985. Lecture Notes in Computer Science, vol 204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15984-3_241
Download citation
DOI: https://doi.org/10.1007/3-540-15984-3_241
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15984-1
Online ISBN: 978-3-540-39685-7
eBook Packages: Springer Book Archive