Some properties of P-sets of partly-deterministic functions / A. A. Rodin. // Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika. 2013. № 1. P. 51-53 [Moscow Univ. Math. Bulletin. Vol. 72, N 2, 2017. P. 0].

Classes of deterministic finite functions are considered in the paper and each state of those functions realizes a function from some closed class D of k-valued logic (P-sets). It is proved that there exists continuum of precomplete classes C containing an arbitrary P-set. The problem of existence of a completeness criterion for systems containing P-sets is also considered.

Key words: automata mappings, precomplete class, k-valued logic, completeness criterion.

№ 1/2013