Complete systems of monadic predicates for Post classes
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 4 (2016), pp. 33-38
Cet article a éte moissonné depuis la source Math-Net.Ru
The problem of completeness of arbitrary systems of monadic predicates defined on finite sets is considered. Completeness criteria are obtained for an arbitrary system of monadic predicates over arbitrary set of Boolean functions.
@article{VMUMM_2016_4_a4,
author = {S. V. Bykovskaya},
title = {Complete systems of monadic predicates for {Post} classes},
journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
pages = {33--38},
year = {2016},
number = {4},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/VMUMM_2016_4_a4/}
}
S. V. Bykovskaya. Complete systems of monadic predicates for Post classes. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 4 (2016), pp. 33-38. http://geodesic.mathdoc.fr/item/VMUMM_2016_4_a4/
[1] A. B. Ugolnikov (otv. red.), Konspekt lektsii O. B. Lupanova po kursu “Vvedenie v matematicheskuyu logiku”, Izd-vo TsPI pri mekh-mat. f-te MGU, M., 2007
[2] Ugolnikov A.B., Klassy Posta, Izd-vo TsPI pri mekh-mat. f-te MGU, M., 2008