Translator Disclaimer
2007 The Complexity of Bounded Quantifiers in Some Ordered Abelian Groups
Philip Scowcroft
Notre Dame J. Formal Logic 48(4): 521-550 (2007). DOI: 10.1305/ndjfl/1193667710

Abstract

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.

Citation

Download Citation

Philip Scowcroft. "The Complexity of Bounded Quantifiers in Some Ordered Abelian Groups." Notre Dame J. Formal Logic 48 (4) 521 - 550, 2007. https://doi.org/10.1305/ndjfl/1193667710

Information

Published: 2007
First available in Project Euclid: 29 October 2007

zbMATH: 1137.03021
MathSciNet: MR2357527
Digital Object Identifier: 10.1305/ndjfl/1193667710

Subjects:
Primary: 03C64
Secondary: 06F20

Rights: Copyright © 2007 University of Notre Dame

JOURNAL ARTICLE
30 PAGES


SHARE
Vol.48 • No. 4 • 2007
Back to Top