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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

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

The model theory of finitely generated finite-by-Abelian groups.Francis Oger - 1984 - Journal of Symbolic Logic 49 (4):1115-1124.
The order indiscernibles of divisible ordered Abelian groups.David Rosenthal - 1984 - Journal of Symbolic Logic 49 (1):151-160.
Some model theory of Abelian groups.Paul C. Eklof - 1972 - Journal of Symbolic Logic 37 (2):335-342.
Semi-Bounded Relations in Ordered Modules.Oleg Belegradek - 2004 - Journal of Symbolic Logic 69 (2):499 - 517.
Quasi-o-minimal structures.Oleg Belegradek, Ya'acov Peterzil & Frank Wagner - 2000 - Journal of Symbolic Logic 65 (3):1115-1132.

Analytics

Added to PP
2010-08-24

Downloads
13 (#1,006,512)

6 months
6 (#522,885)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations