Correction to the paper: A new look at pointfree metrization theorems
Correction to the paper “Selfduality of the system of intervals of a partially ordered set”
Corrections à l'article "ordres C.A.C.", Fundamenta Mathematicae 79 (1973), pp. 11-22
Corrigendum: A completion for partially ordered abelian groups.
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 energy of posets and its bounds
The concept of covering energy of a poset is known and its McClelland type bounds are available in the literature. In this paper, we establish formulas for the covering energy of a crown with elements and a fence with elements. A lower bound for the largest eigenvalue of a poset is established. Using this lower bound, we improve the McClelland type bounds for the covering energy for some special classes of posets.
Covering graphs and subdirect decompositions of partially ordered sets
Coverings in the lattice of quasivarieties of -groups.