Skip to main content
SpringerLink
Log in

Some Implicitly Precomplete Classes of Functions of Three-Valued Logic Preserving Subsets

  • Published:
Moscow University Mathematics Bulletin Aims and scope

Abstract

The problem of implicit expressibility in the three-valued logic P3 is considered. A set of implicitly maximal classes preserving two-element subsets is described.

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. A. V. Kuznetsov, “The Facilities to Detect Non-Deducibility and Non-Expressibility,” in Logical Deduction (Nauka, Moscow, 1979), pp. 5–33.

    Google Scholar 

  2. O. M. Kasim-Zade, “Implicit Expressibility in Two-Valued Logic and Crypto-Isomorphisms of Two-Element Algebras,” Doklady Russ. Akad. Nauk 348(3), 299 (1996) [Doklady Math. 53 (3), 366 (1996)].

    MathSciNet  MATH  Google Scholar 

  3. M. V. Starostin, “Implicitly Maximal Classes and Implicit Completeness Criterion in the Three-Valued Logic,” Vestn. Mosk. Univ., Matem. Mekhan., No. 2, 56 (2018).

    MathSciNet  MATH  Google Scholar 

  4. O. M. Kasim-Zade, “Implicit Completeness in the k-Valued Logic,” Vestn. Mosk. Univ., Matem. Mekhan., No. 3, 9 (2007) [Moscow Univ. Math. Bull. 62 (3), 90 (2007)].

    MATH  Google Scholar 

  5. E. A. Orekhova, “A Criterion for the Implicit Sheffer Property in Three-Valued Logic,” Diskretn. Anal. Issled. Oper. 10(3), 82 (2003).

    MathSciNet  MATH  Google Scholar 

  6. Yu. N. Tolstova, “Modelling of l-Valued Logic in k-Valued One (k > l),” in Problemy Kibernetiki, Issue 18 (Nauka, Moscow, 1967), pp. 67–82.

    Google Scholar 

  7. S. V. Yablonskii, “Functional Constructions in the k-Valued Logic,” in Collection of Articles in Mathematical Logic and its Applications to Some Problems of Cybernetics, Trudy Steklov. Matem. Inst. RAS 51, 5 (1958).

    MathSciNet  Google Scholar 

  8. G. N. Blokhina, “Predicate Description of Post Classes,” Diskret. Analiz, Issue 16 (Novosibirsk, 1970) [in Russian].

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    M. V. Starostin

Authors
  1. M. V. Starostin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. V. Starostin.

Additional information

Original Russian Text © M.V. Starostin, 2018, published in Vestnik Moskovskogo Universiteta, Matematika. Mekhanika, 2018, Vol. 73, No. 6, pp. 36–40.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Starostin, M.V. Some Implicitly Precomplete Classes of Functions of Three-Valued Logic Preserving Subsets. Moscow Univ. Math. Bull. 73, 245–248 (2018). https://doi.org/10.3103/S0027132218060050

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Search

Navigation