Corrigendum à l'article "Sur la construction de certaines MS-algèbres" (Port. Math., 39(1-4) (1980), 489-496)
Corrigendum and addendum to the paper "Generating subsets of distributive lattices".
Corrigendum to "Perfect semilattices".
Countable 1-transitive coloured linear orderings II
This paper gives a structure theorem for the class of countable 1-transitive coloured linear orderings for a countably infinite colour set, concluding the work begun in [1]. There we gave a complete classification of these orders for finite colour sets, of which there are ℵ₁. For infinite colour sets, the details are considerably more complicated, but many features from [1] occur here too, in more marked form, principally the use (now essential it seems) of coding trees, as a means of describing...
Countable chains of distributive lattices as maximal semilattice quotients of positive cones of dimension groups
We construct a countable chain of Boolean semilattices, with all inclusion maps preserving the join and the bounds, whose union cannot be represented as the maximal semilattice quotient of the positive cone of any dimension group. We also construct a similar example with a countable chain of strongly distributive bounded semilattices. This solves a problem of F. Wehrung.
Countable homogeneous coloured partial orders [Book]
Counterexamples in minimally generated Boolean algebras
Counterexamples to the Neggers-Stanley conjecture.
Counting biorders.
Counting transitive relations.
Counting unlabelled topologies and transitive relations.
Covariant presheaves and subalgebras.
Covering condition in the lattice of radical classes of linearly ordered groups
Covering graphs and subdirect decompositions of partially ordered sets
Coverings in the lattice of quasivarieties of -groups.
Covers in the lattice of varieties of -groups.
Coxeter classes of unitary reflection groups.
Coxeter-like complexes.
Cubical convex ear decompositions.
Cuts in cyclically ordered sets