Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskretnaya Matematika, 1999, Volume 11, Issue 4, Pages 110–126
DOI: https://doi.org/10.4213/dm400
(Mi dm400)
 

This article is cited in 32 scientific papers (total in 32 papers)

On the expressibility of functions of many-valued logic in some logical-functional classes

S. S. Marchenkov
Abstract: For each $k$, $k\ge2$, three logical-functional languages are introduced for the set of functions of $k$-valued logic: the positive expressibility language $\operatorname{Pos}_k$, the first-order language $1\operatorname{L}_k$, and the second-order language $2\operatorname{L}_k$. On the basis of the notion of expressibility in a language, the corresponding closure operators are defined. It is proved that the operators of $1\operatorname{L}_k$-closure and $2\operatorname{L}_k$-closure coincide. The $1\operatorname{L}_k$-closed and $\operatorname{Pos}_k$-closed classes are described with the help of symmetric groups and symmetric semigroups. The expressibility in the languages $1\operatorname{L}_k$ and $\operatorname{Pos}_k$ is compared with the parametric expressibility and the expressibility by terms.
The research was supported by the Russian Foundation for Basic Research, grant 97–01–00989.
Received: 05.11.1998
Bibliographic databases:
UDC: 519.7
Language: Russian
Citation: S. S. Marchenkov, “On the expressibility of functions of many-valued logic in some logical-functional classes”, Diskr. Mat., 11:4 (1999), 110–126; Discrete Math. Appl., 9:6 (1999), 563–581
Citation in format AMSBIB
\Bibitem{Mar99}
\by S.~S.~Marchenkov
\paper On the expressibility of functions of many-valued logic in some logical-functional classes
\jour Diskr. Mat.
\yr 1999
\vol 11
\issue 4
\pages 110--126
\mathnet{http://mi.mathnet.ru/dm400}
\crossref{https://doi.org/10.4213/dm400}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1761017}
\zmath{https://zbmath.org/?q=an:0974.03028}
\transl
\jour Discrete Math. Appl.
\yr 1999
\vol 9
\issue 6
\pages 563--581
Linking options:
  • https://www.mathnet.ru/eng/dm400
  • https://doi.org/10.4213/dm400
  • https://www.mathnet.ru/eng/dm/v11/i4/p110
  • This publication is cited in the following 32 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретная математика
    Statistics & downloads:
    Abstract page:1221
    Full-text PDF :587
    First page:1
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024