Skip to main content
SpringerLink
Log in

Complete systems of monadic predicates for post classes

  • Published:
Moscow University Mathematics Bulletin Aims and scope

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Summary of O. B. Lupanov’s Lectures “Introduction to Mathematical Logic,” Ed. by A. B. Ugol’nikov (Moscow State Univ., Moscow, 2007) [in Russian].

  2. A. B. Ugol’nikov, Post Classes (Moscow State Univ., Moscow, 2008) [in Russian].

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Moscow State University, Faculty of Mechanics and Mathematics, Leninskie Gory, Moscow, 119991, Russia

    S. V. Bykovskaya

Authors
  1. S. V. Bykovskaya
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. V. Bykovskaya.

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

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0027132216040057

Search

Navigation