Bounded countable atomic compactness of ordered groups
Friedrich Wehrung (1995)
Fundamenta Mathematicae
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Friedrich Wehrung (1995)
Fundamenta Mathematicae
Similarity:
Roman Kossak, Henryk Kotlarski (1996)
Fundamenta Mathematicae
Similarity:
Continuing the earlier research in [10] we give some information on extending automorphisms of models of PA to end extensions and cofinal extensions.
Dirk Hachenberger (2000)
Acta Arithmetica
Similarity:
Uri Abraham, Robert Bonnet (1999)
Fundamenta Mathematicae
Similarity:
Hausdorff characterized the class of scattered linear orderings as the least family of linear orderings that includes the ordinals and is closed under ordinal summations and inversions. We formulate and prove a corresponding characterization of the class of scattered partial orderings that satisfy the finite antichain condition (FAC). Consider the least class of partial orderings containing the class of well-founded orderings that satisfy the FAC and is closed under the following operations:...
Peter Stevenhagen (1996)
Acta Arithmetica
Similarity:
C. Gryllakis, S. Grekas (1999)
Fundamenta Mathematicae
Similarity:
Let with card Γ ≥ c (c denotes the continuum). We construct two Radon measures μ,ν on X such that there exist open subsets of X × X which are not measurable for the simple outer product measure. Moreover, these measures are strikingly similar to the Lebesgue product measure: for every finite F ⊆ Γ, the projections of μ and ν onto are equivalent to the F-dimensional Lebesgue measure. We generalize this construction to any compact group of weight ≥ c, by replacing the Lebesgue product...
Ireneusz Recław (1994)
Fundamenta Mathematicae
Similarity:
We show that some classes of small sets are topological versions of some combinatorial properties. We also give a characterization of spaces for which White has a winning strategy in the point-open game. We show that every Lusin set is undetermined, which solves a problem of Galvin.
Yuri Bilu, Guillaume Hanrot (1999)
Acta Arithmetica
Similarity: