Geodesic
Some implicitly precomplete classes of functions of three-valued logic preserving subsets
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 6 (2018), pp. 36-40 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

The problem of implicit expressibility in the three-valued logic $P_3$ is considered. A set of implicitly maximal classes preserving two-element subsets is described. 
@article{VMUMM_2018_6_a4,
     author = {M. V. Starostin},
     title = {Some implicitly precomplete classes of functions of three-valued logic preserving subsets},
     journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
     pages = {36--40},
     year = {2018},
     number = {6},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMUMM_2018_6_a4/}
}
TY  - JOUR
AU  - M. V. Starostin
TI  - Some implicitly precomplete classes of functions of three-valued logic preserving subsets
JO  - Vestnik Moskovskogo universiteta. Matematika, mehanika
PY  - 2018
SP  - 36
EP  - 40
IS  - 6
UR  - http://geodesic.mathdoc.fr/item/VMUMM_2018_6_a4/
LA  - ru
ID  - VMUMM_2018_6_a4
ER  - 
%0 Journal Article
%A M. V. Starostin
%T Some implicitly precomplete classes of functions of three-valued logic preserving subsets
%J Vestnik Moskovskogo universiteta. Matematika, mehanika
%D 2018
%P 36-40
%N 6
%U http://geodesic.mathdoc.fr/item/VMUMM_2018_6_a4/
%G ru
%F VMUMM_2018_6_a4
M. V. Starostin. Some implicitly precomplete classes of functions of three-valued logic preserving subsets. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 6 (2018), pp. 36-40. http://geodesic.mathdoc.fr/item/VMUMM_2018_6_a4/

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

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

[3] Starostin M. V., “Neyavno predpolnye klassy i kriterii neyavnoi polnoty v trekhznachnoi logike”, Vestn. Mosk. un-ta. Matem. Mekhan., 2018, no. 2, 56–59 | Zbl

[4] Kasim-Zade O. M., “O neyavnoi polnote v $k$-znachnoi logike”, Vestn. Mosk. un-ta. Matem. Mekhan., 2007, no. 3, 9–13 | MR | Zbl

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

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

[7] Yablonskii S. V., “Funktsionalnye postroeniya v $k$-znachnoi logike”, Sb. statei po matematicheskoi logike i ee prilozheniyam k nekotorym voprosam kibernetiki, Izd-vo AN SSSR, M., 1958, 5–142

[8] Blokhina G. N., “O predikatnom opisanii klassov Posta”, Diskretnyi analiz, 16, Novosibirsk, 1970, 16–29 | Zbl