The Complexity of Bounded Quantifiers in Some Ordered Abelian Groups

Notre Dame Journal of Formal Logic 48 (4):521-550 (2007)
  Copy   BIBTEX

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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,795

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Elementary Equivalence for Abelian-by-Finite and Nilpotent Groups.Francis Oger - 2001 - Journal of Symbolic Logic 66 (3):1471-1480.
Elimination of algorithmic quantifiers for ordered differential algebra.Yunfu Shen - 1999 - Archive for Mathematical Logic 38 (3):139-144.
Decidability Results for Classes of Ordered Abelian Groups in Logics with Ramsey-Quantifiers.Wolfgang Lenski - 1995 - In Michał Krynicki, Marcin Mostowski & Lesław W. Szczerba (eds.), Quantifiers: Logics, Models and Computation: Volume Two: Contributions. Dordrecht, Netherland: Kluwer Academic Publishers. pp. 139--168.
l -Groups C in continuous logic.Philip Scowcroft - 2018 - Archive for Mathematical Logic 57 (3-4):239-272.
Arity and alternation in second-order logic.J. A. Makowsky & Y. B. Pnueli - 1994 - Annals of Pure and Applied Logic 78 (1-3):189-202.
Quantifier elimination for neocompact sets.H. Keisler - 1998 - Journal of Symbolic Logic 63 (4):1442-1472.

Analytics

Added to PP
2010-08-24

Downloads
22 (#982,541)

6 months
6 (#891,985)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations