Amalgamating abelian ordered groups
نویسندگان
چکیده
منابع مشابه
Free abelian lattice-ordered groups
Let n be a positive integer and FA`(n) be the free abelian latticeordered group on n generators. We prove that FA`(m) and FA`(n) do not satisfy the same first-order sentences in the language L={+,−, 0,∧,∨} if m 6= n. We also show that Th(FA`(n)) is decidable iff n ∈ {1, 2}. Finally, we apply a similar analysis and get analogous results for the free finitely generated vector lattices. A. M. S. C...
متن کاملCharacterizing automorphism groups of ordered abelian groups
In this short note we want to characterize the groups isomorphic to full automorphism groups of ordered abelian groups. The result will follow from classical theorems on ordered groups adding an argument from proofs used to realize rings as endomorphism rings of abelian groups, see [2]. Recall that H is a right ordered group (RO-group) if (H, ·) is a group and (H,<) is a linear order satisfying...
متن کاملTopological Abelian Groups with Ordered Norms
The purpose of this paper is to study Abelian groups with a norm whose values are in another Abelian group having an order relation. Postulates on the ordering are given which are sufficient for the space to be a topological group under the neighborhood system of this norm. It is seen that the added assumption that the ordering is Archimedian implies the space is a subset of a normed linear spa...
متن کاملCompressions on Partially Ordered Abelian Groups
If A is a C*-algebra and p ∈ A is a self-adjoint idempotent, the mapping a 7→ pap is called a compression on A. We introduce effect-ordered rings as generalizations of unital C*-algebras and characterize compressions on these rings. The resulting characterization leads to a generalization of the notion of compression on partially ordered abelian groups with order units.
متن کاملThe computable dimension of ordered abelian groups
Let G be a computable ordered abelian group. We show that the computable dimension of G is either 1 or ω, that G is computably categorical if and only if it has finite rank, and that if G has only finitely many Archimedean classes, then G has a computable presentation which admits a computable basis.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1972
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1972.43.711