Complete systems of monadic predicates for post classes
- Authors: Bykovskaya S.V.1
-
Affiliations:
- Moscow State University
- Issue: Vol 71, No 4 (2016)
- Pages: 161-165
- Section: Article
- URL: https://journal-vniispk.ru/0027-1322/article/view/164363
- DOI: https://doi.org/10.3103/S0027132216040057
- ID: 164363
Cite item
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.
About the authors
S. V. Bykovskaya
Moscow State University
Author for correspondence.
Email: bykovskaya.svetlana@gmail.com
Russian Federation, Leninskie Gory, Moscow, 119991
Supplementary files
