UNIVERSAL POSITIVE PREORDERS
S. A. Badaev, B. S. Kalmurzayev, Kabilzhanova D.K., Kuanysh Abeshev · 2018
In this paper, we investigate universal objects in the class of positive preorders with respect to computable reducibility, we constructed a computable numbering of this class and proved theorems on the existence of a universal positive lattice and a universal weakly precomplete.