Free, iteratively closed categories of complete lattices
Free -groups and free products of -groups
In this paper we have given the construction of free -groups generated by a po-group and the construction of free products in any sub-product class of -groups. We have proved that the -free products satisfy the weak subalgebra property.
Free lattices over halflattices
Free -products of lattices. I
Free -products of lattices. II
Free products and elementary types of Boolean Algebras.
Free products in varieties of lattice-ordered groups
Free products of abelian -groups
Free products of lattices
Free -distributive lattice over an -element chain.
Free Suslin algebras
Free trees and the optimal bound in Wehrung's theorem
We prove that there is a distributive (∨,0,1)-semilattice of size ℵ₂ such that there is no weakly distributive (∨,0)-homomorphism from to with 1 in its range, for any algebra A with either a congruence-compatible structure of a (∨,1)-semi-lattice or a congruence-compatible structure of a lattice. In particular, is not isomorphic to the (∨,0)-semilattice of compact congruences of any lattice. This improves Wehrung’s solution of Dilworth’s Congruence Lattice Problem, by giving the best cardinality...
Freely adjoining a complement to a lattice
Frequency estimates for linear extension majority cycles on partial orders
Frolik's theorem for basically disconnected spaces
From well-quasi-ordered sets to better-quasi-ordered sets.
Full embeddings into the categories of Boolean algebras
Full embeddings with a given restriction
Function classes and relational constraints stable under compositions with clones
The general Galois theory for functions and relational constraints over arbitrary sets described in the authors' previous paper is refined by imposing algebraic conditions on relations.
Function minimum associated to a congruence on integral n-tuple space.