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 1, Pages 19–38
DOI: https://doi.org/10.4213/dm1478 (Mi dm1478) 		 
This article is cited in 7 scientific papers (total in 7 papers)

Cardinality of generating sets for operations from the Post lattice classes

S. A. Komkov

Lomonosov Moscow State University
Full-text PDF (1023 kB) Citations (7)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1478
Abstract: We obtain precise values of cardinality of minimal generating sets for all Cartesian products of two-element set with respect to an arbitrary set of Boolean operations from the central part of the Post lattice. For the case of sets containing operations from the remaining classes of the Post lattice we obtain cardinality estimations that are accurate up to one.
Keywords: generating sets, finite sets, Boolean functions, Boolean algebra.
Received: 25.10.2017
Revised: 11.11.2017
English version:
Discrete Mathematics and Applications, 2019, Volume 29, Issue 3, Pages 159–173
DOI: https://doi.org/10.1515/dma-2019-0015
Bibliographic databases:
Document Type: Article
UDC: 519.716.5
Language: Russian
Citation: S. A. Komkov, “Cardinality of generating sets for operations from the Post lattice classes”, Diskr. Mat., 30:1 (2018), 19–38; Discrete Math. Appl., 29:3 (2019), 159–173
Citation in format AMSBIB
\Bibitem{Kom18}
\by S.~A.~Komkov
\paper Cardinality of generating sets for operations from the Post lattice classes
\jour Diskr. Mat.
\yr 2018
\vol 30
\issue 1
\pages 19--38
\mathnet{http://mi.mathnet.ru/dm1478}
\crossref{https://doi.org/10.4213/dm1478}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3781288}
\elib{https://elibrary.ru/item.asp?id=32641284}
\transl
\jour Discrete Math. Appl.
\yr 2019
\vol 29
\issue 3
\pages 159--173
\crossref{https://doi.org/10.1515/dma-2019-0015}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000471785800002}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85068177061}
Linking options:
  • https://www.mathnet.ru/eng/dm1478
  • https://doi.org/10.4213/dm1478
  • https://www.mathnet.ru/eng/dm/v30/i1/p19
    • This publication is cited in the following 7 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:489
    Full-text PDF :88
    References:58
    First page:32
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024