The Complexity of Bounded Quantifiers in Some Ordered Abelian Groups
Philip Scowcroft · Notre Dame Journal of Formal Logic · 2007
This paper obtains lower and upper bounds for the number of alternations of bounded quantifiers needed to express all formulas in certain ordered Abelian groups admitting elimination of unbounded quantifiers. The paper also establishes model-theoretic tests for equivalence to a formula with a given number of alternations of bounded quantifiers.