Complete systems of monadic predicates for post classes


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

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

Supplementary Files
Action
1. JATS XML

Copyright (c) 2016 Allerton Press, Inc.