I proved true the following conjecture: Theorem $latex \mathrm{Compl} \, \mathrm{CoCompl}\, f = \mathrm{CoCompl}\, \mathrm{Compl}\, f = \mathrm{Cor}\, f$ for every reloid $latex f$. See here for definitions and proofs.

read moreI generalized a theorem in the preprint article “Filters on posets and generalizations” on my Algebraic General Topology site. The new theorem is formulated as following: Theorem If $latex (\mathfrak{A}; \mathfrak{Z})$ is a join-closed filtrator and $latex \mathfrak{A}$ is a meet-semilattice and…

read moreI updated online article “Funcoids and Reloids”. The main feature of this update is new section about complete reloids and completion of reloids (with a bunch of new open problems). Also added some new theorems in the section “Completion of funcoids”.

read moreI updated the online article “Funcoids and Reloids”. The main feature of this update is introduction of the concepts completion and co-completion of funcoids and some related theorems. The question whether meet (on the lattice of funcoids) of two discrete funcoids is…

read more