### Compl CoCompl f = CoCompl Compl f = Cor f

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.

### A theorem generalized

I 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…

### Funcoids and Reloids updated – complete reloids

I 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”.

### Funcoids and Reloids – completion

I 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…