Semi-Bounded Relations in Ordered Modules

Journal of Symbolic Logic 69 (2):499 - 517 (2004)
  Copy   BIBTEX

Abstract

A relation on a linearly ordered structure is called semi-bounded if it is definable in an expansion of the structure by bounded relations. We study ultimate behavior of semi-bounded relations in an ordered module M over an ordered commutative ring R such that M/rM is finite for all nonzero r $\epsilon$ R. We consider M as a structure in the language of ordered R-modules augmented by relation symbols for the submodules rM, and prove several quantifier elimination results for semi-bounded relations and functions in M. We show that these quantifier elimination results essentially characterize the ordered modules M with finite indices of the submodules rM. It is proven that (1) any semi-bounded k-ary relation on M is equal, outside a finite union of k-strips, to a k-ary relation quantifier-free definable in M, (2) any semibounded function from $M^{k}$ to M is equal, outside a finite union of k-strips, to a piecewise linear function, and (3) any semi-bounded in M endomorphism of the additive group of M is of the form x $\mapsto \sigmax$ , for some $\mapsto \sigma$ from the field of fractions of R

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,593

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

Semi-post algebras.Nguyen Cat Ho & Helena Rasiowa - 1987 - Studia Logica 46 (2):149 - 160.
Quasi-o-minimal structures.Oleg Belegradek, Ya'acov Peterzil & Frank Wagner - 2000 - Journal of Symbolic Logic 65 (3):1115-1132.
A maximal bounded forcing axiom.David Asperó - 2002 - Journal of Symbolic Logic 67 (1):130-142.
Two variable first-order logic over ordered domains.Martin Otto - 2001 - Journal of Symbolic Logic 66 (2):685-702.
Noetherian varieties in definably complete structures.Tamara Servi - 2008 - Logic and Analysis 1 (3-4):187-204.
Projective Well-Orderings and Bounded Forcing Axioms.Andrés Eduardo Caicedo - 2005 - Journal of Symbolic Logic 70 (2):557 - 572.
Returning to semi-bounded sets.Ya'Acov Peterzil - 2009 - Journal of Symbolic Logic 74 (2):597-617.

Analytics

Added to PP
2010-08-24

Downloads
38 (#365,484)

6 months
1 (#1,040,386)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Coset-minimal groups.Oleg Belegradek, Viktor Verbovskiy & Frank O. Wagner - 2003 - Annals of Pure and Applied Logic 121 (2-3):113-143.

Add more references