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, 2018, Volume 30, Issue 4, Pages 47–54
DOI: https://doi.org/10.4213/dm1523
(Mi dm1523)
 

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

Completeness criterion for the enumeration closure operator in three-valued logic

S. S. Marchenkov

Lomonosov Moscow State University
Full-text PDF (145 kB) Citations (2)
References:
Abstract: A completeness criterion for the enumeration closure operator in three-valued logic is obtained, and all 13 precomplete classes are described.
Keywords: enumeration closure operator, three-valued logic.
Funding agency Grant number
Russian Foundation for Basic Research 16-01-00593
Received: 22.05.2018
English version:
Discrete Mathematics and Applications, 2020, Volume 30, Issue 1, Pages 1–6
DOI: https://doi.org/10.1515/dma-2020-0001
Bibliographic databases:
Document Type: Article
UDC: 519.716.325
Language: Russian
Citation: S. S. Marchenkov, “Completeness criterion for the enumeration closure operator in three-valued logic”, Diskr. Mat., 30:4 (2018), 47–54; Discrete Math. Appl., 30:1 (2020), 1–6
Citation in format AMSBIB
\Bibitem{Mar18}
\by S.~S.~Marchenkov
\paper Completeness criterion for the enumeration closure operator in three-valued logic
\jour Diskr. Mat.
\yr 2018
\vol 30
\issue 4
\pages 47--54
\mathnet{http://mi.mathnet.ru/dm1523}
\crossref{https://doi.org/10.4213/dm1523}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3884627}
\elib{https://elibrary.ru/item.asp?id=36447991}
\transl
\jour Discrete Math. Appl.
\yr 2020
\vol 30
\issue 1
\pages 1--6
\crossref{https://doi.org/10.1515/dma-2020-0001}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000513931900001}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85080865814}
Linking options:
  • https://www.mathnet.ru/eng/dm1523
  • https://doi.org/10.4213/dm1523
  • https://www.mathnet.ru/eng/dm/v30/i4/p47
  • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретная математика
    Statistics & downloads:
    Abstract page:334
    Full-text PDF :31
    References:34
    First page:24
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024