equivalence between countable and uncountable linear orderings
A 1984 problem of S. Z. Ditor asks whether there exists a lattice of cardinality ℵ₂, with zero, in which every principal ideal is finite and every element has at most three lower covers. We prove that the existence of such a lattice follows from either one of two axioms that are known to be independent of ZFC, namely (1) Martin’s Axiom restricted to collections of ℵ₁ dense subsets in posets of precaliber ℵ₁, (2) the existence of a gap-1 morass. In particular, the existence of such a lattice is consistent...
We consider general properties of lattices of relative colour-families and antivarieties. Several results generalise the corresponding assertions about colour-families of undirected loopless graphs, see [1]. Conditions are indicated under which relative colour-families form a lattice. We prove that such a lattice is distributive. In the class of lattices of antivarieties of relation structures of finite signature, we distinguish the most complicated (universal) objects. Meet decompositions in lattices...
We show that a natural quotient of the projective Fraïssé limit of a family that consists of finite rooted trees is the Lelek fan. Using this construction, we study properties of the Lelek fan and of its homeomorphism group. We show that the Lelek fan is projectively universal and projectively ultrahomogeneous in the class of smooth fans. We further show that the homeomorphism group of the Lelek fan is totally disconnected, generated by every neighbourhood of the identity, has a dense conjugacy...
We introduce the notion of leveled structure and show that every structure elementarily equivalent to the real expo field expanded by all restricted analytic functions is leveled.
We describe finitely generated groups universally equivalent (with constants from in the language) to a given torsion-free relatively hyperbolic group with free abelian parabolics. It turns out that, as in the free group case, the group embeds into the Lyndon’s completion of the group , or, equivalently, embeds into a group obtained from by finitely many extensions of centralizers. Conversely, every subgroup of containing is universally equivalent to . Since finitely generated...
We find the basis of all linear identities which are true in the variety of entropic graph algebras. We apply it to describe the lattice of all subvarieties of power entropic graph algebras.