Abstract
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 PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Summary of O. B. Lupanov’s Lectures “Introduction to Mathematical Logic,” Ed. by A. B. Ugol’nikov (Moscow State Univ., Moscow, 2007) [in Russian].
A. B. Ugol’nikov, Post Classes (Moscow State Univ., Moscow, 2008) [in Russian].
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © S.V. Bykovskaya, 2016, published in Vestnik Moskovskogo Universiteta, Matematika. Mekhanika, 2016, Vol. 71, No. 4, pp. 33–38.
About this article
Cite this article
Bykovskaya, S.V. Complete systems of monadic predicates for post classes. Moscow Univ. Math. Bull. 71, 161–165 (2016). https://doi.org/10.3103/S0027132216040057
Received:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0027132216040057