On central relations of complete lattices
We describe -sets whose congruences satisfy some natural lattice or multiplicative restrictions. In particular, we determine -sets with distributive, arguesian, modular, upper or lower semimodular congruence lattice as well as congruence -permutable -sets for .
The aim of the present paper is to translate some algebraic concepts to hypergraphs. Thus we obtain a new language, very useful in the investigation of subalgebra lattices of partial, and also total, algebras. In this paper we solve three such problems on subalgebra lattices, other will be solved in [[Pio4]]. First, we show that for two arbitrary partial algebras, if their directed hypergraphs are isomorphic, then their weak, relative and strong subalgebra lattices are isomorphic. Secondly, we prove...