Abstract
A constructive procedure using Dines—Fourier—Motzkin elimination is given for eliminating quantifiers in a linear first order formula over ordered fields. An ensuing transfer principle is illustrated by showing that a locally one-to-one affine map is globally one-to-one and onto all over ordered fields.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. Artin and H. Braun,Introduction to Algebraic Topology (Merrill, Columbus, OH, 1969).
G.B. Dantzig,Linear Programming and Extensions (Princeton University Press, Princeton, NJ, 1963).
L.L. Dines, “Systems of linear inequalities,”Annals of Mathematics 20 (1918–1919) 191–199.
B.C. Eaves and U.G. Rothblum, “Invariant polynomial curves for piecewise linear maps,”SIAM Journal on Control and Optimization 26 (1987) 401–409.
B.C. Eaves and U.G. Rothblum, “A theory on extending algorithms for parametric problems,”Mathematics of Operations Research 14 (1989) 502–533.
B.C. Eaves and U.G. Rothblum, “Relationships of properties of piecewise affine maps over ordered fields,”Linear Algebra and its Applications 132 (1990) 1–63.
H.B. Enderton,A Mathematical Introduction to Logic (Academic Press, New York and London, 1970).
J.-B.J. Fourier, “Solution d'une question particulière du calcul des inégalités,”Oeuvres II (1826) 317–328.
D.Yu. Grigor'ev, “Computational complexity in polynomial algebra,”Proceedings of the International Congress of Mathematicians (1986).
N. Jacobson,Lectures in Abstract Algebra III (Van Nostrand, Princeton, NJ, 1964).
N. Karmarkar, “A new polynomial-time algorithm for linear programming,”Proceedings of the 16th ACM Symposium on Theory of Computing (1984) 302–311.
L.G. Khachian, “A polynomial algorithm in linear programming,”Soviet Mathematics Doklady 20 (1979) 191–194.
E. Kohlberg, “Invariant half-lines of nonexpansive piecewise linear transformations,”Mathematics of Operations Research 5 (1980) 366–372.
T. Motzkin,Beiträge zur Theorie der linearen Ungleichungen (Azriel, Jerusalem, 1936).
J.M. Ortega and W.C. Rheinbolt,Iterative Solution of Nonlinear Equations with Several Variables (Academic Press, New York and London, 1970).
A. Seidenberg, “A new decision method for elementary algebra,”Annals of Mathematics 60 (1954) 365–374.
A. Tarski,A Decision Method for Elementary Algebra and Geometry (University of California Press, Berkeley and Los Angeles, CA, 1951, 2nd ed.).
L. Van den Dries, “Quantifier elimination for linear formulas over ordered and valued fields,”Bulletin de la Société Mathématique de Belgique Série B 33 (1981) 19–32.
V. Weispfenning, “The complexity of linear problems in fields,”Journal of Symbolic Computation 5 (1988) 3–27.
Author information
Authors and Affiliations
Additional information
This research is based on work supported in part by the National Science Foundation under Grant DMS-86-03232, by the Department of Energy grant DE-FG03-87ER25028 and by the United States-Israel Binational Science Foundation Grant 85-00295.
Rights and permissions
About this article
Cite this article
Eaves, B.C., Rothblum, U.G. Dines—Fourier—Motzkin quantifier elimination and an application of corresponding transfer principles over ordered fields. Mathematical Programming 53, 307–321 (1992). https://doi.org/10.1007/BF01585709
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01585709