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, 1989, Volume 1, Issue 2, Pages 65–77 (Mi dm910)  

Complexity of the solution of the problem of $\alpha$-expressibility in $k$-valued logic

N. R. Emel'yanov
Received: 05.10.1988
Bibliographic databases:
UDC: 519.716
Language: Russian
Citation: N. R. Emel'yanov, “Complexity of the solution of the problem of $\alpha$-expressibility in $k$-valued logic”, Diskr. Mat., 1:2 (1989), 65–77
Citation in format AMSBIB
\Bibitem{Eme89}
\by N.~R.~Emel'yanov
\paper Complexity of the solution of the problem of $\alpha$-expressibility in $k$-valued logic
\jour Diskr. Mat.
\yr 1989
\vol 1
\issue 2
\pages 65--77
\mathnet{http://mi.mathnet.ru/dm910}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1035095}
\zmath{https://zbmath.org/?q=an:0733.03015}
Linking options:
  • https://www.mathnet.ru/eng/dm910
  • https://www.mathnet.ru/eng/dm/v1/i2/p65
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретная математика
    Statistics & downloads:
    Abstract page:292
    Full-text PDF :127
    References:1
    First page:1
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025