Advertisement

The complexity of elementary problems in archimedean ordered groups

  • Volker Weispfenning
Automated Theorem Proving
Part of the Lecture Notes in Computer Science book series (LNCS, volume 204)

Keywords

Abelian Group Polynomial Time Decision Problem Exponential Time Elementary Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. A. Robinson,E. Zakon, Elementary properties of ordered abelian groups, Trans. AMS 96 (1960), 222–236.Google Scholar
  2. M.J. Fischer, M.O. Rabin, Super-exponential complexity of Presburger arithmetic, SIAM-AMS Proc. vol. 7 (1974), 27–41.Google Scholar
  3. 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.Google Scholar
  4. L.Berman, Precise bounds for Presburger arithmetic and the reals with addition (prelim. report) Proc. 18. IEEE Symp. Found.Comp. Sci. (1977), 95–99.Google Scholar
  5. V. Weispfenning, Elimination of quantifiers for certain ordered and lattice-ordered abelian groups, Bull. Soc.Math.Belg. 33 (1981), 131–156.Google Scholar
  6. —"—, The complexity of linear problems in fields, submitted.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Volker Weispfenning
    • 1
  1. 1.Department of MathematicsYale UniversityNew HavenUSA

Personalised recommendations