O-stable ordered groups

2012

Closed access Metadata (CSL-JSON)
DOI 10.3103/s105513441201004x
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

An ordered structure M is said to be o-λ-stable if, for every A ⊆ M with | A | ≤ λ and every cut in M , at most λ 1-types over A are consistent with the cut. In the present article, we prove that every o-stable group is abelian. We also study definable subsets and unary functions of o-stable groups.