Geodesic
On some implicitly precomplete classes of monotone functions in $P_k$
Diskretnaya Matematika, Tome 30 (2018) no. 4, pp. 106-114.

Voir la notice de l'article provenant de la source Math-Net.Ru

The paper is concerned with the completeness problem in implicit expressibility in a multi-valued logics $P_k$. For each $k\geq 2$ and any nontrivial order relation on the set $\{0,1,\dots,k-1\}$ we find two implicitly precomplete classes of functions which are monotone with respect to this order
Keywords: many-valued logics, implicit expressibility, maximal classes, monotone function. 
@article{DM_2018_30_4_a9,
     author = {M. V. Starostin},
     title = {On some implicitly precomplete classes of monotone functions in $P_k$},
     journal = {Diskretnaya Matematika},
     pages = {106--114},
     publisher = {mathdoc},
     volume = {30},
     number = {4},
     year = {2018},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2018_30_4_a9/}
}
TY  - JOUR
AU  - M. V. Starostin
TI  - On some implicitly precomplete classes of monotone functions in $P_k$
JO  - Diskretnaya Matematika
PY  - 2018
SP  - 106
EP  - 114
VL  - 30
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2018_30_4_a9/
LA  - ru
ID  - DM_2018_30_4_a9
ER  - 
%0 Journal Article
%A M. V. Starostin
%T On some implicitly precomplete classes of monotone functions in $P_k$
%J Diskretnaya Matematika
%D 2018
%P 106-114
%V 30
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2018_30_4_a9/
%G ru
%F DM_2018_30_4_a9
M. V. Starostin. On some implicitly precomplete classes of monotone functions in $P_k$. Diskretnaya Matematika, Tome 30 (2018) no. 4, pp. 106-114. http://geodesic.mathdoc.fr/item/DM_2018_30_4_a9/

[1] Kuznetsov A.V., “O sredstvakh dlya obnaruzheniya nevyvodimosti ili nevyrazimosti”, Logicheskii vyvod, 1979, 5–33

[2] Kasim-Zade O.M., “O neyavnoi vyrazimosti v dvuznachnoi logike i kriptoizomorfizmakh dvukhelementnykh algebr”, Dokl. RAN, 348 (1996), 299–301 | MR | Zbl

[3] Kasim-Zade O.M., “Ob odnoi mere slozhnosti neyavnykh i parametricheskikh predstavlenii”, Matem. voprosy kibernetiki, 6 (1996), 133–189 | MR

[4] Starostin M. V., “Implicitly maximal classes and implicit completeness criterion in the three-valued logic”, Moscow Univ. Math. Bulletin, 73:2, 82–84 | DOI | MR | Zbl

[5] Orekhova E.A., “Ob odnom kriterii neyavnoi polnoty v trekhznachnoi logike”, Matem. voprosy kibernetiki, 12 (2003), 27–74

[6] Kasim-Zade O. M., “Implicit completeness in the $k$-valued logic”, Moscow Univ. Math. Bulletin, 62:3, 90–94 | DOI | Zbl

[7] Orekhova E.A., “Ob odnom kriterii neyavnoi polnoty v $k$-znachnoi logike”, Matem. voprosy kibernetiki, 11 (2002), 77–90 | MR | Zbl

[8] Burle G.A., “Klassy $k$-znachnoi logiki, soderzhaschie vse funktsii odnoi peremennoi”, Diskretnyi analiz, 10 (1967), 3–7 | MR | Zbl

[9] Cohn P. M., Universal Algebra, Harper Row, New York, 1965 | MR | MR | Zbl

[10] Kuznetsov A.V., “Algebra logiki i ee obobscheniya”, Matematika v SSSR za sorok let, v. I \year 1959, Fizmatlit, M., 102–115

[11] Bodnarchuk V.G., Kaluzhnin L.A., Kotov V.N., Romov B.A., “Teoriya Galua dlya algebr Posta”, Kibernetika, 3 (1969), 1–10 | Zbl

[12] Tolstova Yu.N., “O modelirovanii $l$-znachnoi logiki v $k$-znachnoi ($k > l$)”, Problemy kibernetiki, 18 (1967), 67–82 | MR

[13] Lau D., Function Algebras on Finite Sets, Springer, Heidelberg, 2006, 668 pp. | Zbl

[14] Korobkov V. K., Reznik T. L., “O nekotorykh algoritmakh vychisleniya monotonnykh funktsii algebry logiki”, Dokl. AN SSSR, 147 (1962), 1022–1025 | MR | Zbl

[15] Birkhoff G., Lattice Theory, AMS, Providence, 1967 | MR | Zbl

[16] Danil'chenko A. F., “Parametric expressibility of functions of three-valued logic”, Algebra and Logic, 16:4 (1977), 266–280 | DOI | MR | Zbl

[17] Orekhova E.A., “O kriterii neyavnoi shefferovosti v trekhznachnoi logike”, Diskretnyi analiz i issledovanie operatsii. Ser. 1, 10:3 (2003), 82–105 | MR | Zbl