Abstract
The problem of implicit expressibility in many-valued logics is considered. Necessary and sufficient conditions for a class of autodual functions to be implicitly maximal are obtained.
Similar content being viewed by others
Notes
From now on, \(k\) is understood as a natural number, not less that two.
REFERENCES
A. V. Kuznetsov, ‘‘Means for detection of nondeducibility and inexpressibility,’’ in Logical Inference (Nauka, Moscow, 1979), pp. 5–33.
O. M. Kasim-Zade, ‘‘Implicit completeness in the \(k\)-valued logic,’’ Moscow Univ. Math. Bull. 62, 90–94 (2007). https://doi.org/10.3103/S0027132207030023
O. M. Kasim-Zade, ‘‘Implicit expressibility in two-valued logic and cryptoisomorphisms of two-element algebras,’’ Dokl. Math. 53, 366–368 (1996).
M. V. Starostin, ‘‘Implicitly maximal classes and implicit completeness criterion in the three-valued logic,’’ Moscow Univ. Math. Bull. 73, 82–84 (2018). https://doi.org/10.3103/S0027132218020067
E. A. Orekhova, ‘‘On a criterion of implicit incompleteness in three-valued logic,’’ Mat. Vopr. Kibern. 12, 27–74 (2003).
S. V. Yablonskii, ‘‘Functional constructions in \(k\)-valued logic,’’ Tr. Mat. Inst. Akad. Nauk SSSR 51, 5–142 (1958).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
The author declares that he has no conflicts of interest.
Additional information
Translated by E. Oborin
About this article
Cite this article
Starostin, M.V. On the Classes of Autodual Functions Implicitly Maximal in \(\boldsymbol{P}_{\boldsymbol{k}}\). Moscow Univ. Math. Bull. 77, 154–159 (2022). https://doi.org/10.3103/S0027132222030093
Received:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0027132222030093